聚类分析
计算机科学
冗余(工程)
修剪
约束聚类
相关聚类
数据挖掘
人工智能
星团(航天器)
样品(材料)
树冠聚类算法
CURE数据聚类算法
数据流聚类
单连锁聚类
高维数据聚类
层次聚类
机器学习
模式识别(心理学)
迭代法
样品空间
空格(标点符号)
迭代求精
模糊聚类
最优化问题
算法
分布(数学)
近似算法
作者
Xiaohui Wei,Yuting Chen,Feiping Nie,Haibo Liu,Qiya Song,Lin Xiao
标识
DOI:10.1109/tip.2026.3674007
摘要
Multi-view clustering (MVC) based on anchor learning has been proven to be effective in improving clustering accuracy and efficiency. Existing MVC methods are mainly based on single-granularity anchor learning, that is, the number of anchors corresponding to different views is constant and consistent, which will lead to information redundancy or insufficient mining. In addition, aggregating anchors of varying scales from all views to obtain multi-view shared clustering results remains a problem to be further explored. To address the above problems, a novel MVC method named View-adaptive Multi-granularity Anchor Learning (VMAL) is proposed in this paper, where view-adaptive anchor pruning and view-shared sample clustering are jointly optimized. On the one hand, VMAL can dynamically adjust the optimal number of anchors for each view during optimization by exploiting the reconstruction error of samples. On the other hand, an intuitive and effective mapping-aggregation message passing strategy is cleverly designed, which first maps the anchor representations of different views to the cluster space and then transfers the obtained cluster information of anchors to the sample space through an aggregation matrix. As a byproduct, VMAL can directly obtain the discrete cluster distribution of samples without additional partitioning. Finally, an iterative optimization algorithm is developed to solve the proposed VMAL method. Experimental results on multiple datasets have demonstrated the superiority of VMAL in terms of clustering results when compared with other state-of-the-art methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI