Multi-view Deep Subspace Clustering Networks

• URL: http://arxiv.org/abs/1908.01978v2
• Date: Sun, 24 Mar 2024 17:47:06 GMT
• Title: Multi-view Deep Subspace Clustering Networks
• Authors: Pengfei Zhu, Xinjie Yao, Yu Wang, Binyuan Hui, Dawei Du, Qinghua Hu,
• Abstract summary: Multi-view subspace clustering aims to discover the inherent structure of data by fusing multiple views of complementary information. We propose the Multi-view Deep Subspace Clustering Networks (MvDSCN), which learns a multi-view self-representation matrix in an end-to-end manner. The MvDSCN unifies multiple backbones to boost clustering performance and avoid the need for model selection.
• Score: 64.29227045376359
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-view subspace clustering aims to discover the inherent structure of data by fusing multiple views of complementary information. Most existing methods first extract multiple types of handcrafted features and then learn a joint affinity matrix for clustering. The disadvantage of this approach lies in two aspects: 1) multi-view relations are not embedded into feature learning, and 2) the end-to-end learning manner of deep learning is not suitable for multi-view clustering. Even when deep features have been extracted, it is a nontrivial problem to choose a proper backbone for clustering on different datasets. To address these issues, we propose the Multi-view Deep Subspace Clustering Networks (MvDSCN), which learns a multi-view self-representation matrix in an end-to-end manner. The MvDSCN consists of two sub-networks, \ie, a diversity network (Dnet) and a universality network (Unet). A latent space is built using deep convolutional autoencoders, and a self-representation matrix is learned in the latent space using a fully connected layer. Dnet learns view-specific self-representation matrices, whereas Unet learns a common self-representation matrix for all views. To exploit the complementarity of multi-view representations, the Hilbert--Schmidt independence criterion (HSIC) is introduced as a diversity regularizer that captures the nonlinear, high-order inter-view relations. Because different views share the same label space, the self-representation matrices of each view are aligned to the common one by universality regularization. The MvDSCN also unifies multiple backbones to boost clustering performance and avoid the need for model selection. Experiments demonstrate the superiority of the MvDSCN.

Related papers

• Asymmetric double-winged multi-view clustering network for exploring Diverse and Consistent Information [28.300395619444796]
  In unsupervised scenarios, deep contrastive multi-view clustering (DCMVC) is becoming a hot research spot. We propose a novel multi-view clustering network termed CodingNet to explore the diverse and consistent information simultaneously. Our framework's efficacy is validated through extensive experiments on six widely used benchmark datasets.
  arXiv  Detail & Related papers  (2023-09-01T14:13:22Z)
• 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)
• GOCA: Guided Online Cluster Assignment for Self-Supervised Video Representation Learning [49.69279760597111]
  Clustering is a ubiquitous tool in unsupervised learning. Most of the existing self-supervised representation learning methods typically cluster samples based on visually dominant features. We propose a principled way to combine two views. Specifically, we propose a novel clustering strategy where we use the initial cluster assignment of each view as prior to guide the final cluster assignment of the other view.
  arXiv  Detail & Related papers  (2022-07-20T19:26:55Z)
• Deep Image Clustering with Contrastive Learning and Multi-scale Graph Convolutional Networks [58.868899595936476]
  This paper presents a new deep clustering approach termed image clustering with contrastive learning and multi-scale graph convolutional networks (IcicleGCN) Experiments on multiple image datasets demonstrate the superior clustering performance of IcicleGCN over the state-of-the-art.
  arXiv  Detail & Related papers  (2022-07-14T19:16:56Z)
• Joint Multi-view Unsupervised Feature Selection and Graph Learning [18.303477722460247]
  This paper presents a joint multi-view unsupervised feature selection and graph learning (JMVFG) approach. We formulate the multi-view feature selection with decomposition, where each target matrix is decomposed into a view-specific basis matrix. Experiments on a variety of real-world multi-view datasets demonstrate the superiority of our approach for both the multi-view feature selection and graph learning tasks.
  arXiv  Detail & Related papers  (2022-04-18T10:50:03Z)
• Multi-view Subspace Adaptive Learning via Autoencoder and Attention [3.8574404853067215]
  We propose a new Multiview Subspace Adaptive Learning based on Attention and Autoencoder (MSALAA) This method combines a deep autoencoder and a method for aligning the self-representations of various views. We empirically observe significant improvement over existing baseline methods on six real-life datasets.
  arXiv  Detail & Related papers  (2022-01-01T11:31:52Z)
• Multi-view Subspace Clustering Networks with Local and Global Graph Information [19.64977233324484]
  The goal of this study is to explore the underlying grouping structure of data collected from different fields or measurements. We propose the novel multi-view subspace clustering networks with local and global graph information, termed MSCNLG. As an end-to-end trainable framework, the proposed method fully investigates the valuable information of multiple views.
  arXiv  Detail & Related papers  (2020-10-19T09:00:19Z)
• Deep Incomplete Multi-View Multiple Clusterings [41.43164409639238]
  We introduce a deep incomplete multi-view multiple clusterings framework, which achieves the completion of data view and multiple shared representations simultaneously. Experiments on benchmark datasets confirm that DiMVMC outperforms the state-of-the-art competitors in generating multiple clusterings with high diversity and quality.
  arXiv  Detail & Related papers  (2020-10-02T08:01:24Z)
• Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from Cross View and Each View [68.88732535086338]
  This paper proposes a new multi-view clustering method, low-rank subspace multi-view clustering based on adaptive graph regularization. Experimental results for five widely used multi-view benchmarks show that our proposed algorithm surpasses other state-of-the-art methods by a clear margin.
  arXiv  Detail & Related papers  (2020-08-23T08:25:06Z)
• Generative Partial Multi-View Clustering [133.36721417531734]
  We propose a generative partial multi-view clustering model, named as GP-MVC, to address the incomplete multi-view problem. First, multi-view encoder networks are trained to learn common low-dimensional representations, followed by a clustering layer to capture the consistent cluster structure across multiple views. Second, view-specific generative adversarial networks are developed to generate the missing data of one view conditioning on the shared representation given by other views.
  arXiv  Detail & Related papers  (2020-03-29T17:48:27Z)

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.