Multi-view Subspace Clustering Networks with Local and Global Graph Information

• URL: http://arxiv.org/abs/2010.09323v3
• Date: Wed, 24 Mar 2021 13:17:30 GMT
• Title: Multi-view Subspace Clustering Networks with Local and Global Graph Information
• Authors: Qinghai Zheng, Jihua Zhu, Yuanyuan Ma, Zhongyu Li, Zhiqiang Tian
• Abstract summary: 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.
• Score: 19.64977233324484
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This study investigates the problem of multi-view subspace clustering, the goal of which is to explore the underlying grouping structure of data collected from different fields or measurements. Since data do not always comply with the linear subspace models in many real-world applications, most existing multi-view subspace clustering methods that based on the shallow linear subspace models may fail in practice. Furthermore, underlying graph information of multi-view data is always ignored in most existing multi-view subspace clustering methods. To address aforementioned limitations, we proposed the novel multi-view subspace clustering networks with local and global graph information, termed MSCNLG, in this paper. Specifically, autoencoder networks are employed on multiple views to achieve latent smooth representations that are suitable for the linear assumption. Simultaneously, by integrating fused multi-view graph information into self-expressive layers, the proposed MSCNLG obtains the common shared multi-view subspace representation, which can be used to get clustering results by employing the standard spectral clustering algorithm. As an end-to-end trainable framework, the proposed method fully investigates the valuable information of multiple views. Comprehensive experiments on six benchmark datasets validate the effectiveness and superiority of the proposed MSCNLG.

Related papers

• Joint Multi-View Collaborative Clustering [0.0]
  Multi-view data provide richer information than traditional single-view data. The goal of multi-view clustering algorithms is to discover the common latent structure shared by multiple views. We propose the Joint Multi-View Collaborative Clustering (JMVCC) solution.
  arXiv  Detail & Related papers  (2023-10-25T08:23:45Z)
• Anchor-based Multi-view Subspace Clustering with Hierarchical Feature Descent [46.86939432189035]
  We propose Anchor-based Multi-view Subspace Clustering with Hierarchical Feature Descent. Our proposed model consistently outperforms the state-of-the-art techniques.
  arXiv  Detail & Related papers  (2023-10-11T03:29:13Z)
• 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)
• 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)
• Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework [74.25493157757943]
  We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
  arXiv  Detail & Related papers  (2022-11-03T08:18:27Z)
• Double Graphs Regularized Multi-view Subspace Clustering [15.52467509308717]
  We propose a novel Double Graphs Regularized Multi-view Subspace Clustering (DGRMSC) method. It aims to harness both global and local structural information of multi-view data in a unified framework.
  arXiv  Detail & Related papers  (2022-09-30T00:16:42Z)
• 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)
• 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.