The DOI matches its Crossref record; 86 of the 86 references it cites were found in a registry or an index.
Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications
Open accessAbstract
The k-Nearest Neighbors (kNN) method, established in 1951, has since evolved into a pivotal tool in data mining, recommendation systems, and Internet of Things (IoT), among other areas. This paper presents a comprehensive review and performance analysis of modifications made to enhance the exact kNN techniques, particularly focusing on kNN Search and kNN Join for high-dimensional data. We delve deep into 31 kNN search methods and 12 kNN join methods, providing a methodological overview and analytical insight into each, emphasizing their strengths, limitations, and applicability. An important feature of our study is the provision of the source code for each of the kNN methods discussed, fostering ease of experimentation and comparative analysis for readers. Motivated by the rising significance of kNN in high-dimensional spaces and a recognized gap in comprehensive surveys on exact kNN techniques, our work seeks to bridge this gap. Additionally, we outline existing challenges and present potential directions for future research in the domain of kNN techniques, offering a holistic guide that amalgamates, compares, and dissects existing methodologies in a coherent manner. Graphical Abstract
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
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Wold, S., Esbensen, K., & Geladi, P. (1987) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(87)80084-9 · Cited by 11,606
Abdi, H., & Williams, L. J. (2010) · WIREs Computational Statistics · doi:10.1002/wics.101 · Cited by 11,104
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
OpenMP: an industry standard API for shared-memory programming
Dagum, L., & Menon, R. (1998) · IEEE Computational Science and Engineering · doi:10.1109/99.660313 · Cited by 3,343
Product Quantization for Nearest Neighbor Search
Jégou, H., Douze, M., & Schmid, C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.57 · Cited by 2,956
Sorting networks and their applications
Batcher, K. E. (1968) · Proceedings of the April 30--May 2, 1968, spring joint computer conference on - AFIPS '68 (Spring) · doi:10.1145/1468075.1468121 · Cited by 2,417
Cited by
Darvishvand, L., Kamkari, B., Huang, M. J., & Hewitt, N. J. (2025) · Sustainable Cities and Society · doi:10.1016/j.scs.2025.106492 · Cited by 42
A Hybrid Artificial Intelligence Framework for Melanoma Diagnosis Using Histopathological Images
Nogales, A., Garrido, M. C., Guitian, A., Rodriguez-Peralto, J.-L., Villanueva, C. P., Díaz-Prieto, D., & García-Tejedor, Á. J. (2025) · Technologies · doi:10.3390/technologies13080330 · Cited by 7
A Deep Model Framework for Morphological Trait Imputation Across Taxonomic Groups
Wang, Y., Shi, X., Bai, Y., Zhu, H., Yin, X., Song, P., Ergu, D., Zhang, T., Pan, S., Gu, Z., et al. (2026) · Integrative Zoology · doi:10.1111/1749-4877.70178
Metadata
- Authors
- Halder, R. K., Uddin, M. N., Uddin, M. A., Aryal, S., & Khraisat, A.
- Venue
- Journal of Big Data
- Published
- 2024-08-11
- Volume
- 11
- Issue
- 1
- ISSN
- 2196-1115 (ISSN-L)
- OpenAlex
- W4401495975
- Cited by
- 520
- References
- 86
- FWCI
- 96.17
- Type
- journal article
- Language
- en
- Open access
- gold
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: Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications. https://app.cochat.ai/papers/10.1186/s40537-024-00973-y
- The paper
- Halder, R. K., Uddin, M. N., Uddin, M. A., Aryal, S., & Khraisat, A. (2024). Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications. Journal of Big Data. https://doi.org/10.1186/s40537-024-00973-y
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.