The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Anomaly detection using random forest: A performance revisited
Abstract
Intruders have become more and more sophisticated thus a deterrence mechanism such as an intrusion detection systems (IDS) is pivotal in information security management. An IDS aims at capturing and repealing any malignant activities in the network before they can cause harmful destruction. An IDS relies on a well-trained classification model so the model is able to identify the presence of attacks effectively. This paper compares the performance of IDS by exerting random forest classifier with respect to two performance measures, i.e. accuracy and false alarm rate. Three public intrusion data sets, i.e NSL-KDD, UNSW-NB15, and GPRS are employed in the experiment. Furthermore, different tree-size ensembles are considered whilst other best learning parameters are obtained using a grid search. Our experimental results prove the superiority of random forest model for IDS as it significantly outperforms the similar ensemble, i.e. ensemble of random tree + naive bayes tree and other single classifier, i.e. naive bayes and neural network in terms of k-cross validation method.
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
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785 · cited 1×
“• Friedman test [23].”
Cited by
Himeur, Y., Ghanem, K., Alsalemi, A., Bensaali, F., & Amira, A. (2021) · Applied Energy · doi:10.1016/j.apenergy.2021.116601 · Cited by 660
Machine Learning Based Intrusion Detection Systems for IoT Applications
Verma, A., & Ranga, V. (2020) · Wireless Personal Communications · doi:10.1007/s11277-019-06986-8 · Cited by 418
Sarker, I. H., Khan, A. I., Abushark, Y. B., & Alsolami, F. (2023) · Mobile Networks and Applications · doi:10.1007/s11036-022-01937-3 · Cited by 398
TSE-IDS: A Two-Stage Classifier Ensemble for Intelligent Anomaly-Based Intrusion Detection System
Tama, B. A., Comuzzi, M., & Rhee, K.-H. (2019) · IEEE Access · doi:10.1109/access.2019.2928048 · Cited by 386
Self-citationArtificial Intelligence Techniques in Smart Grid: A Survey
Omitaomu, O. A., & Niu, H. (2021) · Smart Cities · doi:10.3390/smartcities4020029 · Cited by 371
Metadata
- Authors
- Primartha, R., & Tama, B. A.
- Venue
- 2017 International Conference on Data and Software Engineering (ICoDSE)
- Publisher
- IEEE
- Published
- 2017-11
- Pages
- 1-6
- OpenAlex
- W2786743105
- Cited by
- 171
- References
- 2
- FWCI
- 4.60
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Anomaly detection using random forest: A performance revisited. https://app.cochat.ai/papers/10.1109/icodse.2017.8285847
- The paper
- Primartha, R., & Tama, B. A. (2017). Anomaly detection using random forest: A performance revisited. 2017 International Conference on Data and Software Engineering (ICoDSE). https://doi.org/10.1109/icodse.2017.8285847
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.