Self Supervised Correlation-based Permutations for Multi-View Clustering

• URL: http://arxiv.org/abs/2402.16383v1
• Date: Mon, 26 Feb 2024 08:08:30 GMT
• Title: Self Supervised Correlation-based Permutations for Multi-View Clustering
• Authors: Ran Eisenberg, Jonathan Svirsky, Ofir Lindenbaum
• Abstract summary: We propose an end-to-end deep learning-based MVC framework for general data. Our approach involves learning meaningful fused data representations with a novel permutation-based canonical correlation objective. We demonstrate the effectiveness of our model using ten MVC benchmark datasets.
• Score: 7.972599673048582
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fusing information from different modalities can enhance data analysis tasks, including clustering. However, existing multi-view clustering (MVC) solutions are limited to specific domains or rely on a suboptimal and computationally demanding two-stage procedure of representation and clustering. We propose an end-to-end deep learning-based MVC framework for general data (image, tabular, etc.). Our approach involves learning meaningful fused data representations with a novel permutation-based canonical correlation objective. Concurrently, we learn cluster assignments by identifying consistent pseudo-labels across multiple views. We demonstrate the effectiveness of our model using ten MVC benchmark datasets. Theoretically, we show that our model approximates the supervised linear discrimination analysis (LDA) representation. Additionally, we provide an error bound induced by false-pseudo label annotations.

Related papers

• Consistency Enhancement-Based Deep Multiview Clustering via Contrastive Learning [16.142448870120027]
  We propose a consistent enhancement-based deep MVC method via contrastive learning (C CEC) Specifically, semantic connection blocks are incorporated into a feature representation to preserve the consistent information among multiple views. Experiments conducted on five datasets demonstrate the effectiveness and superiority of our method in comparison with the state-of-the-art (SOTA) methods.
  arXiv  Detail & Related papers  (2024-01-23T10:56:01Z)
• 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)
• Scalable Incomplete Multi-View Clustering with Structure Alignment [71.62781659121092]
  In this paper, we propose a novel incomplete anchor graph learning framework. We construct the view-specific anchor graph to capture the complementary information from different views. The time and space complexity of the proposed SIMVC-SA is proven to be linearly correlated with the number of samples.
  arXiv  Detail & Related papers  (2023-08-31T08:30:26Z)
• Deep Multiview Clustering by Contrasting Cluster Assignments [14.767319805995543]
  Multiview clustering aims to reveal the underlying structure of multiview data by categorizing data samples into clusters. We propose a cross-view contrastive learning (C) method that learns view-invariant representations and produces clustering results by contrasting the cluster assignments among multiple views.
  arXiv  Detail & Related papers  (2023-04-21T06:35:54Z)
• Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
  We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF) Our model directly considers the between-view relationship and exploits the between-view complementary information. In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
  arXiv  Detail & Related papers  (2023-03-29T14:54:19Z)
• 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)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• Unsupervised Visual Representation Learning by Online Constrained K-Means [44.38989920488318]
  Cluster discrimination is an effective pretext task for unsupervised representation learning. We propose a novel clustering-based pretext task with online textbfConstrained textbfK-mtextbfeans (textbfCoKe) Our online assignment method has a theoretical guarantee to approach the global optimum.
  arXiv  Detail & Related papers  (2021-05-24T20:38:32Z)
• Mixing Consistent Deep Clustering [3.5786621294068373]
  Good latent representations produce semantically mixed outputs when decoding linears of two latent representations. We propose the Mixing Consistent Deep Clustering method which encourages representations to appear realistic. We show that the proposed method can be added to existing autoencoders to further improve clustering performance.
  arXiv  Detail & Related papers  (2020-11-03T19:47: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.