LGJan 28, 2024

One for all: A novel Dual-space Co-training baseline for Large-scale Multi-View Clustering

arXiv:2401.15691v12 citationsh-index: 17
Originality Highly original
AI Analysis

This work addresses the problem of efficient and effective clustering for large-scale multi-view data, representing an incremental improvement with a novel method for a known bottleneck.

The paper tackles multi-view clustering by proposing a dual-space co-training method that learns latent consistent anchor graphs and aligns features in a shared space, achieving superior clustering performance with approximate linear computational complexity on large-scale datasets.

In this paper, we propose a novel multi-view clustering model, named Dual-space Co-training Large-scale Multi-view Clustering (DSCMC). The main objective of our approach is to enhance the clustering performance by leveraging co-training in two distinct spaces. In the original space, we learn a projection matrix to obtain latent consistent anchor graphs from different views. This process involves capturing the inherent relationships and structures between data points within each view. Concurrently, we employ a feature transformation matrix to map samples from various views to a shared latent space. This transformation facilitates the alignment of information from multiple views, enabling a comprehensive understanding of the underlying data distribution. We jointly optimize the construction of the latent consistent anchor graph and the feature transformation to generate a discriminative anchor graph. This anchor graph effectively captures the essential characteristics of the multi-view data and serves as a reliable basis for subsequent clustering analysis. Moreover, the element-wise method is proposed to avoid the impact of diverse information between different views. Our algorithm has an approximate linear computational complexity, which guarantees its successful application on large-scale datasets. Through experimental validation, we demonstrate that our method significantly reduces computational complexity while yielding superior clustering performance compared to existing approaches.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes