Improving the k-nearest neighbour rule by an evolutionary voting approach

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work presents an evolutionary approach to modify the voting system of the k-Nearest Neighbours (kNN). The main novelty of this article lies on the optimization process of voting regardless of the distance of every neighbour. The calculated real-valued vector through the evolutionary process can be seen as the relative contribution of every neighbour to select the label of an unclassified example. We have tested our approach on 30 datasets of the UCI repository and results have been compared with those obtained from other 6 variants of the kNN predictor, resulting in a realistic improvement statistically supported. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

García-Gutiérrez, J., Mateos-García, D., & Riquelme-Santos, J. C. (2014). Improving the k-nearest neighbour rule by an evolutionary voting approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8480 LNAI, pp. 296–305). Springer Verlag. https://doi.org/10.1007/978-3-319-07617-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free