The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Naive Bayes vs decision trees in intrusion detection systems
Abstract
Bayes networks are powerful tools for decision and reasoning under uncertainty. A very simple form of Bayes networks is called naive Bayes, which are particularly efficient for inference tasks. However, naive Bayes are based on a very strong independence assumption. This paper offers an experimental study of the use of naive Bayes in intrusion detection. We show that even if having a simple structure, naive Bayes provide very competitive results. The experimental study is done on KDD'99 intrusion data sets. We consider three levels of attack granularities depending on whether dealing with whole attacks, or grouping them in four main categories or just focusing on normal and abnormal behaviours. In the whole experimentations, we compare the performance of naive Bayes networks with one of well known machine learning techniques which is decision tree. Moreover, we compare the good performance of Bayes nets with respect to existing best results performed on KDD'99.
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1992) · Cited by 23,431
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
(1988) · Cited by 16,582
Introduction to Bayesian Networks
(2019) · Operational Risk Modelling in Financial Services · doi:10.1002/9781119508557.ch12 · Cited by 2,569
The computational complexity of probabilistic inference using bayesian belief networks
Cooper, G. F. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90060-d · Cited by 1,937
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,586
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
Intrusion Detection Systems: A Survey and Taxonomy
Axelsson, S. (2002) · Cited by 775
State transition analysis: a rule-based intrusion detection approach
Ilgun, K., Kemmerer, R. A., & Porras, P. A. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.372146 · Cited by 747
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 5×
“Valdes [14] uses a simple form of Bayes networks, called naive Bayes, composed of two levels: one root node which represents a session class (normal and di.erent kinds of attacks), and several leaf nodes, each of them contain a feature of a connection.”
MethodInfluential
Cited by
A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection
Buczak, A. L., & Guven, E. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2494502 · Cited by 3,332
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036
A Detailed Investigation and Analysis of Using Machine Learning Techniques for Intrusion Detection
Mishra, P., Varadharajan, V., Tupakula, U., & Pilli, E. S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2847722 · Cited by 738
Survey on Anomaly Detection using Data Mining Techniques
Agrawal, S., & Agrawal, J. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.08.220 · Cited by 595
A Survey on Machine Learning Techniques for Cyber Security in the Last Decade
Shaukat, K., Luo, S., Varadharajan, V., Hameed, I. A., & Xu, M. (2020) · IEEE Access · doi:10.1109/access.2020.3041951 · Cited by 530
Metadata
- Authors
- Amor, N. B., Benferhat, S., & Elouedi, Z.
- Venue
- Proceedings of the 2004 ACM symposium on Applied computing
- Publisher
- ACM
- Published
- 2004-03-14
- Pages
- 420-424
- OpenAlex
- W2169768310
- Cited by
- 479
- References
- 11
- FWCI
- 4.12
- 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.