Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 284

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Clustering with t-SNE, Provably

Open access
Linderman, George C., Steinerberger, Stefan·2019·SIAM Journal on Mathematics of Data Science

Abstract

t-distributed stochastic neighborhood embedding (t-SNE), a clustering and visualization method proposed by van der Maaten and Hinton in 2008, has rapidly become a standard tool in a number of natural sciences. Despite its overwhelming success, there is a distinct lack of mathematical foundations, and the inner workings of the algorithm are not well understood. The purpose of this paper is to prove that t-SNE is able to recover well-separated clusters; more precisely, we prove that t-SNE in the “early exaggeration” phase, an optimization technique proposed by van der Maaten and Hinton [ J. Mach. Learn. Res., 9 (2008), pp. 2579--2605] and van der Maaten [ J. Mach. Learn. Res., 15 (2014), pp. 3221--3245], can be rigorously analyzed. As a byproduct, the proof suggests novel ways for setting the exaggeration parameter $\alpha$ and step size $h$. Numerical examples illustrate the effectiveness of these rules: in particular, the quality of embedding of topological structures (e.g., the swiss roll) improves. We also discuss a connection to spectral clustering methods.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/18m1216134

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 284

Metadata

Authors
Linderman, G. C., & Steinerberger, S.
Venue
SIAM Journal on Mathematics of Data Science
Published
2019-01
Volume
1
Issue
2
Pages
313-332
ISSN
2577-0187 (ISSN-L)
OpenAlex
W2624042520
Cited by
284
References
3
FWCI
13.52
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Clustering with t-SNE, Provably. https://app.cochat.ai/papers/10.1137/18m1216134
The paper
Linderman, G. C., & Steinerberger, S. (2019). Clustering with t-SNE, Provably. SIAM Journal on Mathematics of Data Science. https://doi.org/10.1137/18m1216134

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.