mlsanityData to 7 Oct 2026

A Novel Approach for Effective Multi-View Clustering with Information-Theoretic Perspective

arXiv 2309.13989 ↗First posted 25 Sep 2023cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

Multi-view clustering (MVC) is a popular technique for improving clustering performance using various data sources. However, existing methods primarily focus on acquiring consistent information while often neglecting the issue of redundancy across multiple views. This study presents a new approach called Sufficient Multi-View Clustering (SUMVC) that examines the multi-view clustering framework from an information-theoretic standpoint. Our proposed method consists of two parts. Firstly, we develop a simple and reliable multi-view clustering method SCMVC (simple consistent multi-view clustering) that employs variational analysis to generate consistent information. Secondly, we propose a sufficient representation lower bound to enhance consistent information and minimise unnecessary information among views. The proposed SUMVC method offers a promising solution to the problem of multi-view clustering and provides a new perspective for analyzing multi-view data. To verify the effectiveness of our model, we conducted a theoretical analysis based on the Bayes Error Rate, and experiments on multiple multi-view datasets demonstrate the superior performance of SUMVC.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 27 of its 59 references that are in the map. First posted on arXiv 25 Sep 2023.

Builds on

27 of 59 references.

References · 27

  1. 2022Generative Adversarial Networkscited by 5,603
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
  4. 2016Deep Variational Information Bottleneckcited by 915
  5. 2015Deep Learning and the Information Bottleneck Principlecited by 793
  6. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  7. 2014Semi-Supervised Learning with Deep Generative Modelscited by 494
  8. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
  9. 2016Variational Deep Embedding: An Unsupervised and Generative Approach to Clusteringcited by 219
  10. 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 213
  11. 2020Learning Robust Representations via Multi-View Information Bottleneckcited by 189
  12. 2018A mathematical theory of semantic development in deep neural networkscited by 182
15 more
  1. 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
  2. 2021Graph Structure Learning with Variational Information Bottleneckcited by 81
  3. 2020An Information Bottleneck Approach for Controlling Conciseness in Rationale Extractioncited by 69
  4. 2021Reconsidering Representation Alignment for Multi-view Clusteringcited by 57
  5. 2021Multi-VAE: Learning Disentangled View-common and View-peculiar Visual Representations for Multi-view Clusteringcited by 51
  6. 2014Robust and Efficient Subspace Segmentation via Least Squares Regressioncited by 47
  7. 2021Self-Supervised Discriminative Feature Learning for Deep Multi-View Clusteringcited by 41
  8. 2020Deep Embedded Multi-view Clustering with Collaborative Trainingcited by 31
  9. 2021Residual Relaxation for Multi-view Representation Learningcited by 30
  10. 2020Neural Methods for Point-wise Dependency Estimationcited by 22
  11. 2022Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondencescited by 20
  12. 2016A Closed Form Solution to Multi-View Low-Rank Regressioncited by 5
  13. 2023MCoCo: Multi-level Consistency Collaborative Multi-view Clusteringcited by 5
  14. 2023Multi-view Semantic Consistency based Information Bottleneck for Clusteringcited by 4
  15. 2023Semantically Consistent Multi-view Representation Learningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 5; 2026: 4.

14 papers.

Sort: