t-SNE
Also known as: t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
t-SNE (t-Distributed Stochastic Neighbor Embedding) is a nonlinear dimensionality-reduction method introduced by Laurens van der Maaten and Geoffrey Hinton in 2008 that maps high-dimensional data into a 2D or 3D space for visualization. It preserves probabilistic local similarities, so points that are neighbours in the original space stay close together, revealing cluster structure and local neighbourhoods.
Key highlights
- Excellent at revealing local cluster structure and neighbourhoods that linear methods miss.
- Nonlinear: captures curved manifold structure that PCA cannot.
- Produces intuitive 2D/3D maps that make high-dimensional groupings visible at a glance.
- The heavy-tailed Student-t kernel avoids the crowding problem, keeping clusters well separated.
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Use t-SNE to visualize and explore high-dimensional continuous data — embeddings, gene-expression profiles, image features — when you want to see local cluster structure in 2D or 3D, with at least about 50 observations. It is an exploratory, visual tool: read its maps for grouping and neighbourhood patterns, not for quantitative inference. Standardize features first, tune perplexity (a rule of thumb is around n/10, within 5–50), and check stability across several perplexity values. On very large datasets it is slow, so UMAP is a faster alternative.
Strengths & limitations
- Excellent at revealing local cluster structure and neighbourhoods that linear methods miss.
- Nonlinear: captures curved manifold structure that PCA cannot.
- Produces intuitive 2D/3D maps that make high-dimensional groupings visible at a glance.
- The heavy-tailed Student-t kernel avoids the crowding problem, keeping clusters well separated.
- Visualization only — distances and cluster sizes in the map carry no quantitative meaning, so no statistical inference should be drawn from it.
- Slow on large datasets; UMAP is a faster alternative.
- Results are stochastic and depend strongly on perplexity, so different runs or settings can look different.
- On small samples (n below about 50) the embedding is unstable and not reproducible.
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
What does perplexity control?
Perplexity sets the effective number of neighbours each point considers, balancing attention to local versus broader structure. Typical values are 5–50, with a rule of thumb around n/10; it is wise to try several and check that the visible structure is stable.
Can I read cluster sizes and distances from a t-SNE plot?
No. t-SNE preserves local neighbourhoods but not global geometry, so the size of a cluster and the gaps between clusters are not quantitatively meaningful. Use the plot to spot grouping, not to measure it.
How is t-SNE different from PCA?
PCA is a linear projection onto directions of maximum variance and preserves global structure, while t-SNE is a nonlinear method that preserves local neighbourhoods and excels at revealing clusters. They are complementary; PCA is often used as a preprocessing step before t-SNE.
Should I use t-SNE or UMAP?
Both are nonlinear visualization methods. t-SNE is a long-standing standard for local structure, while UMAP is faster on large datasets and tends to preserve more global structure, so it is the better choice when data volume is high.
Sources
- 1.van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 1). t-SNE. ScholarGate. https://scholargate.app/machine-learning/t-sne