Graph Layouts by t-SNE

J. F. Kruiger*, P. E. Rauber, R. M. Martins, A. Kerren, S. Kobourov, A. C. Telea

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

25 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)283-294
Number of pages12
JournalCOMPUTER GRAPHICS FORUM
Volume36
Issue number3
DOIs
Publication statusPublished - Jun-2017
Event19th Eurographics/IEEE VGTC Conference on Visualization (EuroVis) - Barcelona, Spain
Duration: 12-Jun-201716-Jun-2017

Keywords

  • VISUAL ANALYSIS
  • VISUALIZATION

Cite this