针对数据流概念漂移,提出高效动态集成方法,兼顾准确与速度。
IncA-DES: An incremental and adaptive dynamic ensemble selection approach using online K-d tree neighborhood search for data streams with concept drift
- 基于在线K-d树快速搜索邻居,减少计算开销。
- 融合概念漂移检测器,实现对新概念的自适应更新。
- 引入重叠分类过滤,避免冗余计算,提升响应速度。
数据流面临传统批处理机器学习中少见的挑战,尤其是概念漂移——数据分布随时间变化。尽管集成学习在该场景表现良好,但现有动态集成(DS)方法在持续数据到达时,邻域搜索成本过高。本文提出IncA-DES,通过增量训练生成局部专家,并利用在线K-d树快速更新邻域信息,有效缓解计算压力。同时,结合概念漂移检测机制,及时识别并适应新概念;引入基于重叠的分类过滤策略,在局部共识出现时跳过复杂决策,提升效率。实验表明,该框架在不同标签可用性条件下,平均准确率优于7个主流方法,且处理速度在同类高精度方法中领先。在线K-d树的引入使处理时间显著降低,精度损失可忽略。代码已开源。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。