mlsanityData to 7 Oct 2026

Balancing between the Local and Global Structures (LGS) in Graph Embedding

arXiv 2308.16403 ↗First posted 31 Aug 2023cs.HC cs.CG cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

We present a method for balancing between the Local and Global Structures (LGS) in graph embedding, via a tunable parameter. Some embedding methods aim to capture global structures, while others attempt to preserve local neighborhoods. Few methods attempt to do both, and it is not always possible to capture well both local and global information in two dimensions, which is where most graph drawing live. The choice of using a local or a global embedding for visualization depends not only on the task but also on the structure of the underlying data, which may not be known in advance. For a given graph, LGS aims to find a good balance between the local and global structure to preserve. We evaluate the performance of LGS with synthetic and real-world datasets and our results indicate that it is competitive with the state-of-the-art methods, using established quality metrics such as stress and neighborhood preservation. We introduce a novel quality metric, cluster distance preservation, to assess intermediate structure capture. All source-code, datasets, experiments and analysis are available online.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 10 of its 42 references that are in the map. First posted on arXiv 31 Aug 2023.

Builds on

10 of 42 references.

References · 10

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  2. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
  3. 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
  4. 2015Why Random Reshuffling Beats Stochastic Gradient Descentcited by 78
  5. 2021Uniform Manifold Approximation and Projection (UMAP) and its Variants: Tutorial and Surveycited by 10
  6. 2016A Sparse Stress Modelcited by 6
  7. 2020DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reductioncited by 5
  8. 2020Stochastic Gradient Descent Works Really Well for Stress Minimizationcited by 3
  9. 2022Browser-based Hyperbolic Visualization of Graphscited by 2
  10. 2022Spherical Graph Drawing by Multi-dimensional Scalingcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.