The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Random-Forests-Based Network Intrusion Detection Systems
Abstract
Prevention of security breaches completely using the existing security technologies is unrealistic. As a result, intrusion detection is an important component in network security. However, many current intrusion detection systems (IDSs) are rule-based systems, which have limitations to detect novel intrusions. Moreover, encoding rules is time-consuming and highly depends on the knowledge of known intrusions. Therefore, we propose new systematic frameworks that apply a data mining algorithm called random forests in misuse, anomaly, and hybrid-network-based IDSs. In misuse detection, patterns of intrusions are built automatically by the random forests algorithm over training data. After that, intrusions are detected by matching network activities against the patterns. In anomaly detection, novel intrusions are detected by the outlier detection mechanism of the random forests algorithm. After building the patterns of network services by the random forests algorithm, outliers related to the patterns are determined by the outlier detection algorithm. The hybrid detection system improves the detection performance by combining the advantages of the misuse and anomaly detection. We evaluate our approaches over the knowledge discovery and data mining 1999 (KDDpsila99) dataset. The experimental results demonstrate that the performance provided by the proposed misuse approach is better than the best KDDpsila99 result; compared to other reported unsupervised anomaly detection approaches, our anomaly detection approach achieves higher detection rate when the false positive rate is low; and the presented hybrid system can improve the overall performance of the aforementioned IDSs.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Chiang, L. H., Russell, E. L., & Braatz, R. D. (2001) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0347-9_3 · Cited by 5,003
Hand, D. J., Mannila, H., & Smyth, P. (2001) · Cited by 2,581
Smith, A. (2002) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(02)00058-1 · Cited by 1,700
Probability Estimates for Multi-class Classification by Pairwise Coupling
Wu, T., Lin, C., & Weng, R. C. (2004) · Journal of Machine Learning Research · doi:10.5555/1005332.1016791 · Cited by 1,468
McHugh, J. (2000) · ACM Transactions on Information and System Security · doi:10.1145/382912.382923 · Cited by 1,309
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Probability Estimates for Multi-class Classification by Pairwise Coupling
Wu, T., Lin, C., Weng, R. C., & Singer, Y. (2003) · Cited by 989
A 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
Freeman, J., Barnett, V., & Lewis, T. (1995) · The Journal of the Operational Research Society · doi:10.2307/3009915 · Cited by 727
A Geometric Framework for Unsupervised Anomaly Detection: Detecting Intrusions in Unlabeled Data
Eskin, E., Arnold, A. O., Prerau, M. J., Portnoy, L., & Stolfo, S. J. (2002) · doi:10.7916/d8d50tqt · Cited by 603
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
Next-generation Intrusion Detection Expert System (NIDES)A Summary
Anderson, D., Frivold, T., & Valdes, A. (1997) · Cited by 354
Unsupervised anomaly detection in network intrusion detection using clusters
Leung, K., & Leckie, C. A. (2005) · Cited by 349
Adaptive Intrusion Detection: A Data Mining Approach
Lee, W., Stolfo, S. J., & Mok, K. W. (2000) · Artificial Intelligence Review · doi:10.1023/a:1006624031083 · Cited by 347
Results of the KDD'99 classifier learning
Elkan, C. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846199 · Cited by 292
Applications of Data Mining in Computer Security
(2002) · Advances in Information Security · doi:10.1007/978-1-4615-0953-0 · Cited by 272
Robust Prediction of Fault-Proneness by Random Forests
Guo, L., Ma, Y., Cukic, B., & Singh, H. (2005) · 15th International Symposium on Software Reliability Engineering · doi:10.1109/issre.2004.35 · Cited by 271
Anomaly Based Network Intrusion Detection with Unsupervised Outlier Detection
Zhang, J., & Zulkernine, M. (2006) · 2006 IEEE International Conference on Communications · doi:10.1109/icc.2006.255127 · Cited by 256
Self-citationADAM: a testbed for exploring the use of data mining in intrusion detection
Barbará, D., Couto, J., Jajodia, S., & Wu, N. (2001) · ACM SIGMOD Record · doi:10.1145/604264.604268 · Cited by 239
FUZZY DATA MINING AND GENETIC ALGORITHMS APPLIED TO INTRUSION DETECTION
Bridges, S. M. (2002) · Cited by 235
Undermining an Anomaly-Based Intrusion Detection System Using Common Exploits
Tan, K. M. C., Killourhy, K. S., & Maxion, R. A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36084-0_4 · Cited by 212
Detecting Anomalous Network Traffic with Self-organizing Maps
Ramadas, M., Ostermann, S., & Tjaden, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45248-5_3 · Cited by 211
A hybrid network intrusion detection technique using random forests
Zhang, J., & Zulkernine, M. (2006) · First International Conference on Availability, Reliability and Security (ARES'06) · doi:10.1109/ares.2006.7 · Cited by 200
Self-citationNETWORK-BASED INTRUSION DETECTION USING NEURAL NETWORKS
Bivens, A., Palagiri, C., Smith, R. N., et al. (2002) · Cited by 178
Algorithms for spatial outlier detection
Lu, C., Chen, D., & Kou, Y.-Y. (2004) · Proceedings · doi:10.1109/icdm.2003.1250986 · Cited by 168
A Serial Combination of Anomaly and Misuse IDSes Applied to HTTP Traffic
Tombini, E., Debar, H., Mé, L., & Ducassé, M. (2005) · Annual Computer Security Applications Conference · doi:10.1109/csac.2004.4 · Cited by 93
Network Intrusion Detection using Random Forests.
Zhang, J., & Zulkernine, M. (2005) · Conference on Privacy, Security and Trust · Cited by 85
Self-citationDistributed intrusion detection based on clustering
Zhang, Y., Xiong, Z., & Wang, X. (2005) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2005.1527342 · Cited by 54
Network-Based Intrusion Detection Using Adaboost Algorithm
Hu, W., & Hu, W. (2005) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2005.107 · Cited by 37
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
A Deep Learning Approach for Intrusion Detection Using Recurrent Neural Networks
Yin, C., Zhu, Y., Fei, J., & He, X. (2017) · IEEE Access · doi:10.1109/access.2017.2762418 · Cited by 2,100
“RELEVANT WORK In prior studies, a number of approaches based on traditional machine learning, including SVM [10], [11], K-Nearest Neighbour (KNN) [12], ANN [13], Random Forest (RF) [14], [15] and others [16], [17], have been proposed and have achieved success for an intrusion detection system.”
MethodDeep Learning Approach for Intelligent Intrusion Detection System
Vinayakumar, R., Alazab, M., Soman, K. P., Poornachandran, P., Al-Nemrat, A., & Venkatraman, S. (2019) · IEEE Access · doi:10.1109/access.2019.2895334 · Cited by 1,946
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
Data mining for credit card fraud: a comparative study
Bhattacharyya, S., Jha, S., Tharakunnel, K., & Westland, J. C. (2011) · Decision Support Systems · doi:10.1016/j.dss.2010.08.008 · Cited by 1,108
Metadata
- Authors
- Zhang, J., Zulkernine, M., & Haque, A.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
- Published
- 2008-09
- Volume
- 38
- Issue
- 5
- Pages
- 649-659
- ISSN
- 1094-6977 (ISSN-L)
- OpenAlex
- W2100537916
- Cited by
- 574
- References
- 31
- FWCI
- 7.68
- Type
- journal article
- 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.