Graph Layouts by t-SNE

dc.contributor.authorKruiger, J. F.en_US
dc.contributor.authorRauber, Paulo E.en_US
dc.contributor.authorMartins, Rafael Messiasen_US
dc.contributor.authorKerren, Andreasen_US
dc.contributor.authorKobourov, Stephenen_US
dc.contributor.authorTelea, Alexandru C.en_US
dc.contributor.editorHeer, Jeffrey and Ropinski, Timo and van Wijk, Jarkeen_US
dc.date.accessioned2017-06-12T05:22:43Z
dc.date.available2017-06-12T05:22:43Z
dc.date.issued2017
dc.description.abstractWe 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.en_US
dc.description.number3
dc.description.sectionheadersGraph Visualization
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume36
dc.identifier.doi10.1111/cgf.13187
dc.identifier.issn1467-8659
dc.identifier.pages283-294
dc.identifier.urihttps://doi.org/10.1111/cgf.13187
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13187
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.titleGraph Layouts by t-SNEen_US
Files
Collections