NAREDO, Enrique; TRUJILLO, Leonardo; LEGRAND, Pierrick; SILVA, Sara; MUNOZ, Luis

doi:10.1016/j.ins.2016.06.044

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

NAREDO, Enrique
Instituto Tecnológico de Tijuana = Tijuana Institute of Technology [Tijuana]

TRUJILLO, Leonardo
Instituto Tecnológico de Tijuana = Tijuana Institute of Technology [Tijuana]

LEGRAND, Pierrick
Institut de Mathématiques de Bordeaux [IMB]
Quality control and dynamic reliability [CQFD]

Langue

Article de revue

Ce document a été publié dans

Information Sciences. 2016-11-10, vol. 369, p. 347–367

Elsevier

Résumé en anglais

Novelty Search (NS) is a unique approach towards search and optimization, where an explicit objective function is replaced by a measure of solution novelty. However, NS has been mostly used in evolutionary robotics while its usefulness in classic machine learning problems has not been explored. This work presents a NS-based genetic programming (GP) algorithm for supervised classification. Results show that NS can solve real-world classification tasks, the algorithm is validated on real-world benchmarks for binary and multiclass problems. These results are made possible by using a domain-specific behavior descriptor. Moreover, two new versions of the NS algorithm are proposed, Probabilistic NS (PNS) and a variant of Minimal Criteria NS (MCNS). The former models the behavior of each solution as a random vector and eliminates all of the original NS parameters while reducing the computational overhead of the NS algorithm. The latter uses a standard objective function to constrain and bias the search towards high performance solutions. The paper also discusses the effects of NS on GP search dynamics and code growth. Results show that NS can be used as a realistic alternative for supervised classification, and specifically for binary problems the NS algorithm exhibits an implicit bloat control ability.< Réduire