ML-Based IDPS Enhancement With Complementary Features for Home IoT Networks
Bibliographic record
Abstract
The Internet of Things (IoT) networks are obstructed by security vulnerabilities that hackers can leverage to operate intrusions in many environments, such as smart homes, smart factories, and smart healthcare systems. To overcome this obstruction, researchers have come up with different intrusion detection and prevention systems (IDPSs). Out of all the implemented technologies, Machine Learning (ML) has emerged as the most promising approach. Therefore, to improve the detection accuracy, most ML-based intrusion detection solutions focus only on investigating appropriate ML algorithms. Yet, the limitations in terms of detection accuracy in various attacks are often caused by lack of appropriate detection features. Moreover, the majority of the previous works lack intrusion prevention mechanisms and deployment architectures. Thus, in this research, we study the properties of different smart home security attacks and the quality of the features that can be brought out and employed in ML algorithms to detect each of these attacks efficiently. Furthermore, this research proposes effective intrusion prevention mechanisms and a Software-Defined Networking (SDN) based deployment architecture of the IDPSs within home networks. Experimental evaluations of the proposed solution are provided using different feature sets and various ML models. The contributions and advancements discussed in this paper will upgrade future research and engineering works on IDPSs for IoT.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".