Learning a consensus affinity matrix for multi-view clustering via subspaces merging on Grassmann manifold

Abstract Integrative multi-view subspace clustering aims to partition observed samples into underlying clusters through fusing representative subspace information from different views into a latent space. The clustering performance relies on the accuracy of sample affinity measurement. However, existing approaches leverage the subspace representation of each view and overlook the learning of appropriate sample affinities. This paper proposes to learn a consensus affinity directly by merging subspace representations of different views on a Grassmann manifold while maintaining their geometric structures across these views. The proposed method not only preserves the structure of the most informative individual view, but also discovers a latent common structure across all views. The associated constrained optimization problem is solved using the alternating direction method of multipliers. Extensive experiments on synthetic and real-world datasets show that the proposed method outperforms several state-of-the-art multi-view subspace clustering methods. The affinity matrix obtained by our method can extract highly representative and latent common information to enhance the clustering performance.

[1]  Shuicheng Yan,et al.  Convex Sparse Spectral Clustering: Single-View to Multi-View. , 2016, IEEE transactions on image processing : a publication of the IEEE Signal Processing Society.

[2]  Shiliang Sun,et al.  A survey of multi-view machine learning , 2013, Neural Computing and Applications.

[3]  Qinghua Hu,et al.  Latent Multi-view Subspace Clustering , 2017, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[4]  Vishal M. Patel,et al.  Multimodal sparse and low-rank subspace clustering , 2018, Inf. Fusion.

[5]  Chao Wang,et al.  Integrative cancer patient stratification via subspace merging , 2018, Bioinform..

[6]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[7]  Samir Kanaan-Izquierdo,et al.  Multiview and multifeature spectral clustering using common eigenvectors , 2018, Pattern Recognit. Lett..

[8]  Hal Daumé,et al.  A Co-training Approach for Multi-view Spectral Clustering , 2011, ICML.

[9]  Huan Xu,et al.  Provable Subspace Clustering: When LRR Meets SSC , 2013, IEEE Transactions on Information Theory.

[10]  René Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.

[11]  Gilles Bisson,et al.  An Architecture to Efficiently Learn Co-Similarities from Multi-view Datasets , 2012, ICONIP.

[12]  Junbin Gao,et al.  Low Rank Representation on Grassmann Manifolds , 2014, ACCV.

[13]  Ivica Kopriva,et al.  Multi-view low-rank sparse subspace clustering , 2017, Pattern Recognit..

[14]  Yong Yu,et al.  Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Stan Z. Li,et al.  Multi-view subspace clustering with intactness-aware similarity , 2019, Pattern Recognit..

[16]  Roger Levy,et al.  A new approach to cross-modal multimedia retrieval , 2010, ACM Multimedia.

[17]  Zhenwen Ren,et al.  Robust low-rank kernel multi-view subspace clustering based on the Schatten p-norm and correntropy , 2019, Inf. Sci..

[18]  Pascal Frossard,et al.  Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds , 2013, IEEE Transactions on Signal Processing.

[19]  Shiliang Sun,et al.  Multi-view learning overview: Recent progress and new challenges , 2017, Inf. Fusion.

[20]  Lei Du,et al.  Robust Multi-View Spectral Clustering via Low-Rank and Sparse Decomposition , 2014, AAAI.

[21]  Yiming Yang,et al.  RCV1: A New Benchmark Collection for Text Categorization Research , 2004, J. Mach. Learn. Res..

[22]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Ivica Kopriva,et al.  $\ell_0$ -Motivated Low-Rank Sparse Subspace Clustering , 2018, IEEE Transactions on Cybernetics.

[24]  Johan A. K. Suykens,et al.  Multi-View Kernel Spectral Clustering , 2018, Inf. Fusion.

[25]  Zhi-Quan Luo,et al.  On the linear convergence of the alternating direction method of multipliers , 2012, Mathematical Programming.

[26]  Xinwang Liu,et al.  Learning a Joint Affinity Graph for Multiview Subspace Clustering , 2019, IEEE Transactions on Multimedia.

[27]  Yang Liu,et al.  Structure-Constrained Low-Rank and Partial Sparse Representation with Sample Selection for image classification , 2016, Pattern Recognit..

[28]  Alan Edelman,et al.  The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[29]  Jinbo Bi,et al.  Multi-view cluster analysis with incomplete data to understand treatment effects , 2019, Inf. Sci..

[30]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[31]  Hal Daumé,et al.  Co-regularized Multi-view Spectral Clustering , 2011, NIPS.

[32]  René Vidal,et al.  Subspace Clustering , 2011, IEEE Signal Processing Magazine.