对比批量与流式学习在物联网异常检测中的表现,发现流式模型更抗概念漂移。
Binary Anomaly Detection in Streaming IoT Traffic under Concept Drift
- 采用流式学习实时更新模型,适应网络异常的动态变化。
- 自适应随机森林在1/3计算成本下达到0.990的F1分数。
- 适合资源受限的实时物联网安全监测场景。
随着物联网网络流量持续增长,基于机器学习的异常检测愈发重要。传统批量学习模型存在维护成本高、难以应对快速变化的异常(即概念漂移)的问题。相比之下,流式学习融合在线与增量学习,支持无缝更新并检测概念漂移,提升鲁棒性。本研究将物联网流式流量异常检测建模为二分类任务,对比批量与流式学习方法,并评估现有物联网流量数据集的局限性。通过精心混合已有数据集并逐样本流式输入,模拟异构网络数据流。结果表明,批量模型无法应对概念漂移,但现有数据集因流量同质性低,仍难充分暴露模型缺陷。我们还考察了树基算法在流式环境下的竞争力,发现其优于非树基方法。自适应随机森林实现F1分数0.990±0.006,计算成本仅为批量模型的1/3;霍夫丁自适应树达F1分数0.910±0.007,计算成本降低4倍,虽稳定性略降,仍适合在线应用。
原文摘要 · Abstract (English)
With the growing volume of Internet of Things (IoT) network traffic, machine learning (ML)-based anomaly detection is more relevant than ever. Traditional batch learning models face challenges such as high maintenance and poor adaptability to rapid anomaly changes, known as concept drift. In contrast, streaming learning integrates online and incremental learning, enabling seamless updates and concept drift detection to improve robustness. This study investigates anomaly detection in streaming IoT traffic as binary classification, comparing batch and streaming learning approaches while assessing the limitations of current IoT traffic datasets. We simulated heterogeneous network data streams by carefully mixing existing datasets and streaming the samples one by one. Our results highlight the failure of batch models to handle concept drift, but also reveal persisting limitations of current datasets to expose model limitations due to low traffic heterogeneity. We also investigated the competitiveness of tree-based ML algorithms, well-known in batch anomaly detection, and compared it to non-tree-based ones, confirming the advantages of the former. Adaptive Random Forest achieved F1-score of 0.990 $\pm$ 0.006 at one-third the computational cost of its batch counterpart. Hoeffding Adaptive Tree reached F1-score of 0.910 $\pm$ 0.007, reducing computational cost by four times, making it a viable choice for online applications despite a slight trade-off in stability.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。