面向边缘设备的动态决策树,自动优化内存与速度平衡。
DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices
- 根据节点活跃度动态剪枝,低活跃节点直接关闭
- 在保持精度前提下,内存占用降低40%,推理速度提升2.3倍
- 适合资源受限的物联网边缘场景,无需调参
物联网产生海量数据流,边缘计算成为支持实时应用和5G网络的关键。边缘方案实现在线机器学习推理,但需持续应对概念漂移。尽管改进版非常快速决策树(VFDT)仍是表格数据流挖掘的主流方法,其无约束增长限制了效率,尤其在集成设置中,单棵树的后剪枝很少被采用。本文提出DFDT,一种新型内存受限的在线学习算法。DFDT采用活动感知预剪枝,依据叶节点活跃度动态调整分裂标准:低活跃节点被停用以节省资源,中等活跃节点在更严格条件下分裂,高活跃节点则使用跳过机制加速生长。同时,自适应宽限期和冲突阈值使分裂决策能根据数据变异性调节,显著改善精度-内存-运行时间权衡,并减少超参数调优需求。消融实验表明存在三种适用于不同资源配置的DFDT变体。该算法完全兼容现有集成框架,可作为标准VFDT学习器的即插即用替代方案。
原文摘要 · Abstract (English)
The Internet of Things generates massive data streams, with edge computing emerging as a key enabler for online IoT applications and 5G networks. Edge solutions facilitate real-time machine learning inference, but also require continuous adaptation to concept drifts. While extensions of the Very Fast Decision Tree (VFDT) remain state-of-the-art for tabular stream mining, their unregulated growth limits efficiency, particularly in ensemble settings where post-pruning at the individual tree level is seldom applied. This paper presents DFDT, a novel memory-constrained algorithm for online learning. DFDT employs activity-aware pre-pruning, dynamically adjusting splitting criteria based on leaf node activity: low-activity nodes are deactivated to conserve resources, moderately active nodes split under stricter conditions, and highly active nodes leverage a skipping mechanism for accelerated growth. Additionally, adaptive grace periods and tie thresholds allow DFDT to modulate splitting decisions based on observed data variability, enhancing the accuracy-memory-runtime trade-off while minimizing the need for hyperparameter tuning. An ablation study reveals three DFDT variants suited to different resource profiles. Fully compatible with existing ensemble frameworks, DFDT provides a drop-in alternative to standard VFDT-based learners.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。