A new data mining based network Intrusion Detection model
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
Nowadays, as information systems are more open to the Internet, the importance of secure networks is tremendously increased. New intelligent Intrusion Detection Systems (IDSs) which are based on sophisticated algorithms rather than current signature-base detections are in demand. There is often the need to update an installed Intrusion Detection System (IDS) due to new attack methods or upgraded computing environments. Since many current Intrusion Detection Systems are constructed by manual encoding of expert knowledge, changes to them are expensive and slow. In data mining-based intrusion detection system, we should make use of particular domain knowledge in relation to intrusion detection in order to efficiently extract relative rules from large amounts of records. This paper proposes new ensemble boosted decision tree approach for intrusion detection system. Experimental results shows better results for detecting intrusions as compared to others existing methods.
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 approach was presented by Gudadhe et al. in [309]. This approach is a new network intrusion detection model using boosted decision trees.”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [309]
In the citing paper
“The generalized accuracy of the boosted decision tree was compared with different algorithms such as Naïve Bayes, k-nearest neighbour (kNN) and the testing results show that this algorithm outperform existing algorithms when applied for real-world intrusion.”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [309]
Citations
Cites
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149 · cited 1×
“However, recent outlier detection algorithms that we utilize in this study are based on computing the full dimensional distances of the points from one another [9] [16] as well as on computing the densities of local neighborhoods [6].”
MethodDenning, D. E. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232894 · Cited by 3,427
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335437 · Cited by 1,860
Atkinson, A., Barnett, V., & Lewis, T. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983451 · Cited by 1,682
Algorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171
Research works printed but not linked: 3
- panda, 2009, Ensemble Rule Based Classifiers for Detecting Network Intrusions, 19
- masud, 0, Classifying Evolving Data Streams for Intrusion Detection
- lee, 0, Data mining approaches for intrusion detection, Proc of the 7th USENIX Security Symp San Antonio TX 1998
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
“Both security and performance analysis state that it is more secure and effi-cient compared to other well-known authentication schemes.”
A survey of intrusion detection systems based on ensemble and hybrid classifiers
Aburomman, A. A., & Reaz, M. B. I. (2017) · Computers & Security · doi:10.1016/j.cose.2016.11.004 · Cited by 254
Unsupervised Clustering Approach for Network Anomaly Detection
Syarif, I., Prugel-Bennett, A., & Wills, G. (2012) · Communications in Computer and Information Science · doi:10.1007/978-3-642-30507-8_13 · Cited by 195
Application of Bagging, Boosting and Stacking to Intrusion Detection
Syarif, I., Zaluska, E., Prügel‐Bennett, A., & Wills, G. B. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31537-4_46 · Cited by 168
A new feature selection IDS based on genetic algorithm and SVM
Gharaee, H., & Hosseinvand, H. (2016) · International Symposium on Telecommunications · doi:10.1109/istel.2016.7881798 · Cited by 157
Metadata
- Authors
- Gudadhe, M., Prasad, P., & Kapil Wankhade, L.
- Affiliations
- Priyadarshini College of Engineering (IN)
- ORCID
- Prasad, Prakash
- Venue
- 2010 International Conference on Computer and Communication Technology (ICCCT)
- Publisher
- IEEE
- Published
- 2010-09
- Pages
- 731-735
- OpenAlex
- W2008868972
- Cited by
- 59
- References
- 19
- Citations by year
- 2025: 1 · 2024: 5 · 2023: 3 · 2022: 2 · 2021: 9 · 2020: 2 · 2019: 5 · 2017: 1 · 2016: 4 · 2015: 3 · 2014: 8 · 2013: 8 · 2012: 6
- FWCI
- 4.62
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Computer and Communication Technology (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
- Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Immune Systems Applications
- Keywords
- intrusion detection systems, data mining, ensemble boosting, decision tree, rule extraction, network security, attack detection, expert knowledge
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A new data mining based network Intrusion Detection model. https://app.cochat.ai/papers/10.1109/iccct.2010.5640375
- The paper
- Gudadhe, M., Prasad, P., & Kapil Wankhade, L. (2010). A new data mining based network Intrusion Detection model. 2010 International Conference on Computer and Communication Technology (ICCCT). https://doi.org/10.1109/iccct.2010.5640375
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.