Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11875581_161 | IDEAL |
Keywords | Field | DocType |
non-evolutionary prototype selection algorithm,important problem,evolutionary algorithm,preliminary proposal,prototype selection,prototype selection problem,incorporating knowledge,time execution,time complexity,good result | Memetic algorithm,Evolutionary algorithm,Premature convergence,Computer science,Partial evaluation,Evolutionary computation,Artificial intelligence,Time complexity,Evolutionary programming,Genetic algorithm,Machine learning | Conference |
Volume | ISSN | ISBN |
4224 | 0302-9743 | 3-540-45485-3 |
Citations | PageRank | References |
0 | 0.34 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Salvador García | 1 | 1219 | 34.57 |
| José Ramón Cano | 2 | 400 | 15.64 |
| Francisco Herrera | 3 | 27391 | 1168.49 |