The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
k-Nearest Neighbour Classifiers - A Tutorial
Open accessAbstract
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 runtime performance is not such a problem these days with the computational power that is available. This article 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 article is the second edition of a paper previously published as a technical report [16]. Sections on similarity measures for time-series, retrieval speedup, and intrinsic dimensionality have been added. An Appendix is included, providing access to Python code for the key methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Bagnall, A., Lines, J., Bostrom, A., Large, J., & Keogh, E. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0483-9 · Cited by 1,377
Cited by
Huang, S.-C., Pareek, A., Jensen, M., Lungren, M. P., Yeung, S., & Chaudhari, A. S. (2023) · npj Digital Medicine · doi:10.1038/s41746-023-00811-0 · Cited by 479
Stroke Risk Prediction with Machine Learning Techniques
Dritsas, E., & Trigka, M. (2022) · Sensors · doi:10.3390/s22134670 · Cited by 286
Machine Learning Applications in Agriculture: Current Trends, Challenges, and Future Perspectives
Araújo, S. O., Peres, R. S., Ramalho, J. C., Lidon, F., & Barata, J. (2023) · Agronomy · doi:10.3390/agronomy13122976 · Cited by 259
On Predicting Transitions to Compliant Surfaces in Human Gait via Neural and Kinematic Signals
Angelidou, C., & Artemiadis, P. (2023) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2023.3272355 · Cited by 19
Pluggable AI-based real-time stragglers detection framework in Hadoop
Liu, X., Li, Y., Ranjan, R., & Jha, D. N. (2026) · High-Confidence Computing · doi:10.1016/j.hcc.2025.100341 · Cited by 3
Metadata
- Authors
- Cunningham, P., & Delany, S. J.
- Venue
- ACM Computing Surveys
- Published
- 2021-07-13
- Volume
- 54
- Issue
- 6
- Pages
- 1-25
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W3015461837
- Cited by
- 942
- References
- 2
- FWCI
- 128.34
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: k-Nearest Neighbour Classifiers - A Tutorial. https://app.cochat.ai/papers/10.1145/3459665
- The paper
- Cunningham, P., & Delany, S. J. (2022). k-Nearest Neighbour Classifiers - A Tutorial. ACM Computing Surveys. https://doi.org/10.1145/3459665
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.