Evolutionary approach to overcome initialization parameters in classification problems

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

Abstract

The design of nearest neighbour classifiers is very dependent from some crucial parameters involved in learning, like the number of prototypes to use, the initial localization of these prototypes, and a smoothing parameter. These parameters have to be found by a trial and error process or by some automatic methods. In this work, an evolutionary approach based on Nearest Neighbour Classifier (ENNC), is described. Main property of this algorithm is that it does not require any of the above mentioned parameters. The algorithm is based on the evolution of a set of prototypes that can execute several operators in order to increase their quality in a local sense, and emerging a high classification accuracy for the whole classifier. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Isasi, P., & Fernandez, F. (2003). Evolutionary approach to overcome initialization parameters in classification problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2686, 254–261. https://doi.org/10.1007/3-540-44868-3_33

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