Double Graphs Regularized Multi-view Subspace Clustering
Not on the map. Why?
Abstract (arXiv)
Recent years have witnessed a growing academic interest in multi-view subspace clustering. In this paper, we propose a novel Double Graphs Regularized Multi-view Subspace Clustering (DGRMSC) method, which aims to harness both global and local structural information of multi-view data in a unified framework. Specifically, DGRMSC firstly learns a latent representation to exploit the global complementary information of multiple views. Based on the learned latent representation, we learn a self-representation to explore its global cluster structure. Further, Double Graphs Regularization (DGR) is performed on both latent representation and self-representation to take advantage of their local manifold structures simultaneously. Then, we design an iterative algorithm to solve the optimization problem effectively. Extensive experimental results on real-world datasets demonstrate the effectiveness of the proposed method.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 30 references that are in the map. First posted on arXiv 30 Sep 2022.
Builds on
4 of 30 references.
References · 4
- 2019Multi-graph Fusion for Multi-view Spectral Clusteringcited by 27
- 2019Shared Generative Latent Representation Learning for Multi-view Clusteringcited by 17
- 2019Multi-View Intact Space Learningcited by 11
- 2019Multi-view Subspace Clustering via Partition Fusioncited by 8
Built on by
Not cited yet.