Victoria University

Numerical Simplification and its Effect on Fragment Distributions in Genetic Programming

ResearchArchive/Manakin Repository

Show simple item record

dc.contributor.advisor Zhang, Mengjie
dc.contributor.author Kinzett, Alan David
dc.date.accessioned 2011-10-14T02:25:30Z
dc.date.available 2011-10-14T02:25:30Z
dc.date.copyright 2011
dc.date.issued 2011
dc.identifier.uri http://researcharchive.vuw.ac.nz/handle/10063/1863
dc.description.abstract In tree-based genetic programming (GP) there is a tendency for the program trees to increase in size from one generation to the next. If this increase in program size is not accompanied by an improvement in fitness then this unproductive increase is known as bloat. It is standard practice to place some form of control on program size. This can be done by limiting the number of nodes or the depth of the program trees, or by adding a component to the fitness function that rewards smaller programs (parsimony pressure) or by simplifying individual programs using algebraic methods. This thesis proposes a novel program simplification method called numerical simplification that uses only the range of values the nodes take during fitness evaluation. The effect of online program simplification, both algebraic and numerical, on program size and resource usage is examined. This thesis also examines the distribution of program fragments within a genetic programming population and how this is changed by using simplification. It is shown that both simplification approaches result in reductions in average program size, memory used and computation time and that numerical simplification performs at least as well as algebraic simplification, and in some cases will outperform algebraic simplification. This reduction in program size and the resources required to process the GP run come without any significant reduction in accuracy. It is also shown that although the two online simplification methods destroy some existing program fragments, they generate new fragments during evolution, which compensates for any negative effects from the disruption of existing fragments. It is also shown that, after the first few generations, the rate new fragments are created, the rate fragments are lost from the population, and the number of distinct (different) fragments in the population remain within a very narrow range of values for the remainder of the run. en_NZ
dc.language.iso en_NZ
dc.publisher Victoria University of Wellington en_NZ
dc.subject Computational intelligence en_NZ
dc.subject Genetic programming en_NZ
dc.subject Distributed artificial intelligence en_NZ
dc.title Numerical Simplification and its Effect on Fragment Distributions in Genetic Programming en_NZ
dc.type Text en_NZ
vuwschema.contributor.unit School of Engineering and Computer Science en_NZ
vuwschema.subject.marsden 280213 Other Artificial Intelligence en_NZ
vuwschema.subject.marsden 280404 Numerical Analysis (Computation Theory and Mathematics) en_NZ
vuwschema.subject.marsden 280212 Neural Networks, Genetic Algorithms and Fuzzy Logic en_NZ
vuwschema.type.vuw Awarded Research Masters Thesis en_NZ
thesis.degree.discipline Computer Science en_NZ
thesis.degree.grantor Victoria University of Wellington en_NZ
thesis.degree.level Master's en_NZ
thesis.degree.name Master of Science en_NZ
vuwschema.subject.anzsrcfor 089999 Information and Computing Sciences not elsewhere classified en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ResearchArchive


Advanced Search

Browse

My Account

Statistics