Metraipolis › archive › dc_283e4e9fc34d

Beyond Detection Accuracy: Measuring Explanation Cost, Stability, and Utility for Resource-Aware IoT Intrusion Detection — arXiv:2608.10349

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10349
License (as archived)
CC0-1.0
Archived
2026-10-19T06:18:30.985Z
SHA-256 of the archived text
0eaca0885c005719f37a6d36971fe5c0504b9ad26ee5ca53f21fab47106dfc3b
Stable URL of this page
https://metraipolis.com/documento/dc_283e4e9fc34d

How to cite

Beyond Detection Accuracy: Measuring Explanation Cost, Stability, and Utility for Resource-Aware IoT Intrusion Detection — arXiv:2608.10349 — arXiv (en), https://arxiv.org/abs/2608.10349 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_283e4e9fc34d (Metraipolis archive dc_283e4e9fc34d, sha256 0eaca0885c005719f37a6d36971fe5c0504b9ad26ee5ca53f21fab47106dfc3b)
BibTeX
@misc{dc283e4e9fc34d,
  title = {Beyond Detection Accuracy: Measuring Explanation Cost, Stability, and Utility for Resource-Aware IoT Intrusion Detection — arXiv:2608.10349},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10349},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_283e4e9fc34d; sha256 0eaca0885c005719f37a6d36971fe5c0504b9ad26ee5ca53f21fab47106dfc3b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10349. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Machine-learning intrusion-detection studies commonly emphasize predictive accuracy while treating explanation generation as a computationally free post-processing step. This study jointly evaluates predictive effectiveness, explanation cost, local explanation stability, and selective explanation for binary Internet of Things (IoT) intrusion detection. A leakage-safe CICIoT2023 corpus was constructed using exact 39-feature hashes, non-finite-value handling, exact-feature deduplication, conservative label-collision removal, and deterministic hash-level partitioning. Logistic Regression, Decision Tree, Random Forest, and XGBoost were evaluated on natural and balanced test distributions. TreeSHAP cost was measured, stability was assessed under prediction-preserving perturbations, and validation-calibrated policies were used to allocate explanation workload. XGBoost provided the strongest overall predictive profile, while Random Forest produced the lowest false-positive rate. At 5,000 samples, TreeSHAP required 700.759 s for Random Forest and 1.471 s for XGBoost. Random Forest showed the strongest overall base-level explanation stability; XGBoost retained high rank and directional consistency but showed greater top-feature turnover and attribution-magnitude drift. On the balanced test, about 90% false-negative explanation coverage permitted 28-32% compute savings, while about 95% coverage permitted 15-23% savings. Savings were much smaller under the attack-heavy natural prevalence. These results show that operationally useful explainable IoT intrusion detection depends on predictive quality, explanation cost, local stability, workload prevalence, and selective invocation rather than detection accuracy alone.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-12 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR) ; Machine Learning (cs.LG); Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2608.10349 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T06:11:08.390Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).