Multi-View Clustering from the Perspective of Mutual Information
- URL: http://arxiv.org/abs/2302.08743v2
- Date: Tue, 30 May 2023 02:34:45 GMT
- Title: Multi-View Clustering from the Perspective of Mutual Information
- Authors: Fu Lele, Zhang Lei, Wang Tong, Chen Chuan, Zhang Chuanfu, Zheng Zibin
- Abstract summary: We propose a novel model based on information theory termed Informative Multi-View Clustering (IMVC)
IMVC extracts the common and view-specific information hidden in multi-view data and constructs a clustering-oriented comprehensive representation.
We conduct extensive experiments on six benchmark datasets, and the experimental results indicate that the proposed IMVC outperforms other methods.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Exploring the complementary information of multi-view data to improve
clustering effects is a crucial issue in multi-view clustering. In this paper,
we propose a novel model based on information theory termed Informative
Multi-View Clustering (IMVC), which extracts the common and view-specific
information hidden in multi-view data and constructs a clustering-oriented
comprehensive representation. More specifically, we concatenate multiple
features into a unified feature representation, then pass it through a encoder
to retrieve the common representation across views. Simultaneously, the
features of each view are sent to a encoder to produce a compact view-specific
representation, respectively. Thus, we constrain the mutual information between
the common representation and view-specific representations to be minimal for
obtaining multi-level information. Further, the common representation and
view-specific representation are spliced to model the refined representation of
each view, which is fed into a decoder to reconstruct the initial data with
maximizing their mutual information. In order to form a comprehensive
representation, the common representation and all view-specific representations
are concatenated. Furthermore, to accommodate the comprehensive representation
better for the clustering task, we maximize the mutual information between an
instance and its k-nearest neighbors to enhance the intra-cluster aggregation,
thus inducing well separation of different clusters at the overall aspect.
Finally, we conduct extensive experiments on six benchmark datasets, and the
experimental results indicate that the proposed IMVC outperforms other methods.
Related papers
- GCFAgg: Global and Cross-view Feature Aggregation for Multi-view
Clustering [45.530950521907265]
Multi-view clustering can partition data samples into their categories by learning a consensus representation in unsupervised way.
We propose a novel multi-view clustering network to address these problems, called Global and Cross-view Feature aggregation for Multi-View Clustering (GggMVC)
We show that the proposed method achieves excellent performance in both complete multi-view data clustering tasks and incomplete multi-view data clustering tasks.
arXiv Detail & Related papers (2023-05-11T13:41:13Z) - Deep Incomplete Multi-view Clustering with Cross-view Partial Sample and
Prototype Alignment [50.82982601256481]
We propose a Cross-view Partial Sample and Prototype Alignment Network (CPSPAN) for Deep Incomplete Multi-view Clustering.
Unlike existing contrastive-based methods, we adopt pair-observed data alignment as 'proxy supervised signals' to guide instance-to-instance correspondence construction.
arXiv Detail & Related papers (2023-03-28T02:31:57Z) - 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) - 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) - 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) - 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) - Agglomerative Neural Networks for Multi-view Clustering [109.55325971050154]
We propose the agglomerative analysis to approximate the optimal consensus view.
We present Agglomerative Neural Network (ANN) based on Constrained Laplacian Rank to cluster multi-view data directly.
Our evaluations against several state-of-the-art multi-view clustering approaches on four popular datasets show the promising view-consensus analysis ability of ANN.
arXiv Detail & Related papers (2020-05-12T05:39:10Z) - 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.