The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Mining in a data-flow environment: experience in network intrusion detection
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 2×
“We first give a brief overview of the problem of network intrusion detection, and summarize the extentions we made to the basic association rules [AIS93] and frequent episodes [ MTV95 ] algorithms, that are based on the characteristics of network audit data.”
MethodThe KDD process for extracting useful knowledge from volumes of data
Fayyad, U., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Communications of the ACM · doi:10.1145/240455.240464 · Cited by 1,934 · cited 1×
“Researchers have recognized that KDD is not a single plan of well-defined operations, rather, it is a sequence of iterative steps that include (but not limited to) data cleaning and preprocessing, feature extraction and data mining, and consolidating and utilizing the discovered knowledge [ FPSS96 ].”
Method
Cited by
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Self-citationA framework for constructing features and models for intrusion detection systems
Lee, W., & Stolfo, S. J. (2000) · ACM Transactions on Information and System Security · doi:10.1145/382912.382914 · Cited by 974
Self-citationEvaluating intrusion detection systems: the 1998 DARPA off-line intrusion detection evaluation
Lippmann, R. P., Fried, D. J., Graf, I., Haines, J. W., Kendall, K. R., McClung, D., Weber, D., Webster, S. E., Wyschogrod, D., Cunningham, R. K., et al. (2002) · Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00 · doi:10.1109/discex.2000.821506 · Cited by 917
Cost-based modeling for fraud and intrusion detection: results from the JAM project
Stolfo, S. J., Fan, W., Lee, W., Prodromidis, A., & Chan, P. K. (2002) · Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00 · doi:10.1109/discex.2000.821515 · Cited by 610
Self-citationAnomaly detection of web-based attacks
Kruegel, C., & Vigna, G. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948144 · Cited by 551
Metadata
- Authors
- Lee, W., Stolfo, S. J., & Mok, K. W.
- Venue
- Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 114-124
- OpenAlex
- W2012568697
- Cited by
- 223
- References
- 2
- FWCI
- 10.39
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.