Seeking commonness and inconsistencies: A jointly smoothed approach to multi-view subspace clustering

被引:96
作者
Cai, Xiaosha [1 ]
Huang, Dong [1 ]
Zhang, Guang-Yu [1 ]
Wang, Chang-Dong [2 ,3 ]
机构
[1] South China Agr Univ, Coll Math & Informat, Guangzhou, Peoples R China
[2] Sun Yat sen Univ, Sch Comp Sci & Engn, Guangzhou, Peoples R China
[3] Guangdong Key Lab Informat Secur Technol, Guangzhou, Peoples R China
关键词
Data clustering; Multi-view clustering; Multi-view subspace clustering; View-consensus grouping effect; Smooth regularization; LOW-RANK; ALGORITHM; GRAPH;
D O I
10.1016/j.inffus.2022.10.020
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-view subspace clustering aims to discover the hidden subspace structures from multiple views for robust clustering, and has been attracting considerable attention in recent years. Despite significant progress, most of the previous multi-view subspace clustering algorithms are still faced with two limitations. First, they usually focus on the consistency (or commonness) of multiple views, yet often lack the ability to capture the cross-view inconsistencies in subspace representations. Second, many of them overlook the local structures of multiple views and cannot jointly leverage multiple local structures to enhance the subspace representation learning. To address these two limitations, in this paper, we propose a jointly smoothed multi-view subspace clustering (JSMC) approach. Specifically, we simultaneously incorporate the cross-view commonness and inconsistencies into the subspace representation learning. The view-consensus grouping effect is presented to jointly exploit the local structures of multiple views to regularize the view-commonness representation, which is further associated with the low-rank constraint via the nuclear norm to strengthen its cluster structure. Thus the cross-view commonness and inconsistencies, the view-consensus grouping effect, and the low-rank representation are seamlessly incorporated into a unified objective function, upon which an alternating optimization algorithm is performed to achieve a robust subspace representation for clustering. Experimental results on a variety of real-world multi-view datasets confirm the superiority of our approach. Code available: https://github.com/huangdonghere/JSMC.
引用
收藏
页码:364 / 375
页数:12
相关论文
共 63 条
[1]  
[Anonymous], 2002, PROC ADV NEURAL INF
[2]   ALGORITHM - SOLUTION OF MATRIX EQUATION AX+XB = C [J].
BARTELS, RH ;
STEWART, GW .
COMMUNICATIONS OF THE ACM, 1972, 15 (09) :820-&
[3]   Multi-view clustering [J].
Bickel, S ;
Scheffer, T .
FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2004, :19-26
[4]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[5]  
Chao Guoqing, 2021, IEEE Trans Artif Intell, V2, P146, DOI [10.1109/tai.2021.3065894, 10.1109/tai.2021.3065894]
[6]  
Chaudhuri K., 2009, Proceedings of the 26th International Conference on Machine Learning, P129
[7]   Relaxed multi-view clustering in latent embedding space [J].
Chen, Man-Sheng ;
Huang, Ling ;
Wang, Chang-Dong ;
Huang, Dong ;
Lai, Jian-Huang .
INFORMATION FUSION, 2021, 68 :8-21
[8]   Multiview Subspace Clustering With Grouping Effect [J].
Chen, Man-Sheng ;
Huang, Ling ;
Wang, Chang-Dong ;
Huang, Dong ;
Yu, Philip S. .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (08) :7655-7668
[9]  
Craven M, 1998, FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, P509
[10]   Consensus graph and spectral representation for one-step multi-view kernel based clustering [J].
El Hajjar, S. ;
Dornaika, F. ;
Abdallah, F. ;
Barrena, N. .
KNOWLEDGE-BASED SYSTEMS, 2022, 241