This paper proposed the novel multi-view subspace clustering networks with local and global graph information, termed MSCNLG, which is an end-to-end trainable framework that fully investigates the valuable information of multiple views.
Authors
Qinghai Zheng
3 papers
Jihua Zhu
4 papers
Zhongyu Li
3 papers
Yuanyuan Ma
1 papers
Zhiqiang Tian
1 papers
References52 items
1
Bipartite Graph Based Multi-View Clustering
2
Deep Partial Multi-View Learning
3
DCSR: Deep clustering under similarity and reconstruction constraints
Multi-view clustering via pairwise sparse subspace representation
38
Adam: A Method for Stochastic Optimization
39
Smooth Representation Clustering
40
Robust Multi-View Spectral Clustering via Low-Rank and Sparse Decomposition
41
Efficient dense subspace clustering
42
Kernel sparse subspace clustering
43
Sparse Subspace Clustering: Algorithm, Theory, and Applications
44
A Survey on Multi-view Learning
45
Ensemble Methods: Foundations and Algorithms
46
Co-regularized Multi-view Spectral Clustering
47
A Co-training Approach for Multi-view Spectral Clustering
48
Robust Recovery of Subspace Structures by Low-Rank Representation
49
A tutorial on spectral clustering
50
Robust recovery of sub-16
51
The proposed method also gains remarkable progress over other deep-based algorithm, i.e., DMSCN, owing to the underlying local and global multi-view graph information are used in our method