计算机科学
聚类分析
约束(计算机辅助设计)
理论计算机科学
图形
张量(固有定义)
约束聚类
一致性(知识库)
数据挖掘
局部一致性
算法
图论
构造(python库)
有向图
约束满足问题
约束满足
人工智能
光谱聚类
过程(计算)
数据结构
相关聚类
高效算法
作者
Jun Wang,Miaomiao Li,Zhenglai Li,Hao Yu,Suyuan Liu,Dayu Hu,Chang Tang,Xinwang Liu
标识
DOI:10.1109/tkde.2026.3656199
摘要
Anchor graph learning has become a widely used technique for significantly reducing the computational complexity in existing multi-view clustering methods. However, most existing approaches select anchors independently for each view and then generate the consensus graph by directly fusing all anchor graphs. This process overlooks the correspondence between anchor sets across different views, i.e., the column order correspondence of the anchor graphs. To address this limitation, we propose a novel anchor-based tensor multi-rank constraint multi-view clustering method (TMC). Specifically, TMC captures the high-order structural information of the original data by constructing an anchor graph tensor and enforcing a multi-rank constraint to induce a block-diagonal structure. Additionally, to enhance anchor consistency across all view, we construct the anchor graph of each view into an anchor tensor and impose a low-rank constraint on it. In this way, the block-diagonal structure of each anchor graph maintains an approximate alignment between anchors. Furthermore, we provide theoretical proof that the generated anchor graphs inherently exhibit a block-diagonal structure. Extensive experimental results on six multi-view datasets demonstrate that TMC outperforms existing state-of-the-art methods, highlighting its effectiveness in multi-view clustering task.
科研通智能强力驱动
Strongly Powered by AbleSci AI