arXiv:2507.20894cs.LGcs.AI2025-07中稿 · 28th European Conf…被引 4

动态划分标签空间,实时应对多标签流数据的漂移与稀疏性。

Online hierarchical partitioning of the output space in extreme multi-label data stream

  • 通过在线聚类将标签分组为相关簇,无需预设层次结构。
  • 在23个真实数据集上比主流方法平均提升23%~32%。
  • 适合处理标签依赖复杂、概念漂移频繁的在线多标签场景。

具有多标签输出的数据流挖掘面临分布演化、高维标签空间、标签稀疏及复杂标签依赖等挑战。概念漂移不仅影响输入分布,还改变标签相关性和不平衡比率,增加模型适应难度。本文提出iHOMER(增量式多标签分类器层级),一种在线多标签学习框架,可增量地将标签空间划分为互不重叠的关联簇,无需依赖预定义层次结构。iHOMER基于杰卡德相似度进行在线分裂-聚合聚类,并采用基于多变量伯努利过程的树形全局学习器引导实例划分。为应对非平稳性,其在全局与局部层面集成漂移检测机制,实现标签分区与子树的动态重构。在23个真实数据集上的实验表明,iHOMER优于5种先进全局基线(如MLHAT、MLHT of Pruned Sets和iSOUPT)23%,优于12种局部基线(如kNN的二元相关变换、EFDT、ARF及ADWIN袋装/提升集成)32%,验证了其在在线多标签分类中的鲁棒性。

原文摘要 · Abstract (English)

Mining data streams with multi-label outputs poses significant challenges due to evolving distributions, high-dimensional label spaces, sparse label occurrences, and complex label dependencies. Moreover, concept drift affects not only input distributions but also label correlations and imbalance ratios over time, complicating model adaptation. To address these challenges, structured learners are categorized into local and global methods. Local methods break down the task into simpler components, while global methods adapt the algorithm to the full output space, potentially yielding better predictions by exploiting label correlations. This work introduces iHOMER (Incremental Hierarchy Of Multi-label Classifiers), an online multi-label learning framework that incrementally partitions the label space into disjoint, correlated clusters without relying on predefined hierarchies. iHOMER leverages online divisive-agglomerative clustering based on \textit{Jaccard} similarity and a global tree-based learner driven by a multivariate \textit{Bernoulli} process to guide instance partitioning. To address non-stationarity, it integrates drift detection mechanisms at both global and local levels, enabling dynamic restructuring of label partitions and subtrees. Experiments across 23 real-world datasets show iHOMER outperforms 5 state-of-the-art global baselines, such as MLHAT, MLHT of Pruned Sets and iSOUPT, by 23\%, and 12 local baselines, such as binary relevance transformations of kNN, EFDT, ARF, and ADWIN bagging/boosting ensembles, by 32\%, establishing its robustness for online multi-label classification.

多标签学习数据流在线学习标签聚类

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。