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

arXiv: https://arxiv.org/abs/2401.15691 · HTML: https://mlsanity.com/paper/2401.15691/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 7 of its 37 references that are in the map.
- First posted on arXiv 28 Jan 2024.

## Builds on (most cited first, 7 of 7)

- [Convex optimization](https://mlsanity.com/paper/2106.01946/) (2021)
- [Large-scale Multi-view Subspace Clustering in Linear Time](https://mlsanity.com/paper/1911.09290/) (2019)
- [GCFAgg: Global and Cross-view Feature Aggregation for Multi-view Clustering](https://mlsanity.com/paper/2305.06799/) (2023)
- [Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences](https://mlsanity.com/paper/2205.15075/) (2022)
- [Auto-weighted Multi-view Clustering for Large-scale Data](https://mlsanity.com/paper/2303.01983/) (2023)
- [Convex Sparse Spectral Clustering: Single-view to Multi-view](https://mlsanity.com/paper/1511.06860/) (2015)
- [Adaptively-weighted Integral Space for Fast Multiview Clustering](https://mlsanity.com/paper/2208.12808/) (2022)

## Abstract (arXiv)

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.