Recovering metric from full ordinal information

06/11/2015
by   Thibaut Le Gouic, et al.
0

Given a geodesic space (E, d), we show that full ordinal knowledge on the metric d-i.e. knowledge of the function D d : (w, x, y, z) → 1 d(w,x)<d(y,z) , determines uniquely-up to a constant factor-the metric d. For a subspace En of n points of E, converging in Hausdorff distance to E, we construct a metric dn on En, based only on the knowledge of D d on En and establish a sharp upper bound of the Gromov-Hausdorff distance between (En, dn) and (E, d).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/17/2020

Geometry of Comparisons

Many data analysis problems can be cast as distance geometry problems in...
research
02/23/2016

Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis

In recent years it has become popular to study machine learning problems...
research
02/27/2019

Ordinal Distance Metric Learning with MDS for Image Ranking

Image ranking is to rank images based on some known ranked images. In th...
research
11/28/2022

Angular triangle distance for ordinal metric learning

Deep metric learning (DML) aims to automatically construct task-specific...
research
06/30/2016

Ordering as privileged information

We propose to accelerate the rate of convergence of the pattern recognit...
research
03/01/2023

Controlling Class Layout for Deep Ordinal Classification via Constrained Proxies Learning

For deep ordinal classification, learning a well-structured feature spac...
research
07/13/2023

Towards Ordinal Data Science

Order is one of the main instruments to measure the relationship between...

Please sign up or login with your details

Forgot password? Click here to reset