TMAP visualizes up to millions of high-dimensional points as an interactive 2D tree by computing an approximate nearest-neighbor graph and drawing its minimum spanning tree.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.HC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees
TMAP visualizes up to millions of high-dimensional points as an interactive 2D tree by computing an approximate nearest-neighbor graph and drawing its minimum spanning tree.