VLDB 2026 Research / reviewers in the wild / expert
João Rodrigo
dblp:400/4907
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 67% Data stream processing · 33% | |
| Computer networks
1 paper |
Edge and fog computing · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data stream processing › evolving data
concept drift |
1.0 | 1 | 2026 | DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices · AAAI 2026 |
Data mining
data stream mining |
1.0 | 1 | 2026 | DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices · AAAI 2026 |
Data mining › predictive modeling › classification
decision tree learning |
1.0 | 1 | 2026 | DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices · AAAI 2026 |
Edge and fog computing
edge intelligence |
0.3 | 1 | 2026 | DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
pre-pruning · 2.0ensemble learning · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge DevicesabstractThe 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 limit 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. Afonso Lourenço, João Rodrigo, João Gama 0001, Goreti Marreiros |
AAAI | 2 |