Zisen Kong , Zhiqiang Fu , Dongxia Chang , Yiming Wang , Yao Zhao
{"title":"Dual-space Co-training for Large-scale Multi-view Clustering","authors":"Zisen Kong , Zhiqiang Fu , Dongxia Chang , Yiming Wang , Yao Zhao","doi":"10.1016/j.patcog.2025.111844","DOIUrl":null,"url":null,"abstract":"<div><div>Anchor-based methods are popular for their low computational complexity and high efficiency. Existing solutions either construct anchors on each view and fuse them, or directly obtain a consistent view structure. However, these strategies do not fully utilize the information between views. To address this, we propose a Dual-space Co-training (DSCMC) model for Large-scale Multi-view Clustering, which learns the consistent anchor graph using a dual-space co-training strategy. Specifically, we introduce an orthogonal projection matrix in the original space enabling the learned consistent anchor graph to capture the inherent relationships in each view. Meanwhile, the feature transformation matrix maps samples to a shared latent space, facilitating information alignment and comprehensive data distribution understanding. The proposed joint optimization strategy allows us to construct a discriminative anchor graph that effectively captures the essential features of multi-view data. Extensive experiments demonstrate that our method reduces computational complexity while outperforming existing approaches in clustering performance.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"168 ","pages":"Article 111844"},"PeriodicalIF":7.5000,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325005047","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Anchor-based methods are popular for their low computational complexity and high efficiency. Existing solutions either construct anchors on each view and fuse them, or directly obtain a consistent view structure. However, these strategies do not fully utilize the information between views. To address this, we propose a Dual-space Co-training (DSCMC) model for Large-scale Multi-view Clustering, which learns the consistent anchor graph using a dual-space co-training strategy. Specifically, we introduce an orthogonal projection matrix in the original space enabling the learned consistent anchor graph to capture the inherent relationships in each view. Meanwhile, the feature transformation matrix maps samples to a shared latent space, facilitating information alignment and comprehensive data distribution understanding. The proposed joint optimization strategy allows us to construct a discriminative anchor graph that effectively captures the essential features of multi-view data. Extensive experiments demonstrate that our method reduces computational complexity while outperforming existing approaches in clustering performance.
期刊介绍:
The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.