Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

t-Distributed Stochastic Neighbor Embedding

Machine Learning Algorithm

t-distributed stochastic neighbor embedding, or t-SNE, is a statistical method for visualizing high-dimensional data by giving each data point a location in a two or three dimensional map. It is a nonlinear dimensionality reduction technique built on the earlier stochastic neighbor embedding method developed by Geoffrey Hinton and Sam Roweis, with Laurens van der Maaten and Hinton proposing the t-distributed variant. It models each high-dimensional object as a point in low-dimensional space such that similar objects are placed near each other and dissimilar objects are placed far apart with high probability.

Facts
Time Complexity
Time Complexity (category)
Quadratic Time -- O(n^2) 1
Connections

Credited To

Source t-Distributed Stochastic Neighbor Embedding (Wikipedia)

In Field

Source t-Distributed Stochastic Neighbor Embedding (Wikipedia)

Invented By

Geoffrey Hinton co-developed t-SNE with Laurens van der Maaten in 2008 as a technique for visualizing high-dimensional data.

Source Wikipedia: Geoffrey Hinton
Sources
1. Wikidata: t-Distributed Stochastic Neighbor Embedding
  • Wikidata Q18387205, class allow-list match (w-wdresolver-0926)
  • t-SNE: complexity O(n^2)
View the Source
t-Distributed Stochastic Neighbor Embedding (Wikipedia)
  • Credited To: Geoffrey Hinton, Intro, lead sentence
    Geoffrey Hinton
  • In Field: Machine Learning, Lead sentence
    t-distributed stochastic neighbor embedding (t-SNE) is a statistical method for visualizing high-dimensional data by giving each datapoint a location in a two or three-dimensional map.
  • In Group: Dimensionality Reduction and Matrix Factorization Algorithms, Lead
    t-distributed stochastic neighbor embedding (t-SNE) is a statistical method for visualizing high-dimensional data by giving each datapoint a location in a two or three-dimensional map.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.