Maaten, L. van den: Accelerating t-SNE using Tree-Based Algorithms (2014)
0.00
0.0029132022 = product of:
0.011652809 = sum of:
0.011652809 = product of:
0.046611235 = sum of:
0.046611235 = weight(_text_:based in 3886) [ClassicSimilarity], result of:
0.046611235 = score(doc=3886,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.3295462 = fieldWeight in 3886, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0546875 = fieldNorm(doc=3886)
0.25 = coord(1/4)
0.25 = coord(1/4)
- Abstract
- The paper investigates the acceleration of t-SNE-an embedding technique that is commonly used for the visualization of high-dimensional data in scatter plots-using two tree-based algorithms. In particular, the paper develops variants of the Barnes-Hut algorithm and of the dual-tree algorithm that approximate the gradient used for learning t-SNE embeddings in O(N*logN). Our experiments show that the resulting algorithms substantially accelerate t-SNE, and that they make it possible to learn embeddings of data sets with millions of objects. Somewhat counterintuitively, the Barnes-Hut variant of t-SNE appears to outperform the dual-tree variant.
