Similarity Between Points in Metric Measure Spaces

11/01/2020
by   Evgeny Dantsin, et al.
0

This paper is about similarity between objects that can be represented as points in metric measure spaces. A metric measure space is a metric space that is also equipped with a measure. For example, a network with distances between its nodes and weights assigned to its nodes is a metric measure space. Given points x and y in different metric measure spaces or in the same space, how similar are they? A well known approach is to consider x and y similar if their neighborhoods are similar. For metric measure spaces, similarity between neighborhoods is well captured by the Gromov-Hausdorff-Prokhorov distance, but it is NP-hard to compute this distance even in quite simple cases. We propose a tractable alternative: the radial distribution distance between the neighborhoods of x and y. The similarity measure based on the radial distribution distance is coarser than the similarity based on the Gromov-Hausdorff-Prokhorov distance but much easier to compute.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2023

Simplexwise Distance Distributions for finite spaces with metrics and measures

A finite set of unlabelled points in Euclidean space is the simplest rep...
research
10/07/2021

The Gromov-Hausdorff distance between ultrametric spaces: its structure and computation

The Gromov-Hausdorff distance (d_GH) provides a natural way of quantifyi...
research
08/09/2022

Universal Mappings and Analysis of Functional Data on Geometric Domains

This paper addresses problems in functional metric geometry that arise i...
research
04/13/2022

Statistical analysis of random objects via metric measure Laplacians

In this paper, we consider a certain convolutional Laplacian for metric ...
research
01/07/2022

Generalized quantum similarity learning

The similarity between objects is significant in a broad range of areas....
research
09/18/2023

On the Use of the Kantorovich-Rubinstein Distance for Dimensionality Reduction

The goal of this thesis is to study the use of the Kantorovich-Rubinstei...
research
12/05/2013

ABC-SG: A New Artificial Bee Colony Algorithm-Based Distance of Sequential Data Using Sigma Grams

The problem of similarity search is one of the main problems in computer...

Please sign up or login with your details

Forgot password? Click here to reset