MétaCan
Menu
Back to cohort
Record W7128800414 · doi:10.1093/jigpal/jzaf017

Comparing deep neural networks to tree-based machine learning methods for anomaly detection in IIoT

2025· article· en· W7128800414 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueLogic Journal of IGPL · 2025
Typearticle
Languageen
FieldEngineering
TopicSmart Grid Security and Resilience
Canadian institutionsAthabasca University
Fundersnot available
KeywordsAnomaly detectionArtificial neural networkDecision treeSupport vector machineDeep learningRandom forestMultilayer perceptron

Abstract

fetched live from OpenAlex

Abstract This paper investigates the application of machine learning methods for anomaly detection of both physical and cyber threats in Industrial Internet of Things (IIoT) environments, with a novel method of separating different threat classes, performing delegation of computationally inexpensive threshold-based metrics to a simple rules-based alerting system, while performing anomaly detection of the more complex behavioural-based metrics in a machine learning model. This hybrid approach of separating threshold-based and behaviour-based detection methods is validated on the Edge-IIoTset2023 and CICIoT2023 public research datasets. As a new contribution, this hybrid methodology is validated against both tree-based classifiers and artificial neural network (ANN) classifiers. Experimental results indicate that while ANNs can be very effective, marginally higher accuracy (~3%) and significantly faster predictions can be achieved with less computationally expensive tree-based algorithms such as Decision Trees and Random Forests, thereby optimizing the price-performance trade-off for the operators of IIoT environments.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.854
Threshold uncertainty score0.353

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.018
GPT teacher head0.292
Teacher spread0.274 · 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