Improving Sampling-Based t-SNE Performance Using Dijkstra’s Algorithm for Approximate Distance Computation
F. Markov (TU Delft - Electrical Engineering, Mathematics and Computer Science)
M. Skrodzki – Mentor (TU Delft - Computer Graphics and Visualisation)
K.A. Hildebrandt – Mentor (TU Delft - Computer Graphics and Visualisation)
C. Lofi – Graduation committee member (TU Delft - Web Information Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
T-SNE is widely used for visualising high-dimensional data in lower dimensions.
To reduce the costs of parameter optimisation, t-SNE is performed on a sample of the original data. After sampling the points, the distances between them need to be calculated, which is expensive due to the high dimensionality of the data. We apply Dijkstra's algorithm to approximate the distances and similarities between the sampled points. This reduces the algorithm's execution time by up to 40% without degrading the quality of the projections.