Skip to content
naulon
Not checkedNot checked for notices yet.

Features selection and prediction for IoT attacks

Jingyi Su, Shan He, Yan Wu

High-Confidence Computing · 2022

doi:10.1016/j.hcc.2021.100047 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Cyber-attacks and anomaly detection are growing concerns in the Internet of Things (IoT). With fast-growing deployment and opportunities, an increasing number of attacks put IoT devices under the threat of continuous exploitation and danger. Malicious operation, denial of service, MITM, and scan are major types of attacks that can cause IoT devices to fail. We study how a variety of machine-learning algorithms, such as decision tree, random forest, and gradient-boosting machine (GBM) analyze and predict network attacks on IoT devices. By comparing performance indicators for various algorithms through different model evaluations, we conclude that a decision-tree algorithm is generally the most accurate compared with random forest and gradient-boosting machine, but the random forest algorithm has better AUC scores as it combines the results of multiple individual decision trees. Gradient-boosting machine performs well, but from an accuracy and time aspect, it may not be the best option.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.