Feature concatenation multi-view subspace clustering

被引:89
作者
Zheng, Qinghai [1 ]
Zhu, Jihua [1 ]
Li, Zhongyu [1 ]
Pang, Shanmin [1 ]
Wang, Jun [2 ]
Li, Yaochen [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Software Engn, Xian 710049, Peoples R China
[2] Shanghai Univ, Sch Commun & Informat Engn, Shanghai 200444, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-view clustering; Subspace clustering; Low-rank representation; Feature concatenation; MAXIMUM-ENTROPY DISCRIMINATION; ALGORITHM; REPRESENTATION; FACTORIZATION; SCALE;
D O I
10.1016/j.neucom.2019.10.074
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-view clustering is a learning paradigm based on multi-view data. Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward. However, feature concatenation is a natural way to combine multiview data. To this end, this paper proposes a novel multi-view subspace clustering approach dubbed Feature Concatenation Multi-view Subspace Clustering (FCMSC), which boosts the clustering performance by exploring the consensus information of multi-view data. Specifically, multi-view data are concatenated into a joint representation firstly, then, l(2,1)-norm is integrated into the objective function to deal with the sample-specific and cluster-specific corruptions of multiple views. Moreover, a graph regularized FCMSC is also proposed in this paper to explore both the consensus information and complementary information of multi-view data for clustering. It is noteworthy that the obtained coefficient matrix is not derived by simply applying the Low-Rank Representation (LRR) to concatenated features directly. Finally, an effective algorithm based on the Augmented Lagrangian Multiplier (ALM) is designed to optimize the objective functions. Comprehensive experiments on six real-world datasets illustrate the superiority of the proposed methods over several state-of-the-art approaches for multi-view clustering. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:89 / 102
页数:14
相关论文
共 69 条
[41]   A tutorial on spectral clustering [J].
von Luxburg, Ulrike .
STATISTICS AND COMPUTING, 2007, 17 (04) :395-416
[42]   Multi-view clustering with extreme learning machine [J].
Wang, Qiang ;
Dou, Yong ;
Liu, Xinwang ;
Lv, Qi ;
Li, Shijie .
NEUROCOMPUTING, 2016, 214 :483-494
[43]  
Wang WR, 2015, PR MACH LEARN RES, V37, P1083
[44]  
Xia RK, 2014, AAAI CONF ARTIF INTE, P2149
[45]   Multiview Spectral Embedding [J].
Xia, Tian ;
Tao, Dacheng ;
Mei, Tao ;
Zhang, Yongdong .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2010, 40 (06) :1438-1446
[46]  
Xu C., 2013, ARXIV
[47]   Deep low-rank subspace ensemble for multi-view clustering [J].
Xue, Zhe ;
Du, Junping ;
Du, Dawei ;
Lyu, Siwei .
INFORMATION SCIENCES, 2019, 482 :210-227
[48]   A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration [J].
Yang, Junfeng ;
Yin, Wotao ;
Zhang, Yin ;
Wang, Yilun .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (02) :569-592
[49]  
Yi X, 2005, LECT NOTES COMPUT SC, V3686, P420
[50]   Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering [J].
Yin, Ming ;
Gao, Junbin ;
Lin, Zhouchen ;
Shi, Qinfeng ;
Guo, Yi .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2015, 24 (12) :4918-4933