Algebraic Simplification of Genetic Programs during Evolution
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @TechReport{vuw-CS-TR-06-7,
-
author = "Phillip Wong and Mengjie Zhang",
-
title = "Algebraic Simplification of Genetic Programs during
Evolution",
-
institution = "Computer Science, Victoria University of Wellington",
-
year = "2006",
-
number = "CS-TR-06-7",
-
address = "New Zealand",
-
month = feb,
-
keywords = "genetic algorithms, genetic programming, Algebraic
Simplification, Program Simplification, Code Bloating,
Online Simplification",
-
URL = "http://www.mcs.vuw.ac.nz/comp/Publications/archive/CS-TR-06/CS-TR-06-7.pdf",
-
URL = "http://www.mcs.vuw.ac.nz/comp/Publications/CS-TR-06-7.abs.html",
-
abstract = "Program bloat is a fundamental problem in the field of
Genetic Programming (GP). Exponential growth of
redundant and functionally useless sections of programs
can quickly overcome a GP system, exhausting system
resources and causing premature termination of the
system before an acceptable solution can be found.
Simplification is an attempt to remove such
redundancies from programs. This paper looks at the
effects of applying an algebraic simplification
algorithm to programs during the GP evolution. The GP
system with the simplification is examined and compared
to a standard GP system on four regression and
classification problems of varying difficulty. The
results suggest that the GP system employing a
simplification component can achieve superior
efficiency and effectiveness to the standard system on
these problems.",
- }
Genetic Programming entries for
Phillip Wong
Mengjie Zhang
Citations