Lexicographic Parsimony Pressure

title = "Lexicographic Parsimony Pressure",

booktitle = "GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference",

editor = "W. B. Langdon and E. Cant{\'u}-Paz and K. Mathias and R. Roy and D. Davis and R. Poli and K. Balakrishnan and V. Honavar and G. Rudolph and J. Wegener and L. Bull and M. A. Potter and A. C. Schultz and J. F. Miller and E. Burke and N. Jonoska",

year = "2002",

pages = "829--836",

address = "New York",

publisher_address = "San Francisco, CA 94104, USA",

month = "9-13 " # jul,

publisher = "Morgan Kaufmann Publishers",

keywords = "genetic algorithms, genetic programming, bloat, parsimony pressure",

ISBN = "1-55860-878-8",

URL = "

http://cs.gmu.edu/~sean/papers/lexicographic.pdf",

URL = "

http://cs.gmu.edu/~sean/papers/lexicographic.ps.gz",

URL = "

http://gpbib.cs.ucl.ac.uk/gecco2002/GP157.pdf",

URL = "

http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gecco2002/gecco-2002-14.pdf",

URL = "

http://citeseer.ist.psu.edu/535375.html",

abstract = "We introduce a technique called lexicographic parsimony pressure, for controlling the significant growth of genetic programming trees during the course of an evolutionary computation run. Lexicographic parsimony pressure modifies selection to prefer smaller trees only when fitnesses are equal (or equal in rank). This technique is simple to implement and is not affected by specific differences in fitness values, but only by their relative ranking. In two experiments we show that lexicographic parsimony pressure reduces tree size while maintaining good fitness values, particularly when coupled with Koza-style maximum tree depth limits.",

notes = "GECCO-2002. A joint meeting of the eleventh International Conference on Genetic Algorithms (ICGA-2002) and the seventh Annual Genetic Programming Conference (GP-2002)",