Related papers: A Cayley-Menger formula for the earth mover's simp…
We present a brief history of the construction of models of the universe, followed by calculations of quantitative characteristics of basic geometric and kinematic properties of the Standard Cosmological Model ($\Lambda$CDM). Using the…
The aim of this article is to define and compare several distances (or metrics) between operators acting on different (separable) Hilbert spaces. We consider here three main cases of how to measure the distance between two bounded…
We introduce and discuss the concept of \emph{$n$-distance}, a generalization to $n$ elements of the classical notion of distance obtained by replacing the triangle inequality with the so-called simplex inequality $$ d(x_1, \ldots,…
The word mover's distance (WMD) is a popular semantic similarity metric for two texts. This position paper studies several possible extensions of WMD. We experiment with the frequency of words in the corpus as a weighting factor and the…
The Word Mover's Distance (WMD) proposed by Kusner et al. is a distance between documents that takes advantage of semantic relations among words that are captured by their embeddings. This distance proved to be quite effective, obtaining…
The EMD algorithm, first proposed in [11], made more robust as well as more versatile in [12], is a technique that aims to decompose into their building blocks functions that are the superposition of a (reasonably) small number of…
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We investigate the querying of objects described by a…
In the d-Euclidean Distance Matrix Completion (d-EDMC) problem, one aims to determine whether a given partial matrix of pairwise distances can be extended to a full Euclidean distance matrix in d dimensions. This problem is a cornerstone of…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
In order to help physicists to expand their knowledge of the climate in the Lesser Antilles, we aim to identify the spatio-temporal configurations using clustering analysis on wind speed and cumulative rainfall datasets. But we show that…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
This paper proposes a geodesic-distance-based feature that encodes global information for improved video segmentation algorithms. The feature is a joint histogram of intensity and geodesic distances, where the geodesic distances are…
Quantifying the similarity between a group of companies has proven to be useful for several purposes, including company benchmarking, fraud detection, and searching for investment opportunities. This exercise can be done using a variety of…
Dynamic Time Warping (DTW) and Geometric Edit Distance (GED) are basic similarity measures between curves or general temporal sequences (e.g., time series) that are represented as sequences of points in some metric space $(X,…
By quantifying the distance between two collider events, one can triangulate a metric space and reframe collider data analysis as computational geometry. One popular geometric approach is to first represent events as an energy flow on an…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
The earth mover's distance is a measure of the distance between two probabilistic measures. It plays a fundamental role in mathematics and computer science. The Kantorovich-Rubinstein theorem provides a formula for the earth mover's…
The Ulam's metric is the minimal number of moves consisting in removal of one element from a permutation and its subsequent reinsertion in different place, to go between two given permutations. Thet elements that are not moved create…
The global stratification and circulation of the ocean and their sensitivities to changes in forcing depend crucially on the representation of the mesoscale eddy field. Here, a geometrically informed and energetically constrained…
Let $(X, d)$ be a compact metric space and let $\mathcal{M}(X)$ denote the space of all finite signed Borel measures on $X$. Define $I \colon \mathcal{M}(X) \to \R$ by \[ I(\mu) = \int_X \int_X d(x,y) d\mu(x) d\mu(y), \] and set $M(X) =…