Locally Adaptive Nearest Neighbors

11/08/2020

∙

When training automated systems, it has been shown to be beneficial to adapt the representation of data by learning a problem-specific metric. This metric is global. We extend this idea and, for the widely used family of k nearest neighbors algorithms, develop a method that allows learning locally adaptive metrics. To demonstrate important aspects of how our approach works, we conduct a number of experiments on synthetic data sets, and we show its usefulness on real-world benchmark data sets.

READ FULL TEXT

Locally Adaptive Nearest Neighbors

A Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification

k*-Nearest Neighbors: From Global to Local

Finding Nearest Neighbors in graphs locally

DD-EbA: An algorithm for determining the number of neighbors in cost estimation by analogy using distance distributions

Comparing K-Nearest Neighbors and Potential Energy Method in classification problem. A case study using KNN applet by E.M. Mirkes and real life benchmark data sets

Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Sets

Clustered Hierarchical Entropy-Scaling Search of Astronomical and Biological Data

Locally Adaptive Nearest Neighbors

Related Research

A Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification

k*-Nearest Neighbors: From Global to Local

Finding Nearest Neighbors in graphs locally

DD-EbA: An algorithm for determining the number of neighbors in cost estimation by analogy using distance distributions

Comparing K-Nearest Neighbors and Potential Energy Method in classification problem. A case study using KNN applet by E.M. Mirkes and real life benchmark data sets

Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Sets

Clustered Hierarchical Entropy-Scaling Search of Astronomical and Biological Data