Español English Contacte con nosotros http://www.uc3m.es/portal/page/portal/biblioteca
DSpace e-Archivo

Archivo Abierto Institucional de la Universidad Carlos III de Madrid > Investigación > Departamentos > Departamento de Informática > Grupo de Computación Evolutiva y Redes Neuronales (EVANNAI) > DI - GCERN - Capítulos de Monografías >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10016/6237

Google™ Scholar. Others By: Ledezma, Agapito - Aler, Ricardo - Borrajo, Daniel
Files in This Item:
heuristic_aler_2002_ps.pdf173,06 kBAdobe PDFformato pdf
Title: Heuristic search-based stacking of classifiers
Author(s): Ledezma, Agapito
Aler, Ricardo
Borrajo, Daniel
Publisher: Idea Group Publishing
Issued date: Jan-2002
Citation: Ruhul Sarker, Hussein Abbass, Charles Newton, (eds.) Heuristic and optimization for knowledge discovery. Hersey (PA), Idea Group Publishing, 2002. P. 54-67.
URI: http://hdl.handle.net/10016/6237
ISBN: 1-93070-826-2
978-1-93070-826-6
Abstract: Currently, the combination of several classifiers is one of the most activefields within inductive learning. Examples of such techniques are boost-ing, bagging and stacking. From these three techniques, stacking isperhaps the least used one. One of the main reasons for this relates to thedifficulty to define and parameterize its components: selecting whichcombination of base classifiers to use, and which classifiers to use as themeta-classifier. The approach we present in this chapter poses thisproblem as an optimization task, and then uses optimization techniquesbased on heuristic search to solve it. In particular, we apply geneticalgorithms to automatically obtain the ideal combination of learningmethods for the stacking system.
Rights: © 2002 Idea Group Publishing
Appears in Collections:DI - GCERN - Capítulos de Monografías

Refworks Export

SFX Query

Items in E-Archivo are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! © Universidad Carlos III de Madrid - Software DSpace - Terms of use - Feedback