The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A hybrid network intrusion detection framework based on random forests and weighted k-means
Open accessAbstract
Many current NIDSs are rule-based systems, which are very difficult in encoding rules, and cannot detect novel intrusions. Therefore, a hybrid detection framework that depends on data mining classification and clustering techniques is proposed. In misuse detection, random forests classification algorithm is used to build intrusion patterns automatically from a training dataset, and then matches network connections to these intrusion patterns to detect network intrusions. In anomaly detection, the k-means clustering algorithm is used to detect novel intrusions by clustering the network connections’ data to collect the most of intrusions together in one or more clusters. In the proposed hybrid framework, the anomaly part is improved by replacing the k-means algorithm with another one called weighted k-means algorithm, moreover, it uses a proposed method in choosing the anomalous clusters by injecting known attacks into uncertain connections data. Our approaches are evaluated over the Knowledge Discovery and Data Mining (KDD’99) datasets.
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
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
Cited by
Ahmad, I., Basheri, M., Iqbal, M. J., & Rahim, A. (2018) · IEEE Access · doi:10.1109/access.2018.2841987 · Cited by 693
A Systematic Review on Imbalanced Data Challenges in Machine Learning: Applications and Solutions
Kaur, H., Pannu, H. S., & Malhi, A. K. (2020) · ACM Computing Surveys · doi:10.1145/3343440 · Cited by 488
A Novel Hierarchical Intrusion Detection System Based on Decision Tree and Rules-Based Models
Ahmim, A., Maglaras, L., Ferrag, M. A., Derdour, M., & Janicke, H. (2019) · 2019 15th International Conference on Distributed Computing in Sensor Systems (DCOSS) · doi:10.1109/dcoss.2019.00059 · Cited by 266
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
Metadata
- Authors
- Elbasiony, R. M., Sallam, E. A., Eltobely, T. E., & Fahmy, M. M.
- Venue
- Ain Shams Engineering Journal
- Publisher
- Elsevier BV
- Published
- 2013-12
- Volume
- 4
- Issue
- 4
- Pages
- 753-762
- ISSN
- 2090-4479 (ISSN-L)
- OpenAlex
- W1993913559
- Cited by
- 176
- References
- 1
- FWCI
- 16.74
- Type
- journal article
- Language
- en
- Open access
- gold
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 hybrid network intrusion detection framework based on random forests and weighted k-means. https://app.cochat.ai/papers/10.1016/j.asej.2013.01.003
- The paper
- Elbasiony, R. M., Sallam, E. A., Eltobely, T. E., & Fahmy, M. M. (2013). A hybrid network intrusion detection framework based on random forests and weighted k-means. Ain Shams Engineering Journal. https://doi.org/10.1016/j.asej.2013.01.003
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.