Feature concatenation multi-view subspace clustering

被引:95
作者
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 条
[1]  
Andrienko G., 2013, Introduction, P1
[2]  
[Anonymous], 2011, INT C MACHINE LEARNI
[3]  
[Anonymous], 2009, P INT C NEUR INF PRO
[4]  
[Anonymous], 2017, ADV NEURAL INF PROCE
[5]  
[Anonymous], 2013, arXiv
[6]  
[Anonymous], 2011, Advances in Neural Information Processing Systems
[7]  
[Anonymous], 2009, P 26 ANN INT C MACHI
[8]  
[Anonymous], 2006, ACM SIGKDD INT C KNO
[9]   ALGORITHM - SOLUTION OF MATRIX EQUATION AX+XB = C [J].
BARTELS, RH ;
STEWART, GW .
COMMUNICATIONS OF THE ACM, 1972, 15 (09) :820-&
[10]   Multi-view low-rank sparse subspace clustering [J].
Brbic, Maria ;
Kopriva, Ivica .
PATTERN RECOGNITION, 2018, 73 :247-258