V3H: View Variation and View Heredity for Incomplete Multi-view Clustering

• URL: http://arxiv.org/abs/2011.11194v3
• Date: Fri, 30 Apr 2021 08:34:39 GMT
• Title: V3H: View Variation and View Heredity for Incomplete Multi-view Clustering
• Authors: Xiang Fang, Yuchong Hu, Pan Zhou, Dapeng Oliver Wu
• Abstract summary: Incomplete multi-view clustering is an effective method to integrate these incomplete views. We propose a novel View Variation and View Heredity approach (V3H) to overcome this limitation. V3H presents possibly the first work to introduce genetics to clustering algorithms for learning simultaneously the consistent information and the unique information from incomplete multi-view data.
• Score: 65.29597317608844
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Real data often appear in the form of multiple incomplete views. Incomplete multi-view clustering is an effective method to integrate these incomplete views. Previous methods only learn the consistent information between different views and ignore the unique information of each view, which limits their clustering performance and generalizations. To overcome this limitation, we propose a novel View Variation and View Heredity approach (V3H). Inspired by the variation and the heredity in genetics, V3H first decomposes each subspace into a variation matrix for the corresponding view and a heredity matrix for all the views to represent the unique information and the consistent information respectively. Then, by aligning different views based on their cluster indicator matrices, V3H integrates the unique information from different views to improve the clustering performance. Finally, with the help of the adjustable low-rank representation based on the heredity matrix, V3H recovers the underlying true data structure to reduce the influence of the large incompleteness. More importantly, V3H presents possibly the first work to introduce genetics to clustering algorithms for learning simultaneously the consistent information and the unique information from incomplete multi-view data. Extensive experimental results on fifteen benchmark datasets validate its superiority over other state-of-the-arts.

Related papers

• Cross-view Graph Contrastive Representation Learning on Partially Aligned Multi-view Data [52.491074276133325]
  Multi-view representation learning has developed rapidly over the past decades and has been applied in many fields. We propose a new cross-view graph contrastive learning framework, which integrates multi-view information to align data and learn latent representations. Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method on the clustering and classification tasks.
  arXiv  Detail & Related papers  (2022-11-08T09:19:32Z)
• 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)
• 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)
• Multi-VAE: Learning Disentangled View-common and View-peculiar Visual Representations for Multi-view Clustering [20.412896884905496]
  We present a novel VAE-based multi-view clustering framework (Multi-VAE) We define a view-common variable and multiple view-peculiar variables in the generative model. By controlling the mutual information capacity to disentangle the view-common and view-peculiar representations, continuous visual information of multiple views can be separated.
  arXiv  Detail & Related papers  (2021-06-21T16:23:28Z)
• Multi-view Clustering with Deep Matrix Factorization and Global Graph Refinement [37.34296330445708]
  Multi-view clustering is an important yet challenging task in machine learning and data mining. We propose a novel Multi-View Clustering method with Deep semi-NMF and Global Graph Refinement (MVC-DMF-GGR) in this paper.
  arXiv  Detail & Related papers  (2021-05-01T13:40:20Z)
• 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)
• Consistent and Complementary Graph Regularized Multi-view Subspace Clustering [31.187031653119025]
  This study investigates the problem of multi-view clustering, where multiple views contain consistent information and each view also includes complementary information. We propose a method that involves consistent and complementary graph-regularized multi-view subspace clustering (GRMSC) The objective function is optimized by the augmented Lagrangian multiplier method in order to achieve multi-view clustering.
  arXiv  Detail & Related papers  (2020-04-07T03:48:08Z)
• 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.