UMAP
Uniform Manifold Approximation and Projection · Also known as: UMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reduction
UMAP (Uniform Manifold Approximation and Projection) is a fast, scalable nonlinear dimension-reduction method grounded in manifold-learning theory, introduced by McInnes, Healy and Melville in 2018. It compresses high-dimensional data into a low-dimensional embedding for visualisation and downstream analysis.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use UMAP to visualise or compress continuous, high-dimensional data on at least about 50 observations, whether for exploration or as a preprocessing step before classification. The n_neighbors and min_dist hyperparameters should be tuned to the structure you care about, and a random_state should be fixed for reproducibility. Below about 50 observations the manifold cannot be learned reliably and linear PCA is the safer choice.
Strengths & limitations
- Fast and scalable to large datasets, far quicker than t-SNE.
- Preserves global structure better than t-SNE while still capturing local clusters.
- Captures nonlinear structure that linear methods such as PCA cannot.
- Produces 2- or 3-dimensional embeddings well suited to visualisation.
- Distances between clusters in the embedding can be misleading and should not be over-interpreted.
- Results depend on the n_neighbors and min_dist hyperparameters, which must be tuned.
- Output is not deterministic unless a random_state is fixed.
- On small samples (n below about 50) the manifold cannot be learned reliably and the visual becomes misleading; PCA is preferable.
Frequently asked
How is UMAP different from t-SNE?
Both are nonlinear methods for visualising high-dimensional data, but UMAP is built on manifold-learning theory, tends to preserve global structure better, and is much faster on large datasets.
Can I interpret distances between clusters in the plot?
Be cautious. UMAP preserves cluster shapes, but the distances between clusters can be misleading and should not be read as precise quantities.
Which hyperparameters matter most?
n_neighbors controls the balance between local and global structure, and min_dist controls how tightly points pack together. Both should be tuned, and a random_state should be fixed so the embedding is reproducible.
What if I have very few observations?
Below about 50 observations the manifold cannot be learned reliably and the embedding becomes misleading. In that case a linear method such as PCA is the safer choice.
Sources
- McInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426. link ↗
How to cite this page
ScholarGate. (2026, June 1). Uniform Manifold Approximation and Projection. ScholarGate. https://scholargate.app/en/machine-learning/umap-reduction
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Factor AnalysisResearch Statistics↔ compare
- K-meansMachine learning↔ compare
- Principal Component AnalysisMachine learning↔ compare
- Random ForestMachine learning↔ compare
- t-SNEMachine learning↔ compare