Graph Layouts by t-SNE
| dc.contributor.author | Kruiger, J. F. | en_US |
| dc.contributor.author | Rauber, Paulo E. | en_US |
| dc.contributor.author | Martins, Rafael Messias | en_US |
| dc.contributor.author | Kerren, Andreas | en_US |
| dc.contributor.author | Kobourov, Stephen | en_US |
| dc.contributor.author | Telea, Alexandru C. | en_US |
| dc.contributor.editor | Heer, Jeffrey and Ropinski, Timo and van Wijk, Jarke | en_US |
| dc.date.accessioned | 2017-06-12T05:22:43Z | |
| dc.date.available | 2017-06-12T05:22:43Z | |
| dc.date.issued | 2017 | |
| dc.description.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. | en_US |
| dc.description.number | 3 | |
| dc.description.sectionheaders | Graph Visualization | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 36 | |
| dc.identifier.doi | 10.1111/cgf.13187 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 283-294 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13187 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13187 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.title | Graph Layouts by t-SNE | en_US |