Visualizing High-Dimensional Graph Embeddings via Informed Multi-View Projections
Graphs are commonly visualized in 2D, where humans readily interpret spatial relationships, yet such layouts often distort higher-dimensional structure. We propose to embed graphs in high-dimensional space and search for informative 2D viewpoints that optimize aesthetic and readability metrics (e.g., edge crossings and angular resolution), enabled by a novel differentiable surrogate for edge crossings. Numerical experiments show that these viewpoints consistently outperform standard 2D layouts, and can even surpass methods explicitly designed to optimize these metrics. We further introduce DataFly, an interactive system for exploring multiple candidate viewpoints through seamless navigation. A usability study demonstrates that our approach reveals structural patterns that remain hidden in conventional 2D visualizations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Rashomon Effect for Visualizing High-Dimensional Data
Dimension reduction (DR) is inherently non-unique: multiple embeddings can preserve the structure of high-dimensional data equally well while differing in layout or geometry. In this paper, we formally define the Rashomo…
Attraction-Repulsion Spectrum in Neighbor Embeddings
Neighbor embeddings are a family of methods for visualizing complex high-dimensional datasets using $k$NN graphs. To find the low-dimensional embedding, these algorithms combine an attractive force between neighboring pa…
ViDa: Visualizing DNA hybridization trajectories with biophysics-informed deep graph embeddings
Visualization tools can help synthetic biologists and molecular programmers understand the complex reactive pathways of nucleic acid reactions, which can be designed for many potential applications and can be modelled us…
Dimensionality ReductionUnsupervised visualization of image datasets using contrastive learning
Visualization methods based on the nearest neighbor graph, such as t-SNE or UMAP, are widely used for visualizing high-dimensional data. Yet, these approaches only produce meaningful results if the nearest neighbors them…
Contrastive LearningData AugmentationVisualizing Loss Functions as Topological Landscape Profiles
In machine learning, a loss function measures the difference between model predictions and ground-truth (or target) values. For neural network models, visualizing how this loss changes as model parameters are varied can …
Image SegmentationSemantic SegmentationTopological Data Analysis