CoChat

In-Depth Feature Selection for the Statistical Machine Learning-Based Botnet Detection in IoT Networks

Open access
Kalakoti, Rajesh, Nomm, Sven, Bahsi, Hayretdin · 2022 · IEEE Access
Cited by 75

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

Abstract

The attackers compromise insecure IoT devices to enlarge their botnets for the purpose of launching more influential attacks against their victims. In various studies, it is demonstrated that machine learning can be utilized for the detection of IoT botnet attacks. In this paper, we focus on the minimization of feature sets for machine learning tasks that are formulated as six different binary and multi-class classification problems based on the stages of the botnet life-cycle. More specifically, we apply filter and wrapper methods with some machine learning methods and derived the optimal feature sets for each classification problem. The experimental results show that it is possible to achieve very high detection rates with very limited number of features. Some wrapper methods guarantee an optimal feature set regardless of the problem formulation but filter methods do not achieve that in all cases. The feature selection methods more prefer channel-based features for the detection at post-attack and communication & control stages whereas host-based features are more influential for identifying the attacks originating from the bots.

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.1109/access.2022.3204001

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

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

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

Cited by

See all 75

Metadata

Authors
Kalakoti, R., Nomm, S., & Bahsi, H.
Venue
IEEE Access
Published
2022
Volume
10
Pages
94518-94535
ISSN
2169-3536 (ISSN-L)
OpenAlex
W4294691673
Cited by
75
References
5
FWCI
7.32
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

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.