On the capability of an SOM based intrusion detection system
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
An approach to network intrusion detection is investigated, based purely on a hierarchy of Self-Organizing Feature Maps. Our principle interest is to establish just how far such an approach can be taken in practice. To do so, the KDD benchmark dataset from the International Knowledge Discovery and Data Mining Tools Competition is employed. This supplies a connection-based description of a factitious computer network in which each connection is described in terms of 41 features. Unlike previous approaches, only 6 of the most basic features are employed. The resulting system is capable of detection (false positive) rates of 89% (4.6%), where this is at least as good as the alternative data-mining approaches that require all 41 features.
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
A Geometric Framework for Unsupervised Anomaly Detection: Detecting Intrusions in Unlabeled Data
Eskin, E., Arnold, A., Prerau, M., Portnoy, L., & Stolfo, S. (2002) · Advances in Information Security · doi:10.1007/978-1-4615-0953-0_4 · Cited by 683
Cited by
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
“[232] Unsupervised Hierarchical SOM (Offline) KDD Cup [257] 6 TCP features -494,021 training records -311,029 records in test set 1 -4,898,431 records in test set 2 -Platforms: SOM-Toolbox [12] & SOM PAK [250] -3-level SOM w/ # Epochs: 4000 DR Test-set 1: 89% FP Test-set 1: 4.”
MethodThe use of computational intelligence in intrusion detection systems: A review
Wu, S. X., & Banzhaf, W. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2009.06.019 · Cited by 696
Unsupervised Machine Learning for Networking: Techniques, Applications and Research Challenges
Usama, M., Qadir, J., Raza, A., Arif, H., Yau, K.-L. A., Elkhatib, Y., Hussain, A., & Al-Fuqaha, A. (2019) · IEEE Access · doi:10.1109/access.2019.2916648 · Cited by 575
AdaBoost-Based Algorithm for Network Intrusion Detection
Hu, W., Hu, W., & Maybank, S. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2007.914695 · Cited by 394
Machine Learning Techniques for Anomaly Detection: An Overview
Omar, S., Ngadi, A., & H. Jebur, H. (2013) · International Journal of Computer Applications · doi:10.5120/13715-1478 · Cited by 344
Online Adaboost-Based Parameterized Methods for Dynamic Distributed Network Intrusion Detection
Hu, W., Gao, J., Wang, Y., Wu, O., & Maybank, S. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2247592 · Cited by 164
“Table IX lists the detection results of the following algorithms: the clustering-based algorithm in [3], the k-NN-based algorithm in [20], the SVM-based approach in [20], the algorithm based on SOMs in [5], the genetic clustering-based algorithm in [17], the hierarchical SOMbased algorithm in [18], the bagged C5 algor…”
MethodAnomaly Detection for Insider Threats Using Unsupervised Ensembles
Le, D. C., & Zincir-Heywood, N. (2021) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2021.3071928 · Cited by 147
“1) Concatenation: Inspired by the use of shift register and taps for representing time in data for intrusion detection [37], we introduce data examples to anomaly detection algorithms as concatenation of γ consecutive data instances of the same”
MethodSelf-citationIntrusion detection using reduced-size RNN based on feature grouping
Sheikhan, M., Jadidi, Z., & Farrokhi, A. (2012) · Neural Computing and Applications · doi:10.1007/s00521-010-0487-0 · Cited by 140
Detecting unknown computer worm activity via support vector machines and active learning
Nissim, N., Moskovitch, R., Rokach, L., & Elovici, Y. (2012) · Pattern Analysis and Applications · doi:10.1007/s10044-012-0296-4 · Cited by 61
“Other soft computing algorithms proposed for detecting malicious code include: artificial neural networks (ANN) [15–18]; self-organizing maps (SOM) [19], and fuzzy logic [20–22].”
MethodApplication of Artificial Neural Networks Techniques to Computer Worm Detection
Stopel, D., Boger, Z., Moskovitch, R., Shahar, Y., & Elovici, Y. (2006) · The 2006 IEEE International Joint Conference on Neural Network Proceedings · doi:10.1109/ijcnn.2006.247059 · Cited by 35
Exploring Adversarial Properties of Insider Threat Detection
Le, D. C., & Zincir-Heywood, N. (2020) · 2020 IEEE Conference on Communications and Network Security (CNS) · doi:10.1109/cns48642.2020.9162254 · Cited by 17
“…recorded activities of user behaviour. a) Concatenation: Inspired by the use of shift register and taps for representing time in data for intrusion detection [30], we introduce data examples to anomaly detection algorithms as concatenation of c consecutive data instances of the same user.”
MethodSelf-citation
Metadata
- Authors
- Kayacik, H. G., Zincir-Heywood, A. N., & Heywood, M. I.
- Venue
- Proceedings of the International Joint Conference on Neural Networks, 2003.
- Publisher
- IEEE
- Published
- 2004-03-23
- Volume
- 3
- Pages
- 1808-1813
- OpenAlex
- W2139562214
- Cited by
- 148
- References
- 1
- FWCI
- 5.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.