> ML_ALGORITHM // T-DISTRIBUTED-STOCHASTIC-NEIGHBOR-EMBEDDING_v1.0
t-Distributed Stochastic Neighbor Embedding (t-SNE)
Non-linear dimensionality reduction technique tailored for exploring and visualizing high-dimensional manifolds in 2D or 3D.
Non-linear Manifold Learningclassical-unsupervisedmoderate-posthocmedium (1k-100k)
Back to All AlgorithmsComputational Complexity
Training Complexity:O(n^2) exact or O(n log n) Barnes-Hut
Inference Complexity:Non-parametric (no out-of-sample projection)
Hardware Profile
CPU Friendly:Yes
Requires GPU:No
Memory Footprint:moderate
Interpretability & Data
Interpretability Tier:moderate-posthoc
Training Data Needs:medium (1k-100k)
Interpretability Assessment
Provides high-contrast 2D/3D visualizations of clusters, though inter-cluster distances are not calibrated.
Suitable Tasks & Supported Modalities
Suitable Tasks:
dimensionality reductiondata visualization
Supported Modalities:
tabularimageembeddings
Implementing Libraries
Foundational Literature
Visualizing Data using t-SNELaurens van der Maaten, Geoffrey Hinton (2008) · Journal of Machine Learning Research (JMLR)
Common Pitfalls & Warnings
- Interpreting distances between distant clusters as quantitative similarity; t-SNE preserves local topology only
- Expecting parametric out-of-sample projection on new test data points