inria-00144010, version 1
Ensemble Learning for Free with Evolutionary Algorithms ?
Christian Gagné a, 1Michèle Sebag
b, 2Marc Schoenauer
c, 2Marco Tomassini d, 3
GECCO (2007) 1782-1789
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.
- a – Informatique WGZ Inc.
- b – CNRS
- c – INRIA
- d – Université de Lausanne
- 1: Informatique WGZ Inc. (INFORMATIQUE WGZ INC.)
- Informatique WGZ Inc.
- 2: TAO (INRIA Futurs)
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- 3: Information Systems Institute (ISI)
- Université de Lausanne
- Domain : Computer Science/Artificial Intelligence
- Keywords : Evolutionary Computation – Ensemble Learning
- inria-00144010, version 1
- http://hal.inria.fr/inria-00144010
- oai:hal.inria.fr:inria-00144010
- From: Marc Schoenauer
- Submitted on: Monday, 30 April 2007 10:35:17
- Updated on: Sunday, 14 October 2007 09:10:09






Associated documents

Export