.png){kind=icon}
Return
Challenges in KNN Classification
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2021.3049250.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The KNN algorithm is one of the most popular data mining algorithms. It has been widely and successfully applied to data analysis applications across a variety of research topics in computer science. This paper illustrates that, despite its success, there remain many challenges in KNN classification, including K computation, nearest neighbor selection, nearest neighbor search and classification rules. Having established these issues, recent approaches to their resolution are examined in more detail, thereby providing a potential roadmap for ongoing KNN-related research, as well as some new classification rules regarding how to tackle the issue of training sample imbalance. To evaluate the proposed approaches, some experiments were conducted with 15 UCI benchmark datasets.
Keywords:
Training
Nearest neighbor methods
Data mining
Prediction algorithms
Training data
Partitioning algorithms
Licenses
Data mining
lazy learning
KNN classification
classification rule
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more