Graph Exploration with Embedding-Guided Layouts
Leixian Shen, Zhiwei Tai, Enya Shen, and Jianmin Wang

TL;DR
This paper introduces GEGraph, a flexible embedding-guided graph layout method that combines graph topology and node attributes for improved visualization, exploration, and community preservation.
Contribution
It presents a novel embedding-based pipeline and layout algorithm that effectively integrates aesthetic and exploration goals in graph visualization.
Findings
GEGraph achieves better community preservation in layouts.
The method supports flexible graph exploration with Focus+Context interactions.
Quantitative and qualitative evaluations validate the approach.
Abstract
Node-link diagrams are widely used to visualize graphs. Most graph layout algorithms only use graph topology for aesthetic goals (e.g., minimize node occlusions and edge crossings) or use node attributes for exploration goals (e.g., preserve visible communities). Existing hybrid methods that bind the two perspectives still suffer from various generation restrictions (e.g., limited input types and required manual adjustments and prior knowledge of graphs) and the imbalance between aesthetic and exploration goals. In this paper, we propose a flexible embedding-based graph exploration pipeline to enjoy the best of both graph topology and node attributes. First, we leverage embedding algorithms for attributed graphs to encode the two perspectives into latent space. Then, we present an embedding-driven graph layout algorithm, GEGraph, which can achieve aesthetic layouts with better community…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Visualization and Analytics · Complex Network Analysis Techniques · Innovative Human-Technology Interaction
