A comparative analysis of a machine learning pipeline for network intrusion detection
Bibliographic record
Abstract
The exponential growth of Internet of Things (IoT) devices integrated with fifth-generation (5G) wireless networks has created unprecedented opportunities for ultra-low-latency applications while introducing complex security vulnerabilities and computational challenges. This paper presents a comprehensive framework for deploying adaptive lightweight Convolutional Neural Networks (CNNs) in 5G-enabled IoT environments to address intrusion detection, intelligent traffic classification, and dynamic resource optimization. We propose a novel multi-objective optimization approach that integrates Adaptive Depthwise Separable Convolutions (ADSC), Dynamic Quantization-Aware Training (DQAT), and Real time Pruning Strategy (RPS) specifically designed for 5G network slicing architectures. Our methodology incorporates federated learning principles, edge-cloud collaboration, and context-aware adaptation mechanisms. Comprehensive evaluation on multiple datasets, including NF-ToN-IoT-v2, NSL-KDD, and CICIDS-2017, demonstrates superior performance with 97.8% accuracy in multi-class attack detection, 76% reduction in computational overhead, 71% decrease in energy consumption, and 42% improvement in network throughput. The framework achieves inference times under 8.5ms on edge devices while maintaining robust security postures across heterogeneous IoT deployments. Statistical significance testing and large-scale ablation studies verify the effectiveness of each of the suggested elements.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".