CDD: Multi-view Subspace Clustering via Cross-view Diversity Detection

The goal of multi-view subspace clustering is to explore a common latent space where the multi-view data points lying on. Myriads of subspace learning algorithms have been investigated to boost the performance of multi-view clustering, but seldom exploiting both the multi-view consistency and multi-view diversity, let alone taking them into consideration simultaneously. To do so, we lodge a novel multi-view subspace clustering via cross-view diversity detection (CDD). CDD is able to exploit these two complementary criteria seamlessly into a holistic design of clustering algorithms. With the consistent part and diverse part being detected, a pure graph can be derived for each view. The consistent pure parts of different views are further fused to a consensus structured graph with exactly k connected components where k is the number of clusters. Thus we can directly obtain the final clustering result without any postprocessing as each connected component precisely corresponds to an individual cluster. We model the above concerns into a unified optimization framework. Our empirical studies validate that the proposed model outperforms several other state-of-the-art methods.

[1]  Yun Fu,et al.  Consensus Guided Multi-View Clustering , 2018, ACM Trans. Knowl. Discov. Data.

[2]  Chang-Dong Wang,et al.  Consistency Meets Inconsistency: A Unified Graph Learning Framework for Multi-view Clustering , 2019, 2019 IEEE International Conference on Data Mining (ICDM).

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

[4]  Zenglin Xu,et al.  Robust deep k-means: An effective and simple method for data clustering , 2021, Pattern Recognit..

[5]  Zenglin Xu,et al.  Auto-weighted multi-view clustering via kernelized graph learning , 2019, Pattern Recognit..

[6]  Zenglin Xu,et al.  Partition level multiview subspace clustering , 2019, Neural Networks.

[7]  Feiping Nie,et al.  A New Simplex Sparse Learning Model to Measure Data Similarity for Clustering , 2015, IJCAI.

[8]  Xuelong Li,et al.  Self-weighted Multiview Clustering with Multiple Graphs , 2017, IJCAI.

[9]  Zenglin Xu,et al.  Auto-weighted multi-view co-clustering with bipartite graphs , 2020, Inf. Sci..

[10]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

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

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

[13]  Xuelong Li,et al.  Parameter-Free Auto-Weighted Multiple Graph Learning: A Framework for Multiview Clustering and Semi-Supervised Classification , 2016, IJCAI.

[14]  Xuelong Li,et al.  Multi-View Clustering and Semi-Supervised Classification with Adaptive Neighbours , 2017, AAAI.

[15]  Feiping Nie,et al.  Efficient and Robust Feature Selection via Joint ℓ2, 1-Norms Minimization , 2010, NIPS.

[16]  Zenglin Xu,et al.  Measuring Diversity in Graph Learning: A Unified Framework for Structured Multi-View Clustering , 2021, IEEE Transactions on Knowledge and Data Engineering.

[17]  Zenglin Xu,et al.  Auto-weighted multi-view clustering via deep matrix decomposition , 2020, Pattern Recognit..

[18]  Xiaochun Cao,et al.  Diversity-induced Multi-view Subspace Clustering , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

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

[20]  Hong Yu,et al.  Weighted Multi-View Spectral Clustering Based on Spectral Perturbation , 2018, AAAI.

[21]  Ehsan Elhamifar,et al.  Sparse subspace clustering , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[22]  Zenglin Xu,et al.  Multiple Partitions Aligned Clustering , 2019, IJCAI.

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

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

[25]  Zenglin Xu,et al.  Large-scale Multi-view Subspace Clustering in Linear Time , 2019, AAAI.

[26]  U. Feige,et al.  Spectral Graph Theory , 2015 .

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

[28]  K. Fan On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I. , 1949, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Xuelong Li,et al.  Multiview Clustering via Adaptively Weighted Procrustes , 2018, KDD.

[30]  Xuelong Li,et al.  Multi-view Subspace Clustering , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).

[31]  Yoram Singer,et al.  Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.

[32]  Feiping Nie,et al.  Multiview Consensus Graph Clustering , 2019, IEEE Transactions on Image Processing.

[33]  Zenglin Xu,et al.  Robust graph regularized nonnegative matrix factorization for clustering , 2017, Data Mining and Knowledge Discovery.

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

[35]  Kun Zhan,et al.  Graph Learning for Multiview Clustering , 2018, IEEE Transactions on Cybernetics.