arXiv Analytics

Sign in

arXiv:2310.03398 [cs.LG]AbstractReferencesReviewsResources

Interpolating between Clustering and Dimensionality Reduction with Gromov-Wasserstein

Hugues Van Assel, Cédric Vincent-Cuaz, Titouan Vayer, Rémi Flamary, Nicolas Courty

Published 2023-10-05Version 1

We present a versatile adaptation of existing dimensionality reduction (DR) objectives, enabling the simultaneous reduction of both sample and feature sizes. Correspondances between input and embedding samples are computed through a semi-relaxed Gromov-Wasserstein optimal transport (OT) problem. When the embedding sample size matches that of the input, our model recovers classical popular DR models. When the embedding's dimensionality is unconstrained, we show that the OT plan delivers a competitive hard clustering. We emphasize the importance of intermediate stages that blend DR and clustering for summarizing real data and apply our method to visualize datasets of images.

Related articles: Most relevant | Search more
arXiv:2206.13891 [cs.LG] (Published 2022-06-28)
Feature Learning for Dimensionality Reduction toward Maximal Extraction of Hidden Patterns
arXiv:1912.01098 [cs.LG] (Published 2019-12-02)
Using Dimensionality Reduction to Optimize t-SNE
arXiv:2007.13185 [cs.LG] (Published 2020-07-26)
Dimensionality Reduction for $k$-means Clustering