%0 Unpublished Work %1 iba:1997:cfevlr %A Iba, Hitoshi %C East Lansing, MI, USA %D 1997 %K algorithms, bloat, genetic programming, representation size variable %T Complexity-based Fitness Evaluation for Variable Length Representation %U http://citeseer.ist.psu.edu/327857.html %X This paper introduces a Minimum Description Length (MDL) principle to define fitness functions in Genetic Programming (GP). In traditional (Koza-style) GP, the size of trees was usually controlled by user-defined parameters, such as the maximum number of nodes and maximum tree depth. Large tree sizes meant that the time necessary to measure their fitnesses often dominated total processing time. To overcome this difficulty, we introduce a method for controlling tree growth, which uses an...

@unpublished{iba:1997:cfevlr, abstract = {This paper introduces a Minimum Description Length (MDL) principle to define fitness functions in Genetic Programming (GP). In traditional (Koza-style) GP, the size of trees was usually controlled by user-defined parameters, such as the maximum number of nodes and maximum tree depth. Large tree sizes meant that the time necessary to measure their fitnesses often dominated total processing time. To overcome this difficulty, we introduce a method for controlling tree growth, which uses an...}, added-at = {2008-06-19T17:35:00.000+0200}, address = {East Lansing, MI, USA}, author = {Iba, Hitoshi}, biburl = {https://www.bibsonomy.org/bibtex/26e7a7202be79f3ab0122dd8d641c6762/brazovayeye}, interhash = {2558c510d7e189a62686e64e49e7db96}, intrahash = {6e7a7202be79f3ab0122dd8d641c6762}, keywords = {algorithms, bloat, genetic programming, representation size variable}, month = {20 July}, note = {Position paper at the Workshop on Evolutionary Computation with Variable Size Representation at ICGA-97}, size = {3 pages}, timestamp = {2008-06-19T17:42:03.000+0200}, title = {Complexity-based Fitness Evaluation for Variable Length Representation}, url = {http://citeseer.ist.psu.edu/327857.html}, year = 1997 }