English

Self Supervised Correlation-based Permutations for Multi-View Clustering

Machine Learning 2025-05-21 v2 Machine Learning

Abstract

Combining data from different sources can improve data analysis tasks such as clustering. However, most of the current multi-view clustering methods are limited to specific domains or rely on a suboptimal and computationally intensive two-stage process of representation learning and clustering. We propose an end-to-end deep learning-based multi-view clustering framework for general data types (such as images and tables). Our approach involves generating meaningful fused representations using a novel permutation-based canonical correlation objective. We provide a theoretical analysis showing how the learned embeddings approximate those obtained by supervised linear discriminant analysis (LDA). Cluster assignments are learned by identifying consistent pseudo-labels across multiple views. Additionally, we establish a theoretical bound on the error caused by incorrect pseudo-labels in the unsupervised representations compared to LDA. Extensive experiments on ten multi-view clustering benchmark datasets provide empirical evidence for the effectiveness of the proposed model.

Keywords

Cite

@article{arxiv.2402.16383,
  title  = {Self Supervised Correlation-based Permutations for Multi-View Clustering},
  author = {Ran Eisenberg and Jonathan Svirsky and Ofir Lindenbaum},
  journal= {arXiv preprint arXiv:2402.16383},
  year   = {2025}
}
R2 v1 2026-06-28T14:59:56.757Z