Empirical Evaluation of the Difficulty of Finding a Good Value of k for the Nearest Neighbor
|Author||Ferrer Troyano, Francisco J.
Aguilar Ruiz, Jesús Salvador
Riquelme Santos, José Cristóbal
|Department||Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos|
|Published in||Computational Science — ICCS 2003, Lecture Notes in Computer Science, Volume 2658, pp 766-773 (2003)|
|Document type||Chapter of Book|
|Abstract||As an analysis of the classification accuracy bound for the Nearest Neighbor technique, in this work we have studied if it is possible to find a good value of the parmeter k for each example according to their attribute values. Or at least, if there is a pattern for the parameter k in the original search space. We have carried out different approaches based onthe Nearest Neighbor technique and calculated the prediction accuracy for a group of databases from the UCI repository. Based on the experimental results of our study, we can state that, in general, it is not possible to know a priori a specific value of k to correctly classify an unseen example.|