Graph Layouts by t-SNE

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

Research output: Contribution to journalArticle

18 Scopus citations

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 (US)
Pages (from-to)283-294
Number of pages12
JournalComputer Graphics Forum
Volume36
Issue number3
DOIs
StatePublished - Jun 2017

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Graph Layouts by t-SNE'. Together they form a unique fingerprint.

  • Cite this

    Kruiger, J. F., Rauber, P. E., Martins, R. M., Kerren, A., Kobourov, S., & Telea, A. C. (2017). Graph Layouts by t-SNE. Computer Graphics Forum, 36(3), 283-294. https://doi.org/10.1111/cgf.13187