arXiv — Machine Learning · · 3 min read

Visualizing High-Dimensional Graph Embeddings via Informed Multi-View Projections

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2606.31119 (cs)
[Submitted on 30 Jun 2026]

Title:Visualizing High-Dimensional Graph Embeddings via Informed Multi-View Projections

Authors:Ya Ji (1), Xuefeng Li (1), Timo Brand (2), Jacob Miller (2), Peng Zhang (1), Stephen Kobourov (2), Yifan Hu (1) ((1) Khoury College of Computer Sciences, Northeastern University, Seattle, (2) School of Computation, Information and Technology, Technical University of Munich, Heilbronn, Germany)
View a PDF of the paper titled Visualizing High-Dimensional Graph Embeddings via Informed Multi-View Projections, by Ya Ji (1) and 13 other authors
View PDF HTML (experimental)
Abstract: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.
Comments: 18 pages, 13 figures
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2606.31119 [cs.LG]
  (or arXiv:2606.31119v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2606.31119
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Ya Ji [view email]
[v1] Tue, 30 Jun 2026 04:28:26 UTC (28,363 KB)
Full-text links:

Access Paper:

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:
cs

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning