Deep Multi-View Subspace Clustering with Anchor Graph
- URL: http://arxiv.org/abs/2305.06939v1
- Date: Thu, 11 May 2023 16:17:43 GMT
- Title: Deep Multi-View Subspace Clustering with Anchor Graph
- Authors: Chenhang Cui, Yazhou Ren, Jingyu Pu, Xiaorong Pu, Lifang He
- Abstract summary: We propose a novel deep multi-view subspace clustering method with anchor graph (DMCAG)
DMCAG learns the embedded features for each view independently, which are used to obtain the subspace representations.
Our method achieves superior clustering performance over other state-of-the-art methods.
- Score: 11.291831842959926
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Deep multi-view subspace clustering (DMVSC) has recently attracted increasing
attention due to its promising performance. However, existing DMVSC methods
still have two issues: (1) they mainly focus on using autoencoders to
nonlinearly embed the data, while the embedding may be suboptimal for
clustering because the clustering objective is rarely considered in
autoencoders, and (2) existing methods typically have a quadratic or even cubic
complexity, which makes it challenging to deal with large-scale data. To
address these issues, in this paper we propose a novel deep multi-view subspace
clustering method with anchor graph (DMCAG). To be specific, DMCAG firstly
learns the embedded features for each view independently, which are used to
obtain the subspace representations. To significantly reduce the complexity, we
construct an anchor graph with small size for each view. Then, spectral
clustering is performed on an integrated anchor graph to obtain pseudo-labels.
To overcome the negative impact caused by suboptimal embedded features, we use
pseudo-labels to refine the embedding process to make it more suitable for the
clustering task. Pseudo-labels and embedded features are updated alternately.
Furthermore, we design a strategy to keep the consistency of the labels based
on contrastive learning to enhance the clustering performance. Empirical
studies on real-world datasets show that our method achieves superior
clustering performance over other state-of-the-art methods.
Related papers
- S^2MVTC: a Simple yet Efficient Scalable Multi-View Tensor Clustering [38.35594663863098]
Experimental results on six large-scale multi-view datasets demonstrate that S2MVTC significantly outperforms state-of-the-art algorithms in terms of clustering performance and CPU execution time.
arXiv Detail & Related papers (2024-03-14T05:00:29Z) - Efficient Multi-View Graph Clustering with Local and Global Structure
Preservation [59.49018175496533]
We propose a novel anchor-based multi-view graph clustering framework termed Efficient Multi-View Graph Clustering with Local and Global Structure Preservation (EMVGC-LG)
Specifically, EMVGC-LG jointly optimize anchor construction and graph learning to enhance the clustering quality.
In addition, EMVGC-LG inherits the linear complexity of existing AMVGC methods respecting the sample number.
arXiv Detail & Related papers (2023-08-31T12:12:30Z) - Scalable Incomplete Multi-View Clustering with Structure Alignment [71.62781659121092]
In this paper, we propose a novel incomplete anchor graph learning framework.
We construct the view-specific anchor graph to capture the complementary information from different views.
The time and space complexity of the proposed SIMVC-SA is proven to be linearly correlated with the number of samples.
arXiv Detail & Related papers (2023-08-31T08:30:26Z) - Dual Information Enhanced Multi-view Attributed Graph Clustering [11.624319530337038]
A novel Dual Information enhanced multi-view Attributed Graph Clustering (DIAGC) method is proposed in this paper.
The proposed method introduces the Specific Information Reconstruction (SIR) module to disentangle the explorations of the consensus and specific information from multiple views.
The Mutual Information Maximization (MIM) module maximizes the agreement between the latent high-level representation and low-level ones, and enables the high-level representation to satisfy the desired clustering structure.
arXiv Detail & Related papers (2022-11-28T01:18:04Z) - Adaptively-weighted Integral Space for Fast Multiview Clustering [54.177846260063966]
We propose an Adaptively-weighted Integral Space for Fast Multiview Clustering (AIMC) with nearly linear complexity.
Specifically, view generation models are designed to reconstruct the view observations from the latent integral space.
Experiments conducted on several realworld datasets confirm the superiority of the proposed AIMC method.
arXiv Detail & Related papers (2022-08-25T05:47:39Z) - Deep Attention-guided Graph Clustering with Dual Self-supervision [49.040136530379094]
We propose a novel method, namely deep attention-guided graph clustering with dual self-supervision (DAGC)
We develop a dual self-supervision solution consisting of a soft self-supervision strategy with a triplet Kullback-Leibler divergence loss and a hard self-supervision strategy with a pseudo supervision loss.
Our method consistently outperforms state-of-the-art methods on six benchmark datasets.
arXiv Detail & Related papers (2021-11-10T06:53:03Z) - Self-supervised Contrastive Attributed Graph Clustering [110.52694943592974]
We propose a novel attributed graph clustering network, namely Self-supervised Contrastive Attributed Graph Clustering (SCAGC)
In SCAGC, by leveraging inaccurate clustering labels, a self-supervised contrastive loss, are designed for node representation learning.
For the OOS nodes, SCAGC can directly calculate their clustering labels.
arXiv Detail & Related papers (2021-10-15T03:25:28Z) - Smoothed Multi-View Subspace Clustering [14.77544837600836]
We propose a novel multi-view clustering method named smoothed multi-view subspace clustering (SMVSC)
It employs a novel technique, i.e., graph filtering, to obtain a smooth representation for each view.
Experiments on benchmark datasets validate the superiority of our approach.
arXiv Detail & Related papers (2021-06-18T02:24:19Z) - Learning to Cluster Faces via Confidence and Connectivity Estimation [136.5291151775236]
We propose a fully learnable clustering framework without requiring a large number of overlapped subgraphs.
Our method significantly improves clustering accuracy and thus performance of the recognition models trained on top, yet it is an order of magnitude more efficient than existing supervised methods.
arXiv Detail & Related papers (2020-04-01T13:39:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.