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, which
limits the expressiveness of the model. Moreover, a range of methods suffer
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 to solve
the resultant problem with proven convergence. Comprehensive experiments on
various datasets demonstrate the promising clustering performance of our
proposed method.

提出了一种多视角聚类方法，它使用矩阵分解实现低复杂度且高效率的多视角聚类，并在自我监督学习的基础上利用多样的表示方法，避免二阶段过程，在多维度下开展信息聚合，并使用 $k$-means 进行统一聚类，得出了在各种数据集上优越的聚类性能表现。