On High-dimensional Modifications Of The Nearest Neighbor Classifier

Abstract

Nearest neighbor classifier is arguably the most simple and popular nonparametric classifier available in the literature. However, due to the concentration of pairwise distances and the violation of the neighborhood structure, this classifier often suffers in high-dimension, low-sample size (HDLSS) situations, especially when the scale difference between the competing classes dominates their location difference. Several attempts have been made in the literature to take care of this problem. In this article, we discuss some of these existing methods and propose some new ones. We carry out some theoretical investigations in this regard and analyze several simulated and benchmark datasets to compare the empirical performances of proposed methods with some of the existing ones.

Stats

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

Related papers

• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• Adaptive Nearest Neighbor: A General Framework For Distance Metric Learning (2019)0.00
• Finding Relevant Points For Nearest-neighbor Classification (2021)4.52
• Fast And Bayes-consistent Nearest Neighbors (2019)0.00
• On Convergence Of Nearest Neighbor Classifiers Over Feature Transformations (2020)0.00
• Explaining The Success Of Nearest Neighbor Methods In Prediction (2025)18.63
• Distance And Similarity Measures Effect On The Performance Of K-nearest Neighbor Classifier -- A Review (2017)20.24
• Exploring The Meaningfulness Of Nearest Neighbor Search In High-dimensional Space (2024)2.26