Ensemble Learning for Free with Evolutionary Algorithms ? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Ensemble Learning for Free with Evolutionary Algorithms ?


Evolutionary Learning proceeds by evolving a population of classifiers, from which it generally returns (with some notable exceptions) the single best-of-run classifier as final result. In the meanwhile, Ensemble Learning, one of the most efficient approaches in supervised Machine Learning for the last decade, proceeds by building a population of diverse classifiers. Ensemble Learning with Evolutionary Computation thus receives increasing attention. The Evolutionary Ensemble Lear\-ning (EEL) approach presented in this paper features two contributions. First, a new fitness function, inspired by co-evolution and enforcing the classifier diversity, is presented. Further, a new selection criterion based on the classification margin is proposed. This criterion is used to extract the classifier ensemble from the final population only (Off-line) or incrementally along evolution (On-line). Experiments on a set of benchmark problems show that Off-line outperforms single-hypothesis evolutionary learning and state-of-art Boosting and generates smaller classifier ensembles.
Fichier principal
Vignette du fichier
eel-gecco.pdf (166.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00144010 , version 1 (30-04-2007)


  • HAL Id : inria-00144010 , version 1
  • ARXIV : 0704.3905


Christian Gagné, Michèle Sebag, Marc Schoenauer, Marco Tomassini. Ensemble Learning for Free with Evolutionary Algorithms ?. GECCO, ACM SIGEVO, Jul 2007, London, United Kingdom. pp.1782-1789. ⟨inria-00144010⟩
233 View
260 Download



Gmail Facebook Twitter LinkedIn More