4 citations · 4 across the 1 of their papers we have counts for
3 papers
cs.LG2019
Heavy-tailed kernels reveal a finer cluster structure in t-SNE visualisations
Dmitry Kobak, George Linderman, Stefan Steinerberger +2
T-distributed stochastic neighbour embedding (t-SNE) is a widely used data visualisation technique. It differs from its predecessor SNE by the low-dimensional similarity kernel: th…
math.CO2017★ 4 cited
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…
cs.LG2017
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…