High-dimensional clustering via Random Projections
Not on the map. Why?
Abstract (arXiv)
In this work, we address the unsupervised classification issue by exploiting the general idea of Random Projection Ensemble. Specifically, we propose to generate a set of low dimensional independent random projections and to perform model-based clustering on each of them. The top B^* projections, i.e. the projections which show the best grouping structure are then retained. The final partition is obtained by aggregating the clusters found in the projections via consensus. The performances of the method are assessed on both real and simulated datasets. The obtained results suggest that the proposal represents a promising tool for high-dimensional clustering.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.
4 papers.
- 2023Sharp-SSL: Selective high-dimensional axis-aligned random projections for semi-supervised learningcited by 2
- 2023Spatio-Temporal Surrogates for Interaction of a Jet with High Explosives: Part II -- Clustering Extremely High-Dimensional Grid-Based Datacited by 0
- 2024Random-projection ensemble dimension reductioncited by 0
- 2026Sparse clustering via the Deterministic Information Bottleneck algorithmcited by 0
- 2026Sparse clustering via the Deterministic Information Bottleneck algorithm28 Jan 2026
- 2024Random-projection ensemble dimension reduction7 Oct 2024
- 2023Spatio-Temporal Surrogates for Interaction of a Jet with High Explosives: Part II -- Clustering Extremely High-Dimensional Grid-Based Data3 Jul 2023
- 2023Sharp-SSL: Selective high-dimensional axis-aligned random projections for semi-supervised learning18 Apr 2023