Deakin University
Browse

Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications

Download (2.79 MB)
journal contribution
posted on 2024-08-20, 01:15 authored by Rajib Kumar Halder, Mohammed Nasir Uddin, Md Ashraf UddinMd Ashraf Uddin, Sunil AryalSunil Aryal, Ansam KhraisatAnsam Khraisat
AbstractThe 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

History

Related Materials

Location

Berlin, Germany

Open access

  • Yes

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Journal

Journal of Big Data

Volume

11

Article number

113

Pagination

1-55

ISSN

2196-1115

eISSN

2196-1115

Issue

1

Publisher

Springer

Usage metrics

    Research Publications

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC