The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Combating imbalance in network intrusion datasets
Abstract
An approach to combating network intrusion is the development of systems applying machine learning and data min- ing techniques. Many IDS (Intrusion Detection Systems) suffer from a high rate of false alarms and missed intrusions. We want to be able to improve the intrusion detection rate at a reduced false positive rate. The focus of this paper is rule-learning, using RIPPER, on highly imbalanced intrusion datasets with an objective to improve the true positive rate (intrusions) without significantly increasing the false positives. We use RIPPER as the underlying rule classifier. To counter imbalance in data, we implement a combination of oversampling (both by replication and synthetic generation) and undersampling techniques. We also propose a clustering based methodology for oversampling by generating synthetic instances. We evaluate our approaches on two intrusion datasets — destination and actual packets based — constructed from actual Notre Dame traffic, giving a flavor of real-world data with its idiosyncrasies. Using ROC analysis, we show that oversampling by synthetic generation of minority (intrusion) class outperforms oversampling by replication and RIPPER's loss ratio method. Additionally, we establish that our clustering based approach is more suitable for the detecting intrusions and is able to provide additional improvement over just synthetic generation of instances.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
Self-citationMeasuring the Accuracy of Diagnostic Systems
Swets, J. A. (1988) · Science · doi:10.1126/science.3287615 · Cited by 10,058
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
Editorial: special issue on learning from imbalanced data sets
Chawla, N. V., Japkowicz, N., & Kotcz, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007733 · Cited by 2,063
Self-citationMining with rarity: a unifying framework
Weiss, G. M. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007734 · Cited by 1,393
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Learning when training data are costly: the effect of class distribution on tree induction
Weiss, G. M., & Provost, F. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1199 · Cited by 921
Evaluating intrusion detection systems: the 1998 DARPA off-line intrusion detection evaluation
Lippmann, R. P., Fried, D. J., Graf, I., Haines, J. W., Kendall, K. R., McClung, D., Weber, D., Webster, S. E., Wyschogrod, D., Cunningham, R. K., et al. (2002) · Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00 · doi:10.1109/discex.2000.821506 · Cited by 917
A Comparative Study of Anomaly Detection Schemes in Network Intrusion Detection
Lazarevic, A., Ertoz, L., Kumar, V., Ozgur, A., & Srivastava, J. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.3 · Cited by 865
A weighted nearest neighbor algorithm for learning with symbolic features
Cost, S., & Salzberg, S. (1993) · Machine Learning · doi:10.1007/bf00993481 · Cited by 764
Improving Identification of Difficult Small Classes by Balancing Class Distribution
Laurikkala, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-48229-6_9 · Cited by 748
The base-rate fallacy and the difficulty of intrusion detection
Axelsson, S. (2000) · ACM Transactions on Information and System Security · doi:10.1145/357830.357849 · Cited by 638
Anomaly detection in IP networks
Thottan, M., & Ji, C. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814797 · Cited by 541
SPECIAL ISSUE ON LEARNING FROM IMBALANCED DATA SETS
Chawla, N. V., Japkowicz, N., & Kołcz, A. (2004) · Cited by 325
Self-citationThe NIDES Statistical Component Description and Justification
Javitz, H. S., & Valdes, A. (1994) · Cited by 252
Online identification of hierarchical heavy hitters
Zhang, Y., Singh, S. R., Sen, S. B., Duffield, N. G., & Lund, C. (2004) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1028788.1028802 · Cited by 198
Data mining for network intrusion detection : How to get started
Bloedorn, E. (2001) · Cited by 111
Cited by
Survey on deep learning with class imbalance
Johnson, J. M., & Khoshgoftaar, T. M. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0192-5 · Cited by 3,032
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2161285 · Cited by 2,794
Improving imbalanced learning through a heuristic oversampling method based on k-means and SMOTE
Douzas, G., Bacao, F., & Last, F. (2018) · Information Sciences · doi:10.1016/j.ins.2018.06.056 · Cited by 1,277
SMOTE for high-dimensional class-imbalanced data
Blagus, R., & Lusa, L. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-106 · Cited by 1,106
Effective data generation for imbalanced learning using conditional generative adversarial networks
Douzas, G., & Bacao, F. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.09.030 · Cited by 601
Metadata
- Authors
- Cieslak, D. A., Chawla, N. V., & Striegel, A.
- Venue
- 2006 IEEE International Conference on Granular Computing
- Publisher
- IEEE
- Published
- 2006-06-08
- Pages
- 732-737
- OpenAlex
- W2126996952
- Cited by
- 286
- References
- 19
- FWCI
- 0.23
- 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.