One-step Multi-view Clustering with Diverse Representation

TL;DR

This paper introduces a novel one-step multi-view clustering method that integrates multi-view learning and k-means into a single framework, improving efficiency and clustering quality for large-scale data.

Contribution

It proposes a unified approach that projects data into diverse latent spaces and directly obtains consensus clustering, overcoming limitations of fixed dimensions and two-step processes.

Findings

Achieves superior clustering performance on various datasets.

Reduces computational complexity compared to existing methods.

Provides an efficient optimization algorithm with proven convergence.

Abstract

Multi-view clustering has attracted broad attention due to its capacity to utilize consistent and complementary information among views. Although tremendous progress has been made recently, most existing methods undergo high complexity, preventing them from being applied to large-scale tasks. Multi-view clustering via matrix factorization is a representative to address this issue. However, most of them map the data matrices into a fixed dimension, limiting the model's expressiveness. Moreover, a range of methods suffers from a two-step process, i.e., multimodal learning and the subsequent $k$-means, inevitably causing a sub-optimal clustering result. In light of this, we propose a one-step multi-view clustering with diverse representation method, which incorporates multi-view learning and $k$-means into a unified framework. Specifically, we first project original data matrices into various latent spaces to attain comprehensive information and auto-weight them in a self-supervised manner. Then we directly use the information matrices under diverse dimensions to obtain consensus discrete clustering labels. The unified work of representation learning and clustering boosts the quality of the final results. Furthermore, we develop an efficient optimization algorithm with proven convergence to solve the resultant problem. Comprehensive experiments on various datasets demonstrate the promising clustering performance of our proposed method.