





















Abstract:Machine learning-based intrusion detection requires complex models to capture patterns in high-dimensional, noisy, and class-imbalanced raw network traffic, yet deploying such models remains impractical on resource-constrained devices with limited processing power and memory. In this paper, we present a correlation-aware divide-and-conquer learning technique that decomposes a complex learning problem into smaller, more manageable subproblems. This enables lightweight models as simple as decision trees to be trained on focused subtasks, yielding up to 43.3% higher local accuracy and up to 257 times reduction in model size on real-world network intrusion detection datasets, while also improving adversarial robustness and explainability.
| Comments: | 6 pages, 4 figures |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.02015 [cs.LG] |
| (or arXiv:2605.02015v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.02015 arXiv-issued DOI via DataCite (pending registration) |
From: Yan Zhou [view email]
[v1]
Sun, 3 May 2026 18:42:02 UTC (937 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。