PHIDA:基于持续性的节点到聚类映射用于在线聚类
PHIDA: Persistence-Guided Node-to-Cluster Mapping for Online Clustering
AI总结:
PHIDA通过结合逆距离ART和持续同调,改进了在线聚类中节点到聚类的映射,实验显示其在静态和非静态设置中表现优异。
摘要:
在线聚类方法在数据到来时自适应创建和更新节点,通常将节点学习显式化,而节点状态到输出聚类的映射往往隐式或简化。隐式映射使输出聚类对弱图桥或基于距离的局部关系敏感,缺乏对映射过程中保持完整节点组的显式约束。本文通过提出PHIDA,一种基于持续性的节点到聚类映射方法,解决了这一问题。PHIDA在基于自适应共振理论(ART)的在线聚类中实现此映射,结合逆距离ART(IDA)节点学习与受持续同调(PH)约束的节点到聚类映射。实验表明,PHIDA在24个基准数据集的静态比较中取得最佳平均排名,同时在非静态设置中优于评估的在线方法。消融分析和与传统节点到聚类映射的比较表明,观察到的收益与受持续同调约束的映射以及节点学习过程中使用持续同调组件有关。源代码可在https://github.com/Masuyama-lab/PHIDA获取。
英文摘要:
Online clustering methods that adaptively create and update nodes as data arrive often make node learning explicit, whereas the mapping from the learned node state to output clusters often remains implicit or simplified. Implicit mappings make output clusters sensitive to weak graph bridges or local relations based on distance in the graph over learned nodes, leaving no explicit constraint on which node groups remain intact during mapping. This paper addresses this gap by proposing PHIDA, a persistence-guided node-to-cluster mapping method for online clustering with learned nodes. PHIDA implements this mapping within Adaptive Resonance Theory (ART)-based online clustering by combining Inverse-Distance ART (IDA) node learning with node-to-cluster mapping constrained by Persistent Homology (PH). Experiments on 24 benchmark datasets show that PHIDA achieves the best average ranks in stationary comparisons that include the recent stationary-only clustering methods, while also improving aggregate performance in the nonstationary setting over the evaluated online methods that adaptively create and update nodes. Ablations and comparisons with conventional node-to-cluster mappings indicate that the observed gains are associated with PH-constrained mapping that preserves raw PH components, together with the use of the PH component view during node learning. Source code is available at https://github.com/Masuyama-lab/PHIDA
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。