TREAD: a new genetic programming representation aimed at research of long term complexity growth

Authors:
Tony E. Lewis;George D. Magoulas
Affiliations:
Birkbeck, University of London, London, United Kngdm;Birkbeck, University of London, London, United Kngdm
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 3
Cited 0

PADO: a new learning architecture for object recognition

Symbolic visual learning
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several forms of computer program (or representation) have been proposed for Genetic Programming (GP) systems to evolve, such as linear, tree based or graph based. Typically, GP representations are highly effective during the initial search phases of evolution but stagnate before deep levels of complexity are acquired. A new representation, TREAD, is proposed to combine aspects of flow of execution and flow of data systems. The distinguishing features of TREAD are designed for researching improvements to the long term acquisition of novel features in GP (at the expense of the speed of the initial search if necessary). TREAD is validated on a symbolic regression problem and is found to be capable of successfully developing solutions through artificial evolution.