Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances

09/22/2017
by   Timothy Chu, et al.
0

Some researchers have proposed using non-Euclidean metrics for clustering data points. Generally, the metric should recognize that two points in the same cluster are close, even if their Euclidean distance is far. Multiple proposals have been suggested, including the Edge-Squared Metric (a specific example of a graph geodesic) and the Nearest Neighbor Metric. In this paper, we prove that the edge-squared and nearest-neighbor metrics are in fact equivalent. Previous best work showed that the edge-squared metric was a 3-approximation of the Nearest Neighbor metric. This paper represents one of the first proofs of equating a continuous metric with a discrete metric, using non-trivial discrete methods. Our proof uses the Kirszbraun theorem (also known as the Lipschitz Extension Theorem and Brehm's Extension Theorem), a notable theorem in functional analysis and computational geometry. The results of our paper, combined with the results of Hwang, Damelin, and Hero, tell us that the Nearest Neighbor distance on i.i.d samples of a density is a reasonable constant approximation of a natural density-based distance function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2017

Intrinsic Metrics: Exact Equality between a Geodesic Metric and a Graph metric

Some researchers have proposed using non-Euclidean metrics for clusterin...
research
06/14/2010

Penalized K-Nearest-Neighbor-Graph Based Metrics for Clustering

A difficult problem in clustering is how to handle data with a manifold ...
research
09/22/2016

Large Margin Nearest Neighbor Classification using Curved Mahalanobis Distances

We consider the supervised classification problem of machine learning in...
research
09/28/2018

On Locality-Sensitive Orderings and their Applications

For any constant d and parameter ε > 0, we show the existence of (roughl...
research
10/21/2021

How can classical multidimensional scaling go wrong?

Given a matrix D describing the pairwise dissimilarities of a data set, ...
research
05/30/2019

Learning Nearest Neighbor Graphs from Noisy Distance Samples

We consider the problem of learning the nearest neighbor graph of a data...
research
08/14/2017

Distance and Similarity Measures Effect on the Performance of K-Nearest Neighbor Classifier - A Review

The K-nearest neighbor (KNN) classifier is one of the simplest and most ...

Please sign up or login with your details

Forgot password? Click here to reset