Multi-View Intact Space Clustering

被引:8
作者
Huang, Ling [1 ]
Chao, Hong-Yang [1 ]
Wang, Chang-Dong [1 ]
机构
[1] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China
来源
PROCEEDINGS 2017 4TH IAPR ASIAN CONFERENCE ON PATTERN RECOGNITION (ACPR) | 2017年
关键词
multi-view; clustering; intact space;
D O I
10.1109/ACPR.2017.59
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-view clustering is a hot research topic due to the urgent need for analyzing a vast amount of heterogeneous data. Although many multi-view clustering methods have been developed, they have not addressed the view-insufficiency issue. That is, most of the existing multi-view clustering methods assume that each individual view is sufficient for constructing the cluster structure, which is however not guaranteed in real applications. In this paper, we propose a novel multi-view clustering method termed multi-view intact space clustering (MVIC), which is able to simultaneously recover the latent intact space from multiple insufficient views and construct the cluster structure from the resulting intact space. For each view, a view generation function is designed to map the latent intact space representation into the view representation. Since we are given the view representation, by mapping back from each individual view representation, the latent intact space can be restored, based on which the matrix factorization based clustering can be applied. Therefore, the proposed model is composed of two components, namely the reconstruction error of the latent intact space and the distortion error of data clustering in intact space. An alternating iterative method is designed to solve the optimization of the model. Experimental results conducted on a wide-range of multi-view datasets have confirmed the superiority of our method over state-of-the-art approaches.
引用
收藏
页码:500 / 505
页数:6
相关论文
共 18 条
[1]  
Cai X., 2013, P 23 INT JOINT C ART, P2598
[2]   TW-k-Means: Automated Two-Level Variable Weighting Clustering Algorithm for Multiview Data [J].
Chen, Xiaojun ;
Xu, Xiaofei ;
Huang, Joshua Zhexue ;
Ye, Yunming .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013, 25 (04) :932-944
[3]  
Ding C, 2005, SIAM PROC S, P606
[4]   Clustering by passing messages between data points [J].
Frey, Brendan J. ;
Dueck, Delbert .
SCIENCE, 2007, 315 (5814) :972-976
[5]  
Kim YM, 2010, SIGIR 2010: PROCEEDINGS OF THE 33RD ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH DEVELOPMENT IN INFORMATION RETRIEVAL, P821
[6]  
Kumar A., 2011, P ADV NEUR INF PROC, P1413, DOI DOI 10.5555/2986459.2986617
[7]  
Kumar H., 2011, INT C MACH LEARN, P393
[8]  
Li J.-H., 2017, PATTERN RECOGNITION
[9]  
Lichman M., 2013, UCI MACHINE LEARNING
[10]   Normalized cuts and image segmentation [J].
Shi, JB ;
Malik, J .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2000, 22 (08) :888-905