A hybrid system for reducing the false alarm rate of anomaly intrusion detection system
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
In this paper, we propose a hybrid intrusion detection system that combines k-Means, and two classifiers: K-nearest neighbor and Naïve Bayes for anomaly detection. It consists of selecting features using an entropy based feature selection algorithm which selects the important attributes and removes the irredundant attributes. This algorithm operates on the KDD-99 Data set; this data set is used worldwide for evaluating the performance of different intrusion detection systems. The next step is clustering phase using k-Means. We have used the KDD99 (knowledge Discovery and Data Mining) intrusion detection contest. This system can detect the intrusions and further classify them into four categories: Denial of Service (DoS), U2R (User to Root), R2L (Remote to Local), and probe. The main goal is to reduce the false alarm rate of IDS1.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Another hybrid IDS approach was presented by Om et al. in [310]. This approach combines the merits of anomaly and misuse detection to overcome the very high false alarm rate of anomaly detection.”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [310]
In the citing paper
“The main drawback of their presented approach is that real-life datasets have a slightly small difference between normal and anomalous data.”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [310]
In the citing paper
“This hybrid IDS combines k-Means, K-nearest neighbour and Naïve Bayes for anomaly detection.”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [310]
Citations
Cites
A detailed analysis of the KDD CUP 99 data set
Tavallaee, M., Bagheri, E., Lu, W., & Ghorbani, A. A. (2009) · 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications · doi:10.1109/cisda.2009.5356528 · Cited by 5,396
Denning, D. E. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232894 · Cited by 3,427
Computer security threat monitoring and surveillance
Anderson, J. (1980) · Medical Entomology and Zoology · Cited by 1,726
Intrusion detection using neural networks and support vector machines
Mukkamala, S., Janoski, G., & Sung, A. (2003) · Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290) · doi:10.1109/ijcnn.2002.1007774 · Cited by 814
Use of K-Nearest Neighbor classifier for intrusion detection
Liao, Y., & Vemuri, V. R. (2002) · Computers & Security · doi:10.1016/s0167-4048(02)00514-x · Cited by 802
Naive Bayes vs decision trees in intrusion detection systems
Amor, N. B., Benferhat, S., & Elouedi, Z. (2004) · Proceedings of the 2004 ACM symposium on Applied computing · doi:10.1145/967900.967989 · Cited by 479 · cited 6×
“Some clustering algorithms are: k-Means [6], Agglomerative Hierarchical clustering and classification and DBSCAN [7].”
MethodInfluentialNext-generation Intrusion Detection Expert System (NIDES)A Summary
Anderson, D., Frivold, T., & Valdes, A. (1997) · Cited by 354
ADAM: 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
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
Network Intrusion Detection Design Using Feature Selection Of Soft Computing Paradigms
Chou, T., Yen, K. K., & Luo, J. (2008) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.1331228 · Cited by 90
Research works printed but not linked: 3
- 1999, KDD99 Cup Dataset
- 0, 1999 ACM Conference on Knowledge Discovery and Data Mining (KDD) Cup Dataset
- anderson, 1995, NIDES Next-generation Intrusion Detection Expert System (NIDES)
Cited by
Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations
Yaacoub, J.-P. A., Noura, H. N., Salman, O., & Chehab, A. (2022) · International Journal of Information Security · doi:10.1007/s10207-021-00545-8 · Cited by 320
“In addition, different authentication-factor solutions have also been presented in [276], where Xue et al. presented a temporal-credential-based mutual authentication scheme among the user, Gateway Node (GWN) and the sensor node.”
From intrusion detection to attacker attribution: A comprehensive survey of unsupervised methods
Nisioti, A., Mylonas, A., Yoo, P. D., & Katos, V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2854724 · Cited by 212
“The proposed method in [74] consists of three modules: feature selection, unsupervised clustering and supervised clas-”
MethodShallow and Deep Networks Intrusion Detection System: A Taxonomy and Survey
Hodo, E., Bellekens, X., Hamilton, A., Tachtatzis, C., & Atkinson, R. C. (2017) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · doi:10.48550/arxiv.1701.02145 · Cited by 212
“K-means is an example of clustering algorithm used as IDS [106],[107].”
A comprehensive review of AI based intrusion detection system
Sowmya, T., & Mary Anita, E. A. (2023) · Measurement: Sensors · doi:10.1016/j.measen.2023.100827 · Cited by 187
Detection of DDOS Attack using Deep Learning Model in Cloud Storage Application
Agarwal, A., Khari, M., & Singh, R. K. (2021) · Wireless Personal Communications · doi:10.1007/s11277-021-08271-z · Cited by 129
Metadata
- Authors
- Om, H., & Kundu, A.
- Affiliations
- Indian Institute of Technology Dhanbad (IN)
- ORCID
- Om, Hari
- Venue
- 2012 1st International Conference on Recent Advances in Information Technology (RAIT)
- Publisher
- IEEE
- Published
- 2012-03
- Pages
- 131-136
- OpenAlex
- W2108235800
- Cited by
- 113
- References
- 13
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 6 · 2023: 5 · 2022: 8 · 2021: 12 · 2020: 4 · 2019: 5 · 2018: 10 · 2017: 8 · 2016: 9 · 2015: 12 · 2014: 18 · 2013: 12 · 2012: 1
- FWCI
- 11.54
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Recent Advances in Information Technology (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Immune Systems Applications
- Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
- Keywords
- intrusion detection, anomaly detection, false alarm reduction, hybrid classifier, K-means clustering, k-nearest neighbors, naive Bayes, entropy-based feature selection, KDD Cup 1999 dataset, denial-of-service attacks, network intrusion classification
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.