IncA-DES: An incremental and adaptive dynamic ensemble selection approach using online K-d tree neighborhood search for data streams with concept drift
Not on the map. Why?
Abstract (arXiv)
Data streams pose challenges not usually encountered in batch-based ML. One of them is concept drift, which is characterized by the change in data distribution over time. Among many approaches explored in literature, the fusion of classifiers has been showing good results and is getting growing attention. DS methods, due to the ensemble being instance-based, seem to be an efficient choice under drifting scenarios. However, some attention must be paid to adapting such methods for concept drift. The training must be done in order to create local experts, and the commonly used neighborhood-search DS may become prohibitive with the continuous arrival of data. In this work, we propose IncA-DES, which employs a training strategy that promotes the generation of local experts with the assumption that different regions of the feature space become available with time. Additionally, the fusion of a concept drift detector supports the maintenance of information and adaptation to a new concept. An overlap-based classification filter is also employed in order to avoid using the DS method when there is a consensus in the neighborhood, a strategy that we argue every DS method should employ, as it was shown to make them more applicable and quicker. Moreover, aiming to reduce the processing time of the kNN, we propose an Online K-d tree algorithm, which can quickly remove instances without becoming inconsistent and deals with unbalancing concerns that may occur in data streams. Experimental results showed that the proposed framework got the best average accuracy compared to seven state-of-the-art methods considering different levels of label availability and presented the smaller processing time between the most accurate methods. Additionally, the fusion with the Online K-d tree has improved processing time with a negligible loss in accuracy. We have made our framework available in an online repository.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 10 of its 80 references that are in the map. First posted on arXiv 16 Jul 2025.
Builds on
10 of 80 references.
References · 10
- 2020Learning under Concept Drift: A Reviewcited by 477
- 2022From Concept Drift to Model Degradation: An Overview on Performance-Aware Drift Detectorscited by 83
- 2018Scikit-Multiflow: A Multi-output Streaming Frameworkcited by 70
- 2020Challenges in Benchmarking Stream Learning Algorithms with Real-world Datacited by 59
- 2021STUDD: A Student-Teacher Method for Unsupervised Concept Drift Detectioncited by 19
- 2017Reservoir of Diverse Adaptive Learners and Stacking Fast Hoeffding Drift Detection Methods for Evolving Data Streamscited by 10
- 2020Machine Learning (In) Security: A Stream of Problemscited by 8
- 2018Dynamic Ensemble Selection VS K-NN: why and when Dynamic Selection obtains higher classification performance?cited by 4
- 2018META-DES.Oracle: Meta-learning and feature selection for ensemble selectioncited by 3
- 2023DynED: Dynamic Ensemble Diversification in Data Stream Classificationcited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026TREK: Distill to Explore, Reinforce to Refinecited by 2
- 2026CaDrift: A Time-dependent Causal Generator of Drifting Data Streamscited by 0
- 2026Concept Drift from a Causal Perspectivecited by 0
- 2026Concept Drift from a Causal Perspective21 Sep 2026
- 2026TREK: Distill to Explore, Reinforce to Refine6 Jul 2026
- 2026CaDrift: A Time-dependent Causal Generator of Drifting Data Streams23 Feb 2026