An Improved Deep Belief Network IDS on IoT-Based Network for Traffic Systems
Post-publication record
Source: Retraction Watch, joined by DOI. OpenAlex records retraction as is_retracted, a boolean over a state space with at least four values, so it cannot express an expression of concern, a correction or a reinstatement; it reports them as false, which reads as “fine”.
Bibliographic record
Abstract
Internet of things (IoT) services are turning out to be more domineering with the rising security considerations fading with time. All this owes to the propagating heterogeneity and budding technologies teamed up with resource-constrained IoT systems, sculpting smart systems to be more susceptible to cyber-attacks. The security challenges such as privacy, scalability, authenticity, trust, and centralization thwart the quick adaptation of the smart services; hence, effective solutions are needed to be in place. Traditional approaches of intrusion detection mechanisms have become irrelevant now, as the bad actors often use obfuscation techniques to evade detections. Moreover, these techniques collapse, while detecting zero-day attacks. Hence, there is a need to use an intelligent mechanism based on machine learning (ML) and deep learning (DL), to detect attacks. In this study, the authors have proposed an intrusion detection engine with a deep belief network (DBN) being the core. The implementation of DBN_Classifier is performed using TensorFlow 2.0 and evaluated using a sample of the TON_IOT_Weather dataset. The findings indicate that the proposed engine outperforms the other state-of-the-art techniques with an average accuracy of 86.3%.
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.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
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".