The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Learning rules for anomaly detection of hostile network traffic
Abstract
We introduce an algorithm called LERAD that learns rules for finding rare events in nominal time-series data with long range dependencies. We use LERAD to find anomalies in network packets and TCP sessions to detect novel intrusions. We evaluated LERAD on the 1999 DARPA/Lincoln Laboratory intrusion detection evaluation data set and on traffic collected in a university departmental server environment.
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
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
Adaptive, model-based monitoring for cyber attack detection
Valdes, A., & Skinner, K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-39945-3_6 · Cited by 309 · cited 2×
“Network anomaly detection systems such as ADAM [2], SPADE [3], and eBayes [11], use machine learning approaches to model normal network traffic in order to identify unusual events as suspicious, but they model low-level (firewall-like) features such as addresses and port numbers, rather than application protocols.”
Method
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“Association rule mining-based techniques have been used for network intrusion detection [Mahoney and Chan 2002, 2003; Mahoney et al. 2003; Tandon and Chan 2007; Barbara et al. 2001a; Otey et al. 2003, system call intrusion detection [Lee et al. 2000; Lee and Stolfo 1998; Qin and Hwang 2004],…”
MethodAn overview of anomaly detection techniques: Existing solutions and latest technological trends
Patcha, A., & Park, J.-M. (2007) · Computer Networks · doi:10.1016/j.comnet.2007.02.001 · Cited by 1,561
Network Anomaly Detection: Methods, Systems and Tools
Bhuyan, M. H., Bhattacharyya, D. K., & Kalita, J. K. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.052213.00046 · Cited by 1,348
Machine Learning for Anomaly Detection: A Systematic Review
Nassif, A. B., Talib, M. A., Nasir, Q., & Dakalbab, F. M. (2021) · IEEE Access · doi:10.1109/access.2021.3083060 · Cited by 748
An Analysis of the 1999 DARPA/Lincoln Laboratory Evaluation Data for Network Anomaly Detection
Mahoney, M. V., & Chan, P. K. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45248-5_13 · Cited by 535
Self-citation
Metadata
- Authors
- Mahoney, M. V., & Chan, P. K.
- Venue
- Third IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2003
- Pages
- 601-604
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2147191819
- Cited by
- 201
- References
- 2
- FWCI
- 5.82
- Type
- conference paper
- Language
- en
- Open access
- closed
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.