Graph Layouts by t-SNEShow others and affiliations
2017 (English)In: Computer graphics forum (Print), ISSN 0167-7055, E-ISSN 1467-8659, Vol. 36, no 3, p. 283-294Article in journal (Refereed) Published
Abstract [en]
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.
Place, publisher, year, edition, pages
John Wiley & Sons, 2017. Vol. 36, no 3, p. 283-294
Keywords [en]
Visualization, Graph Drawing, Information Visualization, t-SNE, Dimensionality Reduction
National Category
Computer Sciences
Research subject
Computer Science, Information and software visualization
Identifiers
URN: urn:nbn:se:lnu:diva-62137DOI: 10.1111/cgf.13187ISI: 000404881200027Scopus ID: 2-s2.0-85022223094OAI: oai:DiVA.org:lnu-62137DiVA, id: diva2:1087497
Conference
19th EG/VGTC Conference on Visualization (EuroVis '17), 12-16 June 2017, Barcelona, Spain
2017-04-072017-04-072019-08-29Bibliographically approved