DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Lourenço, Afonso, Rodrigo, João, Gama, João, Marreiros, Goreti
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917129734848512
author Lourenço, Afonso
Rodrigo, João
Gama, João
Marreiros, Goreti
author_facet Lourenço, Afonso
Rodrigo, João
Gama, João
Marreiros, Goreti
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2502_14011
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices
Lourenço, Afonso
Rodrigo, João
Gama, João
Marreiros, Goreti
Machine Learning
Artificial Intelligence
Networking and Internet Architecture
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.
title DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices
topic Machine Learning
Artificial Intelligence
Networking and Internet Architecture
url https://arxiv.org/abs/2502.14011