Low-Rank Tensor Based Proximity Learning for Multi-View Clustering

被引:83
作者
Chen, Man-Sheng [1 ,2 ,3 ]
Wang, Chang-Dong [1 ,2 ,3 ]
Lai, Jian-Huang [1 ,2 ,3 ]
机构
[1] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510275, Guangdong, Peoples R China
[2] Guangdong Prov Key Lab Computat Sci, Guangzhou 510275, Guangdong, Peoples R China
[3] Minist Educ, Key Lab Machine Intelligence & Adv Comp, Beijing 100816, Peoples R China
关键词
Tensors; Correlation; Clustering methods; Kernel; Data structures; Sparse matrices; Semantics; Multi-view clustering; low-rank tensor representation; consensus indicator; adaptive confidences; GRAPH;
D O I
10.1109/TKDE.2022.3151861
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph-oriented multi-view clustering methods have achieved impressive performances by employing relationships and complex structures hidden in multi-view data. However, most of them still suffer from the following two common problems. (1) They target at studying a common representation or pairwise correlations between views, neglecting the comprehensiveness and deeper higher-order correlations among multiple views. (2) The prior knowledge of view-specific representation can not be taken into account to obtain the consensus indicator graph in a unified graph construction and clustering framework. To deal with these problems, we propose a novel Low-rank Tensor Based Proximity Learning (LTBPL) approach for multi-view clustering, where multiple low-rank probability affinity matrices and consensus indicator graph reflecting the final performances are jointly studied in a unified framework. Specifically, multiple affinity representations are stacked in a low-rank constrained tensor to recover their comprehensiveness and higher-order correlations. Meanwhile, view-specific representation carrying different adaptive confidences is jointly linked with the consensus indicator graph. Extensive experiments on nine real-world datasets indicate the superiority of LTBPL compared with the state-of-the-art methods.
引用
收藏
页码:5076 / 5090
页数:15
相关论文
共 66 条
[1]  
[Anonymous], 2005, P 18 INT C NEUR INF
[2]  
Boyd SP., 2004, Convex optimization, DOI 10.1017/CBO9780511804441
[3]   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
[4]   Constrained Multi-View Video Face Clustering [J].
Cao, Xiaochun ;
Zhang, Changqing ;
Zhou, Chengju ;
Fu, Huazhu ;
Foroosh, Hassan .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2015, 24 (11) :4381-4393
[5]   Reduced rank regression via adaptive nuclear norm penalization [J].
Chen, Kun ;
Dong, Hongbo ;
Chan, Kung-Sik .
BIOMETRIKA, 2013, 100 (04) :901-920
[6]   Spectral Clustering of Customer Transaction Data With a Two-Level Subspace Weighting Method [J].
Chen, Xiaojun ;
Sun, Wenya ;
Wang, Bo ;
Li, Zhihui ;
Wang, Xizhao ;
Ye, Yunming .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (09) :3230-3241
[7]   Multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix [J].
Chen, Yongyong ;
Xiao, Xiaolin ;
Zhou, Yicong .
PATTERN RECOGNITION, 2020, 106
[8]   Jointly Learning Kernel Representation Tensor and Affinity Matrix for Multi-View Clustering [J].
Chen, Yongyong ;
Xiao, Xiaolin ;
Zhou, Yicong .
IEEE TRANSACTIONS ON MULTIMEDIA, 2020, 22 (08) :1985-1997
[9]   Graph-regularized least squares regression for multi-view subspace clustering [J].
Chen, Yongyong ;
Wang, Shuqin ;
Zheng, Fangying ;
Cen, Yigang .
KNOWLEDGE-BASED SYSTEMS, 2020, 194
[10]  
De Sa V.R., 2005, ICML WORKSHOP LEARNI, P20