Skip to Main content Skip to Navigation
New interface
Conference papers

Genetic Programming, Validation Sets, and Parsimony Pressure

Christian Gagné 1, 2, 3 Marc Schoenauer 1 Marc Parizeau 2 Marco Tomassini 3 
1 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited number of samples. This paper is an investigation on two methods to improve generalization in GP-based learning: 1) the selection of the best-of-run individuals using a three data sets methodology, and 2) the application of parsimony pressure in order to reduce the complexity of the solutions. Results using GP in a binary classification setup show that while the accuracy on the test sets is preserved, with less variances compared to baseline results, the mean tree size obtained with the tested methods is significantly reduced.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Christian Gagné Connect in order to contact the contributor
Submitted on : Wednesday, January 11, 2006 - 4:08:48 PM
Last modification on : Thursday, September 1, 2022 - 8:44:06 AM
Long-term archiving on: : Saturday, April 3, 2010 - 9:12:13 PM




Christian Gagné, Marc Schoenauer, Marc Parizeau, Marco Tomassini. Genetic Programming, Validation Sets, and Parsimony Pressure. EuroGP 2006, Apr 2006, Budapest, Hongrie. ⟨inria-00000996⟩



Record views


Files downloads