CoChat

IntruDTree: A Machine Learning Based Cyber Security Intrusion Detection Model

Open access

Published version of a preprint

The DOI matches its Crossref record; 52 of the 55 references it cites were found in a registry or an index.

Abstract

Cyber security has recently received enormous attention in today’s security concerns, due to the popularity of the Internet-of-Things (IoT), the tremendous growth of computer networks, and the huge number of relevant applications. Thus, detecting various cyber-attacks or anomalies in a network and building an effective intrusion detection system that performs an essential role in today’s security is becoming more important. Artificial intelligence, particularly machine learning techniques, can be used for building such a data-driven intelligent intrusion detection system. In order to achieve this goal, in this paper, we present an Intrusion Detection Tree (“IntruDTree”) machine-learning-based security model that first takes into account the ranking of security features according to their importance and then build a tree-based generalized intrusion detection model based on the selected important features. This model is not only effective in terms of prediction accuracy for unseen test cases but also minimizes the computational complexity of the model by reducing the feature dimensions. Finally, the effectiveness of our IntruDTree model was examined by conducting experiments on cybersecurity datasets and computing the precision, recall, fscore, accuracy, and ROC values to evaluate. We also compare the outcome results of IntruDTree model with several traditional popular machine learning methods such as the naive Bayes classifier, logistic regression, support vector machines, and k-nearest neighbor, to analyze the effectiveness of the resulting security model.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/sym12050754

Cites

52 of 52 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Data distribution of the secuity feature ' duration ′ .
Figure 1 Data distribution of the secuity feature ' duration ′ .CC-BY · From the PDF
Figure 2 Data distribution of the secuity feature ' dst _ bytes '.
Figure 2 Data distribution of the secuity feature ' dst _ bytes '.CC-BY · From the PDF
Figure 3 An example of an IntruDTree considering several features.
Figure 3 An example of an IntruDTree considering several features.CC-BY · From the PDF
Figure 4 The importance of the features in terms of score values.
Figure 4 The importance of the features in terms of score values.CC-BY · From the PDF
Figure 5 The ROC curve representing TPR (true positive rate) against FPR (false positive rate) of our IntruDTree model.
Figure 5 The ROC curve representing TPR (true positive rate) against FPR (false positive rate) of our IntruDTree model.CC-BY · From the PDF
Figure 6 Effectiveness comparison in terms of precision, recall, fscore, and accuracy of different machine learning based security models.
Figure 6 Effectiveness comparison in terms of precision, recall, fscore, and accuracy of different machine learning based security models.CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Research works printed but not linked: 3

  1. Sharifi, 2015, Intrusion detection based on joint of K-means and KNN, J. Converg. Inf. Technol., 10, 42
  2. Quinlan, J.R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers, Inc.
  3. Rai, 2016, Decision tree based algorithm for intrusion detection, Int. J. Adv. Netw. Appl., 7, 2828

Cited by

See all 449

Metadata

Authors
Sarker, I. H., Abushark, Y. B., Alsolami, F., & Khan, A. I.
Affiliations
  • Chittagong University of Engineering & Technology (BD)
  • King Abdulaziz University (SA)
Corresponding author
Sarker, Iqbal H.
Venue
Symmetry
Publisher
MDPI AG
Published
2020-05-06
Volume
12
Issue
5
Pages
754
ISSN
2073-8994 (ISSN-L)
OpenAlex
W3017881119
Cited by
356
References
55
Citations by year
2026: 26 · 2025: 54 · 2024: 81 · 2023: 69 · 2022: 61 · 2021: 54 · 2020: 11
FWCI
22.91
Type
journal article
Language
en
Open access
Locations
  • Symmetry (publishedVersion, cc-by)
  • Preprints.org (acceptedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Swinburne figshare (Swinburne University of Technology) (submittedVersion)
Funders
King Abdulaziz University
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Immune Systems Applications
  • Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
Keywords
intrusion detection, decision tree, feature selection, feature ranking, dimensionality reduction, network security, cyberattack detection, Internet of Things security, computational complexity reduction

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.