mlsanityData to 7 Oct 2026

Stream Assembly Is an Uncontrolled Treatment in Streaming Intrusion-Detection Benchmarks

arXiv 2605.24696 ↗First posted 23 May 2026cs.CR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Streaming intrusion-detection studies assemble evaluation streams from network captures by interleaving capture days, pooling captures, or replaying records round robin. We show on two benchmarks that this assembly is an uncontrolled experimental treatment changing what the evaluation measures. On CICIDS2017, reordering an identical record multiset under a fixed positional 70/15/15 split yields held-out samples sharing only 32.5% of their records, at prevalences of 68.235% and 25.2396% (42.9954 points apart), and reverses the measured ordering of the two deterministic scorers. Restricting both arms to the 78000 records both held out removes the reversal, so it is attributable to which records the assembly hands to the test set, not to the order in which the detector saw its history. That attribution assumes that history contributes no more on the records the arms do not share than on those they do. On LITNET-2020, pooling three temporally disjoint captures reports one 6.4982% operating point, the equal-weight mean of per-capture held-out prevalences from 0.176% to 15.7747%, an identity presented as an audit check. The evaluated detector's reset posterior P(r_t=0) equals the hazard rate exactly below the run-length cap, though evaluations spend nearly all their length at or beyond it, and its evaluated score is a function of P(r<=5), not of P(r=0). Its deployed max composition ranks worse than its tail term alone (0.103477 AP, 0.302658 AUC-ROC) because the auxiliary branch is inverted (AUC-ROC 0.281890) and the maximum lets it set the score wherever the tail is small. With evaluated records and fitted model fixed, changing only the accompanying batch moves the ECOD reference implementation's AUC-PR by 0.003063, so published ECOD numbers are not comparable across studies scoring different batches. Every measured value traces to an archived, hash-verified run manifest.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 50 references that are in the map. First posted on arXiv 23 May 2026.

Builds on

16 of 50 references.

References · 16

  1. 2022Conformal prediction beyond exchangeabilitycited by 348
  2. 2022ADBench: Anomaly Detection Benchmarkcited by 230
  3. 2022ECOD: Unsupervised Outlier Detection Using Empirical Cumulative Distribution Functionscited by 153
  4. 2020COPOD: Copula-Based Outlier Detectioncited by 143
  5. 2018Kitsune: An Ensemble of Autoencoders for Online Network Intrusion Detectioncited by 121
  6. 2020Dos and Don'ts of Machine Learning in Computer Securitycited by 98
  7. 2018Precision and Recall for Time Seriescited by 67
  8. 2020An Evaluation of Change Point Detection Algorithmscited by 62
  9. 2024A Closer Look at AUROC and AUPRC under Class Imbalancecited by 56
  10. 2019A Survey of Network-based Intrusion Detection Data Setscited by 46
  11. 2018Spatio-temporal Bayesian On-line Changepoint Detection with Model Selectioncited by 13
  12. 2023SoK: Pragmatic Assessment of Machine Learning for Network Intrusion Detectioncited by 13
4 more
  1. 2022The Cross-evaluation of Machine Learning-based Network Intrusion Detection Systemscited by 8
  2. 2025Average Precision at Cutoff k under Random Rankings: Expectation and Variancecited by 1
  3. 2026Predicting Tail-Risk Escalation in IDS Alert Time Seriescited by 1
  4. 2026FIRCE: A Framework for Intrusion Response and Conformal Evaluationcited by 1

Built on by

Not cited yet.