Balancing between the local and global structures (LGS) in graph embedding
From MaRDI portal
Publication:6560154
DOI10.1007/978-3-031-49272-3_18MaRDI QIDQ6560154FDOQ6560154
Authors: Jacob Miller, Vahan Huroyan, Stephen G. Kobourov
Publication date: 21 June 2024
dimensionality reductiongraph embeddinggraph visualizationmulti-dimensional scalinglocal and global structures
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- The University of Florida sparse matrix collection
- Visualizing data using t-SNE
- Principal component analysis.
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Title not available (Why is that?)
- Local multidimensional scaling for nonlinear dimension reduction, graph drawing, and proximity analysis
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- An algorithm for drawing general undirected graphs
- Graph Drawing
- Untangling the hairballs of multi-centered, small-world online social media networks
- A sparse stress model
- Stochastic Gradient Descent Works Really Well for Stress Minimization
This page was built for publication: Balancing between the local and global structures (LGS) in graph embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560154)