Adaptive Sample-Level Graph Combination for Partial Multiview Clustering
- 15 November 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 29 (10577149) , 2780-2794
Abstract
Multiview clustering explores complementary information among distinct views to enhance clustering performance under the assumption that all samples have complete information in all available views. However, this assumption does not hold in many real applications, where the information of some samples in one or more views may be missing, leading to partial multiview clustering problems. In this case, significant performance degeneration is usually observed. A collection of partial multiview clustering algorithms has been proposed to address this issue and most treat all different views equally during clustering. In fact, because different views provide features collected from different angles/feature spaces, they might play different roles in the clustering process. With the diversity of different views considered, in this study, a novel adaptive method is proposed for partial multiview clustering by automatically adjusting the contributions of different views. The samples are divided into complete and incomplete sets, while a joint learning mechanism is established to facilitate the connection between them and thereby improve clustering performance. More specifically, the method is characterized by a joint optimization model comprising two terms. The first term mines the underlying cluster structure from both complete and incomplete samples by adaptively updating their importance in all available views. The second term is designed to group all data with the aid of the cluster structure modeled in the first term. These two terms seamlessly integrate the complementary information among multiple views and enhance the performance of partial multiview clustering. Experimental results on real-world datasets illustrate the effectiveness and efficiency of our proposed method.Keywords
Funding Information
- National Natural Science Foundation of China (61702358, 61822601, 61732011, 61773050, 61632004, 61432011, U1435212, 91746107)
- Natural Science Foundation of Beijing Municipality (Z180006)
- Beijing Municipal Science and Technology Commission, Adminitrative Commission of Zhongguancun Science Park (Z181100008918012)
- Key Scientific and Technological Support Projects of Tianjin Key R&D Program (18YFZCGX00390)
- National Basic Research Program of China (2017YFC1703506)
- Fundamental Research Funds for the Central Universities (2019JBZ110))
This publication has 50 references indexed in Scilit:
- Multiple Incomplete Views Clustering via Weighted Nonnegative Matrix Factorization with $L_{2,1}$ Regularization2015
- Constrained Multi-View Video Face ClusteringIEEE Transactions on Image Processing, 2015
- Clustering on Multi-source Incomplete Data via Tensor Modeling and Factorization2015
- Semi-paired Probabilistic Canonical Correlation Analysis2014
- Clustering on Multiple Incomplete Datasets via Collective Kernel Learning2013
- A survey of multi-view machine learningNeural Computing and Applications, 2013
- SemiCCA: Efficient Semi-supervised Learning of Canonical CorrelationsIPSJ Online Transactions, 2013
- Multi-view constrained clustering with an incomplete mapping between viewsKnowledge and Information Systems, 2012
- Symmetric Nonnegative Matrix Factorization for Graph Clustering2012
- Weakly-Paired Maximum Covariance Analysis for Multimodal Dimensionality Reduction and Transfer Learning2010