Distance And Similarity Measures Effect On The Performance Of K-nearest Neighbor Classifier -- A Review

Abstract

The K-nearest neighbor (KNN) classifier is one of the simplest and most common classifiers, yet its performance competes with the most complex classifiers in the literature. The core of this classifier depends mainly on measuring the distance or similarity between the tested examples and the training examples. This raises a major question about which distance measures to be used for the KNN classifier among a large number of distance and similarity measures available? This review attempts to answer this question through evaluating the performance (measured by accuracy, precision and recall) of the KNN using a large number of distance measures, tested on a number of real-world datasets, with and without adding different levels of noise. The experimental results show that the performance of KNN classifier depends significantly on the distance used, and the results showed large gaps between the performances of different distances. We found that a recently proposed non-convex distance perf

Stats

• citations499
• S2 citations—
• github stars0
• HF likes0
• heat score20.24
• arxiv keyprasath2017distance

Related papers

• On High-dimensional Modifications Of The Nearest Neighbor Classifier (2024)0.00
• Adaptive Nearest Neighbor: A General Framework For Distance Metric Learning (2019)0.00
• On Convergence Of Nearest Neighbor Classifiers Over Feature Transformations (2020)0.00
• A Fast And Easy Regression Technique For K-nn Classification Without Using Negative Pairs (2018)0.00
• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• Explaining The Success Of Nearest Neighbor Methods In Prediction (2025)18.63
• Minimax Rate Optimal Adaptive Nearest Neighbor Classification And Regression (2019)8.35
• Metric Effects Based On Fluctuations In Values Of K In Nearest Neighbor Regressor (2022)4.52