Multi-view Semantic Consistency based Information Bottleneck for Clustering

• URL: http://arxiv.org/abs/2303.00002v1
• Date: Tue, 28 Feb 2023 02:01:58 GMT
• Title: Multi-view Semantic Consistency based Information Bottleneck for Clustering
• Authors: Wenbiao Yan, Jihua Zhu, Yiyang Zhou, Yifei Wang, Qinghai Zheng
• Abstract summary: We introduce a novel Multi-view Semantic Consistency based Information Bottleneck for clustering (MSCIB) MSCIB pursues semantic consistency to improve the learning process of information bottleneck for different views. It conducts the alignment operation of multiple views in the semantic space and jointly achieves the valuable consistent information of multi-view data.
• Score: 13.589996737740208
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-view clustering can make use of multi-source information for unsupervised clustering. Most existing methods focus on learning a fused representation matrix, while ignoring the influence of private information and noise. To address this limitation, we introduce a novel Multi-view Semantic Consistency based Information Bottleneck for clustering (MSCIB). Specifically, MSCIB pursues semantic consistency to improve the learning process of information bottleneck for different views. It conducts the alignment operation of multiple views in the semantic space and jointly achieves the valuable consistent information of multi-view data. In this way, the learned semantic consistency from multi-view data can improve the information bottleneck to more exactly distinguish the consistent information and learn a unified feature representation with more discriminative consistent information for clustering. Experiments on various types of multi-view datasets show that MSCIB achieves state-of-the-art performance.

Related papers

• A Novel Approach for Effective Multi-View Clustering with Information-Theoretic Perspective [24.630259061774836]
  This study presents a new approach called Sufficient Multi-View Clustering (SUMVC) that examines the multi-view clustering framework from an information-theoretic standpoint. Firstly, we develop a simple and reliable multi-view clustering method SCMVC 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.
  arXiv  Detail & Related papers  (2023-09-25T09:41:11Z)
• Multi-View Class Incremental Learning [57.14644913531313]
  Multi-view learning (MVL) has gained great success in integrating information from multiple perspectives of a dataset to improve downstream task performance. This paper investigates a novel paradigm called multi-view class incremental learning (MVCIL), where a single model incrementally classifies new classes from a continual stream of views.
  arXiv  Detail & Related papers  (2023-06-16T08:13:41Z)
• One-step Multi-view Clustering with Diverse Representation [47.41455937479201]
  We propose a one-step multi-view clustering with diverse representation method, which incorporates multi-view learning and $k$-means into a unified framework. We develop an efficient optimization algorithm with proven convergence to solve the resultant problem.
  arXiv  Detail & Related papers  (2023-06-08T02:52:24Z)
• Dual Representation Learning for One-Step Clustering of Multi-View Data [30.131568561100817]
  We propose a novel one-step multi-view clustering method by exploiting the dual representation of both the common and specific information of different views. With this framework, the representation learning and clustering partition mutually benefit each other, which effectively improve the clustering performance.
  arXiv  Detail & Related papers  (2022-08-30T14:20:26Z)
• Self-Supervised Information Bottleneck for Deep Multi-View Subspace Clustering [29.27475285925792]
  We establish a new framework called Self-supervised Information Bottleneck based Multi-view Subspace Clustering (SIB-MSC) Inheriting the advantages from information bottleneck, SIB-MSC can learn a latent space for each view to capture common information among the latent representations of different views. Our method achieves superior performance over the related state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-26T15:49:59Z)
• Error-Robust Multi-View Clustering: Progress, Challenges and Opportunities [67.54503077766171]
  Since label information is often expensive to acquire, multi-view clustering has gained growing interest. Error-robust multi-view clustering approaches with explicit error removal formulation can be structured into five broad research categories. This survey summarizes and reviews recent advances in error-robust clustering for multi-view data.
  arXiv  Detail & Related papers  (2021-05-07T04:03:02Z)
• Self-supervised Discriminative Feature Learning for Multi-view Clustering [12.725701189049403]
  We propose self-supervised discriminative feature learning for multi-view clustering (SDMVC) Concretely, deep autoencoders are applied to learn embedded features for each view independently. Experiments on various types of multi-view datasets show that SDMVC achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2021-03-28T07:18:39Z)
• V3H: View Variation and View Heredity for Incomplete Multi-view Clustering [65.29597317608844]
  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.
  arXiv  Detail & Related papers  (2020-11-23T03:24:48Z)
• 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.