K-nearest Neighbour Classifiers: 2nd Edition (with Python Examples)

Abstract

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier -- classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance because issues of poor run-time performance is not such a problem these days with the computational power that is available. This paper presents an overview of techniques for Nearest Neighbour classification focusing on; mechanisms for assessing similarity (distance), computational issues in identifying nearest neighbours and mechanisms for reducing the dimension of the data. This paper is the second edition of a paper previously published as a technical report. Sections on similarity measures for time-series, retrieval speed-up and intrinsic dimensionality have been added. An Appendix is included providing access to Python code for the key methods.

Stats

• citations719
• S2 citations—
• github stars0
• HF likes0
• heat score21.43
• arxiv keycunningham2020k

Related papers

• On High-dimensional Modifications Of The Nearest Neighbor Classifier (2024)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
• Fast Nearest-neighbor Classification Using RNN In Domains With Large Number Of Classes (2017)0.00
• Adaptive Nearest Neighbor: A General Framework For Distance Metric Learning (2019)0.00
• A Two-stage Active Learning Algorithm For \(k\)-nearest Neighbors (2022)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