Please use this identifier to cite or link to this item:
Title: On the Design of an ECOC-Compliant Genetic Algorithm
Author: Bautista Martín, Miguel Ángel
Escalera Guerrero, Sergio
Pujol Vila, Oriol
Baró i Solé, Xavier
Keywords: Algorismes genètics
Genetic algorithms
Issue Date: 1-Aug-2014
Publisher: Elsevier Ltd
Abstract: Genetic Algorithms (GA) have been previously applied to Error-Correcting Output Codes (ECOC) in state-of-the-art works in order to find a suitable coding matrix. Nevertheless, none of the presented techniques directly take into account the properties of the ECOC matrix. As a result the considered search space is unnecessarily large. In this paper, a novel Genetic strategy to optimize the ECOC coding step is presented. This novel strategy redefines the usual crossover and mutation operators in order to take into account the theoretical properties of the ECOC framework. Thus, it reduces the search space and lets the algorithm to converge faster. In addition, a novel operator that is able to enlarge the code in a smart way is introduced. The novel methodology is tested on several UCI datasets and four challenging computer vision problems. Furthermore, the analysis of the results done in terms of performance, code length and number of Support Vectors shows that the optimization process is able to find very efficient codes, in terms of the trade-off between classification performance and the number of classifiers. Finally, classification performance per dichotomizer results shows that the novel proposal is able to obtain similar or even better results while defining a more compact number of dichotomies and SVs compared to state-of-the-art approaches.
Note: Versió postprint del document publicat a:
It is part of: Pattern Recognition, 2014, vol. 47, num. 2, p. 865-884
Related resource:
ISSN: 0031-3203
Appears in Collections:Articles publicats en revistes (Matemàtiques i Informàtica)

Files in This Item:
File Description SizeFormat 
626763.pdf1.79 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.