MétaCan
Menu
Back to cohort

Zero-Day Device Identification for IoT Security through Optimized Incremental Learning and Drift Adaptation

2025· article· W7128055605 on OpenAlexaff
Ogobuchi Daniel Okey, Sajjad Dadkhah, Demóstenes Zegarra Rodríguez, João Henrique Kleinschmidt

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicInternet Traffic Analysis and Secure E-voting
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsExploitIncremental learningIdentification (biology)HyperparameterAdaptation (eye)Concept driftForgettingAdaptive learning

Abstract

fetched live from OpenAlex

Zero-day attacks exploit IoT devices’ vulnerabilities using unknown compromised devices as main attack vectors. Therefore, immediate identification of new devices that join networks is critical. This paper introduces an optimized incremental learning framework that combines XGBoost and sliding-window drift detection for zero-day device identification, optimized with bacterial foraging optimization (BFOA) to select the best window size and hyperparameter to achieve reduced time. This method addresses catastrophic forgetting in streaming IoT environments while preserving detection accuracy for unseen devices. The system utilizes sliding-window-based concept drift detection and adaptive model updates to enable continuous learning without performance degradation. Extensive evaluation on four realworld IoT traffic datasets demonstrates superior performance, achieving 99. 11% precision in device detection with computational efficiency suitable for real-time deployment. The adaptive framework ensures model adjustment to varying patterns in the network of IoT devices, optimizing both cost and efficiency while detecting previously unseen device type with up to 99% precision.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.020
GPT teacher head0.287
Teacher spread0.267 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicInternet Traffic Analysis and Secure E-votingFrench-language works237,207