607 citations · 625 across the 4 of their papers we have counts for
3 papers · 1 filter
Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding
George C. Linderman, Manas Rachh, Jeremy G. Hoskins +2
t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for dimensionality reduction and visualization that has become widely popular in recent years. Efficient impleme…
Randomized Near Neighbor Graphs, Giant Components, and Applications in Data Science
George C. Linderman, Gal Mishne, Yuval Kluger +1
If we pick random points uniformly in and connect each point to its nearest neighbors, then it is well known that there exists a giant connected component with hi…
Clustering with t-SNE, provably
George C. Linderman, Stefan Steinerberger
t-distributed Stochastic Neighborhood Embedding (t-SNE), a clustering and visualization method proposed by van der Maaten & Hinton in 2008, has rapidly become a standard tool in a…