FastUMAP approximates UMAP via sparse bipartite point-landmark graphs and Nystrom initialization to deliver lower runtimes than Barnes-Hut t-SNE on most tested datasets while retaining competitive kNN accuracy.
Neurocomputing , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
FastUMAP: Scalable Dimensionality Reduction via Bipartite Landmark Sampling
FastUMAP approximates UMAP via sparse bipartite point-landmark graphs and Nystrom initialization to deliver lower runtimes than Barnes-Hut t-SNE on most tested datasets while retaining competitive kNN accuracy.