This work analyzes the problem of whether, given a classification ensemble built by Adaboost, it is possible to find a subensemble with lower generalization error. In order to solve this task a genetic algorithm is proposed and compared with other heuristics like Kappa pruning and Reduce-error pruning with backfitting. Experiments carried out over a wide variety of classification problems show that the genetic algorithm behaves better than, or at least, as well as the best of those heuristics and that subensembles with similar and sometimes better prediction accuracy can be obtained. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Hernández-Lobato, D., Hernández-Lobato, J. M., Ruiz-Torrubiano, R., & Valle, Á. (2006). Pruning adaptive boosting ensembles by means of a genetic algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4224 LNCS, pp. 322–329). Springer Verlag. https://doi.org/10.1007/11875581_39
Mendeley helps you to discover research relevant for your work.