Accelerating t-SNE using tree-based algorithms
Ускорение t-SNE с использованием алгоритмов на основе деревьев
2014-01-01
SCID: 54.1/dh7t6q8e
Discuss with AI
Barnes-Hut algorithmdual-tree algorithmhigh-dimensional data visualizationt-SNEtree-based algorithms
Figures from the paper
Abstract (AI)
The paper investigates the acceleration of t-SNE—an embedding technique that is com-monly 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 em-beddings 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.
Key Findings
1
Both tree-based algorithms substantially accelerate t-SNE compared with the standard approach.
2
Despite expectations, the Barnes–Hut t-SNE variant empirically outperforms the dual-tree variant.
3
The accelerated methods enable learning t-SNE embeddings for datasets containing millions of objects.
4
The paper develops Barnes–Hut and dual-tree variants of t-SNE that approximate its learning gradient in O(N log N).
Research Object
t-SNE embedding of high-dimensional data
Research Subject
Acceleration of t-SNE gradient computation and embedding learning using tree-based approximation algorithms
Publication Details
Publication Date
2014-01-01
Journal
Publisher
ISSN
Cited by
2226
Access Type
Author Information
Download PDF
Subscribe to digest
References available in scid.ai4
Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation2014
Software survey: VOSviewer, a computer program for bibliometric mapping2009
Learning Multiple Layers of Features from Tiny Images2024
Improving neural networks by preventing co-adaptation of feature detectors2012
Cited by14
EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks2019
Molecular, spatial, and functional single-cell profiling of the hypothalamic preoptic region2018
The art of using t-SNE for single-cell transcriptomics2019
Interpretable machine learning: Fundamental principles and 10 grand challenges2022
A systematic literature review of methods and datasets for anomaly-based network intrusion detection2022
Clustering with t-SNE, Provably2019
Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMAP, and PaCMAP for Data Visualization2020
Deep Learning for Accurate Diagnosis of Liver Tumor Based on Magnetic Resonance Imaging and Clinical Data2020
t-viSNE: Interactive Assessment and Interpretation of t-SNE Projections2020
Visualizing Time-Dependent Data Using Dynamic t-SNE2016
Theoretical Foundations of t-SNE for Visualizing High-Dimensional Clustered Data2021
Graph Layouts by t‐SNE2017
Laplacian-based Cluster-Contractive t-SNE for High-Dimensional Data Visualization2023
Federated t-SNE and UMAP for Distributed Data Visualization2025