Incorporating Knowledge in Evolutionary Prototype Selection
Evolutionary algorithms has been recently used for prototype selection showing good results. An important problem in prototype selection consist in increasing the size of data sets. This problem can be harmful in evolutionary algorithms by deteriorating the convergence and increasing the time complexity. In this paper, we offer a preliminary proposal to solve these drawbacks. We propose an evolutionary algorithm that incorporates knowledge about the prototype selection problem. This study includes a comparison between our proposal and other evolutionary and non-evolutionary prototype selection algorithms. The results show that incorporating knowledge improves the performance of evolutionary algorithms and considerably reduces time execution.
KeywordsEvolutionary Algorithm Partial Evaluation Premature Convergence Local Search Procedure Instance Selection
Unable to display preview. Download preview PDF.
- Grochowski, M., Jankowski, N.: Comparison of instance selection algorithms II. Results and comments. In: ICAISC, pp. 580–585 (2004)Google Scholar
- Eshelman, L.J.: The CHC adaptative search algorithm: How to safe search when engaging in nontraditional genetic recombination. In: FOGA, pp. 265–283 (1990)Google Scholar
- Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical report, Pittsburgh, PA, USA (1994)Google Scholar
- Newman, D.J., Hettich, S., Merz, C.B.: UCI repository of machine learning databases (1998)Google Scholar
- Aha, D.W., Kibler, D., Albert, M.K.: Instance-based learning algorithms. Machine Learning 7, 37–66 (1991)Google Scholar
- Skalak, D.B.: Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: ICML, pp. 293–301 (1994)Google Scholar
- Demšar, J.: Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research 7, 1–30 (2006)Google Scholar