Adaptive Nearest Neighbor: A General Framework For Distance Metric Learning

Abstract

\(K\)-NN classifier is one of the most famous classification algorithms, whose performance is crucially dependent on the distance metric. When we consider the distance metric as a parameter of \(K\)-NN, learning an appropriate distance metric for \(K\)-NN can be seen as minimizing the empirical risk of \(K\)-NN. In this paper, we design a new type of continuous decision function of the \(K\)-NN classification rule which can be used to construct the continuous empirical risk function of \(K\)-NN. By minimizing this continuous empirical risk function, we obtain a novel distance metric learning algorithm named as adaptive nearest neighbor (ANN). We have proved that the current algorithms such as the large margin nearest neighbor (LMNN), neighbourhood components analysis (NCA) and the pairwise constraint methods are special cases of the proposed ANN by setting the parameter different values. Compared with the LMNN, NCA, and pairwise constraint methods, our method has a broader searching sp

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keysong2019adaptive

Related papers

• Minimax Rate Optimal Adaptive Nearest Neighbor Classification And Regression (2019)8.35
• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• An Adaptive Nearest Neighbor Rule For Classification (2019)0.00
• Feasibility Based Large Margin Nearest Neighbor Metric Learning (2016)0.00
• On High-dimensional Modifications Of The Nearest Neighbor Classifier (2024)0.00
• A Fast And Easy Regression Technique For K-nn Classification Without Using Negative Pairs (2018)0.00
• Interpretable Locally Adaptive Nearest Neighbors (2020)3.58
• A Multilabel Classification Framework For Approximate Nearest Neighbor Search (2019)0.00