T-distributed Stochastic Neighbor Embedding (t-SNE) is a nonlinear dimensionality reduction technique well-suited for embedding high-dimensional data for visualization in a low-dimensional space of two or three dimensions.
What is Dimensionality Reduction?
Dimensionality Reduction is the technique of representing n-dimensions data(multidimensional data with many features) in 2 or 3 dimensions.
An example of dimensionality reduction can be discussed as a classification problem i.e. student will play football or not that relies on both temperature and humidity can be collapsed into just one underlying feature, since both of the features are correlated to a high degree. Hence, we can reduce the number of features in such problems. A 3-D classification problem can be hard to visualize, whereas a 2-D one can be mapped to simple 2-dimensional space and a 1-D problem to a simple line.
How does t-SNE works?
t-SNE a non-linear dimensionality reduction algorithm finds patterns in the data based on the similarity of data points with features, the similarity of points is calculated as the conditional probability that a point A would choose point B as its neighbor.
It then tries to minimize the difference between these conditional probabilities (or similarities) in higher-dimensional and lower-dimensional space for a perfect representation of data points in lower-dimensional space.
Space and Time Complexity
The algorithm computes pairwise conditional probabilities and tries to minimize the sum of the difference of the probabilities in higher and lower dimensions. This involves a lot of calculations and computations. So the algorithm takes a lot of time and space to compute. t-SNE has a quadratic time and space complexity in the number of data points.
Applying t-SNE on MNIST dataset
Code #1: Reading data
Code #2: Data-preprocessing
- k-nearest neighbor algorithm in Python
- ML | Stochastic Gradient Descent (SGD)
- Python | Word Embedding using Word2Vec
- ML | ECLAT Algorithm
- Cristian's Algorithm
- ML | K-means++ Algorithm
- Different Types of Clustering Algorithm
- ML | Expectation-Maximization Algorithm
- Inductive Learning Algorithm
- Crossover in Genetic Algorithm
- ML | Frequent Pattern Growth Algorithm
- Simplex Algorithm - Tabular Method
- Facebook News Feed Algorithm
- Gradient Descent algorithm and its variants
- Encoding Methods in Genetic Algorithm
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.