Geometry of Similarity Comparisons
Not on the map. Why?
Abstract (arXiv)
Many data analysis problems can be cast as distance geometry problems in space forms -- Euclidean, spherical, or hyperbolic spaces. Often, absolute distance measurements are often unreliable or simply unavailable and only proxies to absolute distances in the form of similarities are available. Hence we ask the following: Given only comparisons of similarities amongst a set of entities, what can be said about the geometry of the underlying space form? To study this question, we introduce the notions of the textitordinal capacity of a target space form and ordinal spread of the similarity measurements. The latter is an indicator of complex patterns in the measurements, while the former quantifies the capacity of a space form to accommodate a set of measurements with a specific ordinal spread profile. We prove that the ordinal capacity of a space form is related to its dimension and the sign of its curvature. This leads to a lower bound on the Euclidean and spherical embedding dimension of what we term similarity graphs. More importantly, we show that the statistical behavior of the ordinal spread random variables defined on a similarity graph can be used to identify its underlying space form. We support our theoretical claims with experiments on weighted trees, single-cell RNA expression data and spherical cartographic measurements.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1.
3 papers.
- 2021Linear Classifiers in Product Space Formscited by 11
- 2023Principal Component Analysis in Space Formscited by 5
- 2024Signed graphs in data sciences via communicability geometrycited by 0
- 2024Signed graphs in data sciences via communicability geometry12 Mar 2024
- 2023Principal Component Analysis in Space Forms6 Jan 2023
- 2021Linear Classifiers in Product Space Forms19 Feb 2021