Previous work on introns and code growth in genetic
programming is expanded on and tested experimentally.
Explicitly defined introns are introduced to tree-based
representations as an aid to measuring and evaluating
intron behavior. Although it is shown that introns do
create code growth, they are not its only cause.
Removing introns merely decreases the growth rate; it
does not eliminate it. By systematically negating
various forms of intron behavior, a deeper
understanding of the causes of code growth is obtained,
leading to the development of a system that keeps
unnecessary bloat to a minimum. Alternative selection
schemes and recombination operators are examined and
improvements demonstrated over the standard selection
methods in terms of both performance and parsimony.
Evolutionary Computation (Journal)
Special Issue: Variable-Length Representation and
Noncoding Segments for Evolutionary Algorithms Edited
by Annie S. Wu and Wolfgang Banzhaf Early version
available as harries:1998:cgediass
%0 Journal Article
%1 PWHSmith:1998:cgediass
%A Smith, Peter W. H.
%A Harries, Kim
%D 1998
%J Evolutionary Computation
%K algorithms, bloat, encoding fitness genetic introns, linear parsimony, programming, selection,
%N 4
%P 339--360
%R doi:10.1162/evco.1998.6.4.339
%T Code Growth, Explicitly Defined Introns, and
Alternative Selection Schemes
%U http://www.mitpressjournals.org/doi/pdfplus/10.1162/evco.1998.6.4.339
%V 6
%X Previous work on introns and code growth in genetic
programming is expanded on and tested experimentally.
Explicitly defined introns are introduced to tree-based
representations as an aid to measuring and evaluating
intron behavior. Although it is shown that introns do
create code growth, they are not its only cause.
Removing introns merely decreases the growth rate; it
does not eliminate it. By systematically negating
various forms of intron behavior, a deeper
understanding of the causes of code growth is obtained,
leading to the development of a system that keeps
unnecessary bloat to a minimum. Alternative selection
schemes and recombination operators are examined and
improvements demonstrated over the standard selection
methods in terms of both performance and parsimony.
@article{PWHSmith:1998:cgediass,
abstract = {Previous work on introns and code growth in genetic
programming is expanded on and tested experimentally.
Explicitly defined introns are introduced to tree-based
representations as an aid to measuring and evaluating
intron behavior. Although it is shown that introns do
create code growth, they are not its only cause.
Removing introns merely decreases the growth rate; it
does not eliminate it. By systematically negating
various forms of intron behavior, a deeper
understanding of the causes of code growth is obtained,
leading to the development of a system that keeps
unnecessary bloat to a minimum. Alternative selection
schemes and recombination operators are examined and
improvements demonstrated over the standard selection
methods in terms of both performance and parsimony.},
added-at = {2008-06-19T17:46:40.000+0200},
author = {Smith, Peter W. H. and Harries, Kim},
biburl = {https://www.bibsonomy.org/bibtex/26387a60139231648d73d7f389a133c04/brazovayeye},
doi = {doi:10.1162/evco.1998.6.4.339},
interhash = {8939591f82f57536c3e267434e282533},
intrahash = {6387a60139231648d73d7f389a133c04},
journal = {Evolutionary Computation},
keywords = {algorithms, bloat, encoding fitness genetic introns, linear parsimony, programming, selection,},
month = {Winter},
notes = {Evolutionary Computation (Journal)
Special Issue: Variable-Length Representation and
Noncoding Segments for Evolutionary Algorithms Edited
by Annie S. Wu and Wolfgang Banzhaf Early version
available as \cite{harries:1998:cgediass}},
number = 4,
pages = {339--360},
size = {23 pages},
timestamp = {2008-06-19T17:51:52.000+0200},
title = {Code Growth, Explicitly Defined Introns, and
Alternative Selection Schemes},
url = {http://www.mitpressjournals.org/doi/pdfplus/10.1162/evco.1998.6.4.339},
volume = 6,
year = 1998
}