Classification in asymmetric spaces via sample compression

09/22/2019
by   Lee-Ad Gottlieb, et al.
0

We initiate the rigorous study of classification in quasi-metric spaces. These are point sets endowed with a distance function that is non-negative and also satisfies the triangle inequality, but is asymmetric. We develop and refine a learning algorithm for quasi-metrics based on sample compression and nearest neighbor, and prove that it has favorable statistical properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2017

Asymmetric Learning Vector Quantization for Efficient Nearest Neighbor Classification in Dynamic Time Warping Spaces

The nearest neighbor method together with the dynamic time warping (DTW)...
research
01/25/2019

Metric Spaces with Expensive Distances

In algorithms for finite metric spaces, it is common to assume that the ...
research
12/31/2022

Inequality for the variance of an asymmetric loss

We assume that the forecast error follows a probability distribution whi...
research
11/04/2014

Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions

Given an n-sample of random vectors (X_i,Y_i)_1 ≤ i ≤ n whose joint law ...
research
06/09/2022

Neural Bregman Divergences for Distance Learning

Many metric learning tasks, such as triplet learning, nearest neighbor r...
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
09/05/2023

Topologies for Error-Detecting Variable-Length Codes

Given a finite alphabet A, a quasi-metric d over A^*, and a non-negative...

Please sign up or login with your details

Forgot password? Click here to reset