A simple powerful constraint for genetic programming

Gearoid Murphy, Conor Ryan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper demonstrates the ability of Hereditary Repulsion to perform well on a range of diverse problem domains. Furthermore, we show that HR is practically invulnerable to the effects to overfitting and does not suffer a loss of generalisation, even in the late stages of evolution. We trace the source of this high quality performance to a pleasingly simple constraint at the heart of the HR algorithm. We confirm its effectiveness by incorporating the constraint into one of the benchmark systems, observing substantial improvements in the quality of generalisation in the evolved population.

Original languageEnglish
Title of host publicationGenetic Programming - 11th European Conference, EuroGP 2008, Proceedings
Pages146-157
Number of pages12
DOIs
Publication statusPublished - 2008
Event11th European Conference on Genetic Programming, EuroGP 2008 - Naples, Italy
Duration: 26 Mar 200828 Mar 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4971 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th European Conference on Genetic Programming, EuroGP 2008
Country/TerritoryItaly
CityNaples
Period26/03/0828/03/08

Fingerprint

Dive into the research topics of 'A simple powerful constraint for genetic programming'. Together they form a unique fingerprint.

Cite this