Simple One-Step Multi-View Clustering With Fast Similarity and Cluster Structure Learning

被引:0
作者
Xia, Xianxian [1 ]
Huang, Dong [1 ]
Yang, Chen-Min [1 ]
He, Chaobo [2 ]
Wang, Chang-Dong [3 ,4 ]
机构
[1] South China Agr Univ, Coll Math & Informat, Guangzhou 510642, Peoples R China
[2] South China Normal Univ, Sch Comp Sci, Guangzhou 510635, Peoples R China
[3] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[4] Guangdong Key Lab Big Data Anal & Proc, Guangzhou 510006, Peoples R China
关键词
Optimization; Bipartite graph; Similarity learning; Linear programming; Adaptation models; Vectors; Signal processing algorithms; Laplace equations; Clustering algorithms; Training; Consensus information; data clustering; lare-scale clustering; linear time; multi-view clustering;
D O I
10.1109/LSP.2025.3560529
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multi-view clustering (MVC) is essential for integrating heterogeneous data from multiple sources. However, many existing approaches are hindered by high computational complexity and the separate optimization of similarity and cluster structures. In light of these challenges, this paper presents a novel anchor-based MVC method termed simple one-step multi-view clustering with fast similarity and cluster structure learning (SONIC), which models adaptive anchor learning, multi-view similarity structure learning, and discrete cluster structure learning in a joint framework. In particular, we employ the anchor-based multi-view similarity learning to capture the consensus manifold structure latent in multiple views, thereby constructing a unified bipartite graph with adaptive anchor learning and view weighting. Then we impose a low-rank constraint on the bipartite graph structure to directly reveal the desired number of clusters without additional post-processing. An efficient alternating minimization algorithm is developed to optimize the model, resulting in a computational complexity that scales linearly with the number of samples. Extensive experiments on eight benchmark datasets demonstrate the superior performance of SONIC in both clustering quality and computational efficiency.
引用
收藏
页码:1850 / 1854
页数:5
相关论文
共 34 条
[1]   Seeking commonness and inconsistencies: A jointly smoothed approach to multi-view subspace clustering [J].
Cai, Xiaosha ;
Huang, Dong ;
Zhang, Guang-Yu ;
Wang, Chang-Dong .
INFORMATION FUSION, 2023, 91 :364-375
[2]   Diversity-induced Multi-view Subspace Clustering [J].
Cao, Xiaochun ;
Zhang, Changqing ;
Fu, Huazhu ;
Liu, Si ;
Zhang, Hua .
2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, :586-594
[3]  
Chao Guoqing, 2021, IEEE Trans Artif Intell, V2, P146, DOI [10.1109/tai.2021.3065894, 10.1109/tai.2021.3065894]
[4]  
Craven M, 1998, FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, P509
[6]   Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning [J].
Fang, Si-Guo ;
Huang, Dong ;
Cai, Xiao-Sha ;
Wang, Chang-Dong ;
He, Chaobo ;
Tang, Yong .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (08) :11436-11447
[7]  
Hu Y., 2022, P IEEE INT C MULT EX, P1
[8]   Robust Multi-View Clustering Through Partition Integration on Stiefel Manifold [J].
Hu, Yu ;
Guo, Endai ;
Xie, Zhi ;
Liu, Xinwang ;
Cai, Hongmin .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (10) :10397-10410
[9]   Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding [J].
Hu, Zhanxuan ;
Nie, Feiping ;
Wang, Rong ;
Li, Xuelong .
INFORMATION FUSION, 2020, 55 :251-259
[10]   Fast Multi-View Clustering Via Ensembles: Towards Scalability, Superiority, and Simplicity [J].
Huang, Dong ;
Wang, Chang-Dong ;
Lai, Jian-Huang .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (11) :11388-11402