%0 Generic %1 harries:1998:cgediass %A Harries, K. %A Smith, P. W. H. %D 1998 %K Bloat, Introns, Parsimony algorithms, genetic programming, %T Code Growth, Explicitly Defined Introns and Alternative Selection Schemes %U http://citeseer.ist.psu.edu/harries98code.html %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 behaviour, and it is shown that though introns do create code growth they are not the only cause of it and removing them merely decreases the growth rate, not eliminates it. By systematically negating various forms of intron behaviour 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 methods in terms of both performance and parsimony.

@misc{harries: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 behaviour, and it is shown that though introns do create code growth they are not the only cause of it and removing them merely decreases the growth rate, not eliminates it. By systematically negating various forms of intron behaviour 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 methods in terms of both performance and parsimony.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Harries, K. and Smith, P. W. H.}, biburl = {https://www.bibsonomy.org/bibtex/296641c02988a861eaca25546c1aa8f84/brazovayeye}, howpublished = {www}, interhash = {8939591f82f57536c3e267434e282533}, intrahash = {96641c02988a861eaca25546c1aa8f84}, keywords = {Bloat, Introns, Parsimony algorithms, genetic programming,}, note = {Earlier version of Evolutionary Computation 6 (4), 336-360, 1998}, notes = {Final version is \cite{PWHSmith:1998:cgediass}}, size = {26 pages}, timestamp = {2008-06-19T17:41:00.000+0200}, title = {Code Growth, Explicitly Defined Introns and Alternative Selection Schemes}, url = {http://citeseer.ist.psu.edu/harries98code.html}, year = 1998 }