Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &Amp; Data Mining 2020
DOI: 10.1145/3394486.3403224
|View full text |Cite
|
Sign up to set email alerts
|

Hyperbolic Distance Matrices

Abstract: Hyperbolic space is a natural setting for mining and visualizing data with hierarchical structure. In order to compute a hyperbolic embedding from comparison or similarity information, one has to solve a hyperbolic distance geometry problem. In this paper, we propose a unified framework to compute hyperbolic embeddings from an arbitrary mix of noisy metric and non-metric data. Our algorithms are based on semidefinite programming and the notion of a hyperbolic distance matrix, in many ways parallel to its famou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
3
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 19 publications
(21 citation statements)
references
References 43 publications
(42 reference statements)
0
20
0
Order By: Relevance
“…Note that LR embedding states that n − 1 dimensions are sufficient, but it does not state that n − 1 dimensions are necessary. Future work should explore recent advances in hyperbolic neural networks (Ganea et al, 2018) and hyperbolic distances (Tabaghi and Dokmanić, 2020) to overcome limitations of Euclidean distances.…”
Section: Discussionmentioning
confidence: 99%
“…Note that LR embedding states that n − 1 dimensions are sufficient, but it does not state that n − 1 dimensions are necessary. Future work should explore recent advances in hyperbolic neural networks (Ganea et al, 2018) and hyperbolic distances (Tabaghi and Dokmanić, 2020) to overcome limitations of Euclidean distances.…”
Section: Discussionmentioning
confidence: 99%
“…This Euclidean space's growth speed is significantly slower than embedding hierarchical data such as an r-ary tree (r ≥ 2) requires, which is exponential. To overcome this limitation, a few recent papers (Suzuki et al, 2019;Tabaghi & Dokmanic, 2020) have proposed ordinal embedding methods using hyperbolic space for hierarchical data, which we call hyperbolic ordinal embedding (HOE) in this paper. In contrast to Euclidean space's polynomial growth property, hyperbolic space has the exponential growth property, that is, the volume of any ball in hyperbolic space grows exponentially with respect to its radius (Lamping & Rao, 1994;Ritter, 1999;Nickel & Kiela, 2017).…”
Section: Proceedings Of the 38 Th International Conference On Machinementioning
confidence: 99%
“…Procrustes analysis can be performed in any metric space. In particular, hyperbolic Procrustes analysis is of great relevance due to the recent surge of interest in hyperbolic embeddings and machine learning [9][10][11][12][13][14][15][16]. Furthermore, hyperbolic embeddings are closely connected to the study of hierarchical or tree-like data structures and hyperbolic Procrustes problem solutions may be used to align hierarchical data, e.g., ontologies and phylogenies [17][18][19].…”
Section: Introductionmentioning
confidence: 99%