Graph Layouts by t‐SNE. (4th July 2017)

• Record Type: Journal Article
• Authors: Kruiger, J. F.; Rauber, P. E.; Martins, R. M.; Kerren, A.; Kobourov, S.; Telea, A. C.
• Is Part Of: Computer graphics forum. Volume 36:Number 3(2017)
• Page Start: 283
• Page End: 294
• Publication Date: 2017-07-04
• Subjects: Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.13187
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: We propose a new graph layout method based on a modification of the t‐distributed Stochastic Neighbor Embedding (t‐SNE) dimensionality reduction technique. Although t‐SNE is one of the best techniques for visualizing high‐dimensional data as 2D scatterplots, t‐SNE has not been used in the context of classical graph layout. We propose a new graph layout method, tsNET, based on representing a graph with a distance matrix, which together with a modified t‐SNE cost function results in desirable layouts. We evaluate our method by a formal comparison with state‐of‐the‐art methods, both visually and via established quality metrics on a comprehensive benchmark, containing real‐world and synthetic graphs. As evidenced by the quality metrics and visual inspection, tsNET produces excellent layouts.