Skip to content
Open access

Heterogeneous Conditional Counter-Inspection: Configurable Error Control and Weak-Filter Recovery for 5G Network Intrusion Detection

Jul 2026 · Future Internet · Vol 18, pp. 381 · 0 citations · 11 references

TL;DR

A lightweight conditional counter-inspection pipeline is constructed, in which a global classifier is selectively validated by curriculum-biased experts under a unanimous dissent rule, assigning decision trees, random forests, extremely randomized trees, and histogram-based gradient boosting independently to the global (G), malicious-biased (EM), and benign-biased (EB) roles.

Abstract

Intrusion detection systems for 5G networks are typically reported at a single operating point, obscuring the trade-off between missed attacks and false alarms that governs real deployments. Building on a lightweight conditional counter-inspection pipeline, in which a global classifier is selectively validated by curriculum-biased experts under a unanimous dissent rule, we remove the constraint that all components share one learning algorithm, assigning decision trees, random forests, extremely randomized trees, and histogram-based gradient boosting independently to the global (G), malicious-biased (EM), and benign-biased (EB) roles. Across two datasets of contrasting difficulty, 5G-NIDD and UNSW-NB15, all 14 evaluated tree-based configurations reduce missed attacks, by 36.5–79.6% on 5G-NIDD, confirming that the recovery effect is a property of the architecture rather than of decision trees. The expert assignment also selects which error the system controls: the same pipeline can be steered toward fewer false alarms, fewer missed attacks, or higher aggregate F1 without retraining the first stage. The mechanism also rescues a weak linear filter: on 5G-NIDD it cuts false positives and false negatives by 92.8% and 95.8%, and on UNSW-NB15 it raises F1 from 0.903 to 0.934 while reducing missed attacks by 35.5%. These results reframe the pipeline as a configurable validation layer matched to a deployment’s cost structure. We further show, through direct measurement on both datasets, that the conditional routing evaluates at most four of seven models per record, keeping classifier inference below 0.1 ms per record and leaving the detection stage a small contributor to overall processing cost.

Read PDF

Similar papers

Review Open access Sep 2026

Explainable and Analyst-Driven Random Forest for Intrusion Detection

Random Forest and other tree-ensemble classifiers achieve high accuracy in network intrusion detection; however, their aggregate decision logic prevents analysts from auditing or deploying individual predictions as operational rules. Post hoc explanation methods introduce latencies incompatible with security operation...

Saloua Bellouch, Mostapha Zbakh, S. Aouad et al. · 0 citations
Open access Aug 2026

Explainable Machine Learning for DDoS Attack Detection with Physical Network Validation

This study evaluates two explainable ML classifiers, XGBoost and Random Forest, for DDoS detection and examines whether their near-perfect offline accuracy translates into reliable physical-network operation, indicating that offline benchmarks alone are insufficient for validating IDS readiness.

Muhammad Azzam Anshori, R. Amri · 0 citations
Sep 2026

MaskAug: Architecture-agnostic corruption-aware training for robust network intrusion detection

Across multilayer perceptron (MLP), one-dimensional convolutional neural network, and Feature Tokenizer + Transformer, MaskAug improves corruption-averaged Macro-F1 and delivers architecture-agnostic, cross-dataset-consistent robustness at zero inference-time cost.

Qian-Li Di, Ke-Ju Du, Gang Chen et al. · 0 citations
#machine learning Preprint Sep 2026

Candidate Comparability Before Promotion: Conditional Validation in Adaptive Network Intrusion Detection

Challenger construction and evidence should be controlled, reported and interpreted explicitly when promotion is evaluated, and policy ordering changed with candidate comparability, no policy globally dominated, and earlier compatibility statements for a label-free estimator and a calibrated ensemble narrowed.

Roberto Fernández-Barrios, Iker Pastor-López, A. Pikatza-Huerga et al. · 1 citation
Open access Aug 2026

Performance and Structural Symmetry Evaluation of Machine Learning-Driven Intrusion Detection Systems in Software-Defined Networks

This paper evaluates an ultra-compact five-feature polling scheme (F1–F5) designed to preserve statistical symmetry between control-plane monitoring and telemetry overhead within a dynamic Mininet–Ryu testbed and reveals that tree-based ensembles consistently outperform deep learning approaches.

Rohan Giri, Abdussalam Salama, Reza Saatchi et al. · 0 citations
Open access Aug 2026

Application of C4.5 Decision Tree Algorithm for Detecting Cyber Attacks Using IDS

This work constructs a web-based Intrusion Detection System prototype by training an entropy-based Decision Tree classifier, conceptually grounded in the C4.5 framework, on the NSL-KDD benchmark.

Daniel Erick Witopo, Hartana Wijaya · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.