Adaptive Graph Completion Based Incomplete Multi-View Clustering

被引:172
作者
Wen, Jie [1 ]
Yan, Ke [1 ]
Zhang, Zheng [1 ,2 ]
Xu, Yong [1 ,2 ]
Wang, Junqian [1 ]
Fei, Lunke [3 ]
Zhang, Bob [4 ]
机构
[1] Harbin Inst Technol, Shenzhen Key Lab Visual Object Detect & Recognit, Shenzhen 518055, Peoples R China
[2] Peng Cheng Lab, Shenzhen 518055, Peoples R China
[3] Guangdong Univ Technol, Sch Comp Sci & Technol, Guangzhou 510006, Peoples R China
[4] Univ Macau, Dept Comp & Informat Sci, PAMI Res Grp, Taipa, Macao, Peoples R China
关键词
Electronic mail; Clustering methods; Machine learning; Visualization; Task analysis; Optimization; Incomplete multi-view clustering; common representation; graph completion; similarity graph;
D O I
10.1109/TMM.2020.3013408
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In real-world applications, it is often that the collected multi-view data are incomplete, i.e., some views of samples are absent. Existing clustering methods for incomplete multi-view data all focus on obtaining a common representation or graph from the available views but neglect the hidden information of missing views and information imbalance of different views. To solve these problems, a novel method, called adaptive graph completion based incomplete multi-view clustering (AGC_IMC), is proposed in this paper. Specifically, AGC_IMC develops a joint framework for graph completion and consensus representation learning, which mainly contains three components, i.e., within-view preservation, between-view inferring, and consensus representation learning. To reduce the negative influence of information imbalance, AGC_IMC introduces some adaptive weights to balance the importance of different views during the consensus representation learning. Importantly, AGC_IMC has the potential to recover the similarity graphs of all views with the optimal cluster structure, which encourages it to obtain a more discriminative consensus representation. Experimental results on five well-known datasets show that AGC_IMC significantly outperforms the state-of-the-art methods.
引用
收藏
页码:2493 / 2504
页数:12
相关论文
共 61 条
[1]   Multi-view kernel completion [J].
Bhadra, Sahely ;
Kaski, Samuel ;
Rousu, Juho .
MACHINE LEARNING, 2017, 106 (05) :713-739
[2]  
Chao G., 2017, ARXIV171206246
[3]   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
[4]   Multi-View Subspace Clustering [J].
Gao, Hongchang ;
Nie, Feiping ;
Li, Xuelong ;
Huang, Heng .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :4238-4246
[5]  
Greene Derek, 2006, PROC 23 INT C MACHIN, P377, DOI DOI 10.1145/1143844.1143892
[6]  
Guo J, 2018, AAAI CONF ARTIF INTE, P298
[7]   NEW SPECTRAL METHODS FOR RATIO CUT PARTITIONING AND CLUSTERING [J].
HAGEN, L ;
KAHNG, AB .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1992, 11 (09) :1074-1085
[8]  
Hu ML, 2019, AAAI CONF ARTIF INTE, P3838
[9]  
Hu ML, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2262
[10]  
Huang J, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P3569