arXiv Machine Learning By Abu Fuad Ahmad, Istiaque Ahmed

BARS: Benign-Anchored Ranking and Selection for False Alarm Reduction in Network Intrusion Detection

Read the original on arXiv Machine Learning →

arXiv:2607. 13203v1 Announce Type: cross Abstract: False alarms remain a major barrier to deploying network intrusion detection systems (NIDS).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 7

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

The paper investigates how to properly validate candidate models before promoting them to replace incumbent classifiers in adaptive network intrusion detection systems. It demonstrates that promotion decisions can be biased by how challengers are constructed and the amount of evidence they receive, and that using self‑contained challenger pipelines and sufficient candidate evidence reduces apparent promotion harm. The study also shows that policy rankings shift with candidate comparability and that no single update policy dominates across benchmarks.

By Roberto Fern\'andez-Barrios, Iker Pastor-L\'opez, Amaia Pikatza-Huerga, Pablo Garc\'ia Bringas
arXiv AI
Jun 30

Multi-Level Distributional Entropy for Explainable Network Intrusion Detection

arXiv:2606. 29797v1 Announce Type: cross Abstract: Machine learning network intrusion detection systems (IDS) rely on aggregate flow statistics that discard distributional structure, while established entropy measures require raw packet sequences unavailable in pre-aggregated flow datasets.

By Mohamed Aly Bouke, Md Shohel Sayeed, Swee-Huay Heng, Azizol Abdullah, Mohamed Othman
arXiv AI
2d ago

Jev-IDS: System One Models for Network Intrusion Detection

JEV-IDS is an open experimental general network intrusion detection system that uses the Jev System One Model to detect zero‑day intrusions even when labeled data are scarce. The system processes one flow per request and asks the model two questions: a binary attack probability and a finite‑choice traffic category. In tests on a 300‑flow NSL‑KDD pilot split, JEV-IDS achieved an F1‑score of 0.859, precision of 0.941, recall of 0.790, and a novel‑attack recall of 0.838, while being 4.8 times faster and 3.8 times cheaper than GPT‑5.6 Luna and producing 15 times fewer false alarms than a low‑data Random Forest.

By Paulo Severo, Silvio E. Quincozes, Amanda Dias
arXiv AI
Sep 4

Privacy, Robustness, and Fairness Trade-offs in Federated Intrusion Detection: Geometric Indistinguishability at the Aggregation Interface

The paper investigates how privacy guarantees, robustness to Byzantine attacks, and detection coverage for rare intrusion types interact in federated network intrusion detection systems. It introduces geometric indistinguishability to explain how privacy noise can obscure minority-class signals, and demonstrates through experiments on UNSW‑NB15 that combining differential privacy with robust aggregation can disproportionately harm detection of rare attacks. The study highlights that these properties cannot be treated as independently composable and calls for aggregation‑aware modeling and sample‑aware evaluation to build trustworthy federated NIDS.

By Adrita Rahman Tory, ABM Shawkat Ali, Md Abu Layek, Khondokar Fida Hasan