Spherical Graph Drawing by Multi-dimensional Scaling

09/01/2022
by   Jacob Miller, et al.
0

We describe an efficient and scalable spherical graph embedding method. The method uses a generalization of the Euclidean stress function for Multi-Dimensional Scaling adapted to spherical space, where geodesic pairwise distances are employed instead of Euclidean distances. The resulting spherical stress function is optimized by means of stochastic gradient descent. Quantitative and qualitative evaluations demonstrate the scalability and effectiveness of the proposed method. We also show that some graph families can be embedded with lower distortion on the sphere, than in Euclidean and hyperbolic spaces.

READ FULL TEXT

page 1

page 4

page 6

page 11

page 17

page 19

page 20

research
07/08/2021

Accelerating Spherical k-Means

Spherical k-means is a widely used clustering algorithm for sparse and h...
research
03/02/2010

A Unified Algorithmic Framework for Multi-Dimensional Scaling

In this paper, we propose a unified algorithmic framework for solving ma...
research
08/06/2020

Local biplots for multi-dimensional scaling, with application to the microbiome

We present local biplots, a an extension of the classic principal compon...
research
10/12/2017

Graph Drawing by Stochastic Gradient Descent

A popular method of force-directed graph drawing is multidimensional sca...
research
08/17/2021

Limitations on Realistic Hyperbolic Graph Drawing

We show that several types of graph drawing in the hyperbolic plane requ...
research
04/03/2019

Hyperbolic Image Embeddings

Computer vision tasks such as image classification, image retrieval and ...
research
09/04/2023

Interactive Design and Optics-Based Visualization of Arbitrary Non-Euclidean Kaleidoscopic Orbifolds

Orbifolds are a modern mathematical concept that arises in the research ...

Please sign up or login with your details

Forgot password? Click here to reset