Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kui W. Mok

dblp:49/971 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Network security · 100%
Databases, data mining, and information retrieval
2 papers
Data mining · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention
intrusion detection
0.131999
A Data Mining Framework for Building Intrusion Detection Models · S&P 1999
Mining in a Data-Flow Environment: Experience in Network Intrusion Detection · KDD 1999
Mining Audit Data to Build Intrusion Detection Models · KDD 1998
Data mining › feature engineering
automated feature engineering
0.011999
Mining in a Data-Flow Environment: Experience in Network Intrusion Detection · KDD 1999
Data mining › predictive modeling
classification
0.011999
A Data Mining Framework for Building Intrusion Detection Models · S&P 1999
Data mining › pattern mining
frequent pattern mining
0.011999
Mining in a Data-Flow Environment: Experience in Network Intrusion Detection · KDD 1999
Data mining › predictive modeling › classification
rule learning
0.011999
A Data Mining Framework for Building Intrusion Detection Models · S&P 1999
Network security › intrusion detection and prevention › intrusion detection
anomaly detection
0.011999
A Data Mining Framework for Building Intrusion Detection Models · S&P 1999
Network security › intrusion detection and prevention › intrusion detection › attack detection
misuse detection
0.011999
A Data Mining Framework for Building Intrusion Detection Models · S&P 1999

Methods — techniques the papers use, named apart from their topics

classification · 0.1meta-learning · 0.0frequent pattern mining · 0.0frequent episodes · 0.0association rules · 0.0data mining · 0.0
YearPublicationVenuePosition
1999 Mining in a Data-Flow Environment: Experience in Network Intrusion Detection
abstract
We discuss the KDD process in "data-flow" environments, where unstructured and time dependent data can be processed into various levels of structured and semanticallyrich forms for analysis tasks.Using network intrusion detection as a concrete application example, we describe how to construct models that are both acczLrate in describing the underlying concepts, and efficient when used to analyze data in real-time.We present procedures for analyzing frequent patterns from lower level data and constructing appropriate features to formulate higher level data.The features generated from various levels of data have different computational costs (in time and space).We show that in order to minimize the time required in using the classification models in a real-time environment, we can exploit the "necessary conditions" associated with the lowcost features to determine whether some high-cost features need to be computed and the corresponding classification rules need to be checked.We have applied our tools to the problem of building network intrusion detection models.We report our experiments using the network data provided as part of the 1998 DARPA Intrusion Detection Evaluation program.We also discuss our experience in using the mined models in NFR, a real-time network intrusion detection system.
Wenke Lee, Salvatore J. Stolfo, Kui W. Mok
KDD3
1999 A Data Mining Framework for Building Intrusion Detection Models
abstract
There is often the need to update an installed intrusion detection system (IDS) due to new attack methods or upgraded computing environments. Since many current IDSs are constructed by manual encoding of expert knowledge, changes to IDSs are expensive and slow. We describe a data mining framework for adaptively building Intrusion Detection (ID) models. The central idea is to utilize auditing programs to extract an extensive set of features that describe each network connection or host session, and apply data mining programs to learn rules that accurately capture the behavior of intrusions and normal activities. These rules can then be used for misuse detection and anomaly detection. New detection models are incorporated into an existing IDS through a meta-learning (or co-operative learning) process, which produces a meta detection model that combines evidence from multiple models. We discuss the strengths of our data mining programs, namely, classification, meta-learning, association rules, and frequent episodes. We report on the results of applying these programs to the extensively gathered network audit data for the 1998 DARPA Intrusion Detection Evaluation Program.
Wenke Lee, Salvatore J. Stolfo, Kui W. Mok
S&P3
1998 Mining Audit Data to Build Intrusion Detection Models
Wenke Lee, Salvatore J. Stolfo, Kui W. Mok
KDD3