Skip to Main content Skip to Navigation
Conference papers

Ensemble Learning for Free with Evolutionary Algorithms ?

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00144010
Contributor : Marc Schoenauer <>
Submitted on : Monday, April 30, 2007 - 10:35:17 AM
Last modification on : Thursday, March 5, 2020 - 6:33:16 PM
Long-term archiving on: : Wednesday, April 7, 2010 - 1:16:50 AM

Files

eel-gecco.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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⟩

Share

Metrics

Record views

558

Files downloads

1100