- author = "Jason M. Daida and Adam M. Hilss",
- title = "Identifying Structural Mechanisms in Standard Genetic Programming",
- booktitle = "Genetic and Evolutionary Computation -- GECCO-2003",
- editor = "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and R. Standish and G. Kendall and S. Wilson and M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and A. C. Schultz and K. Dowsland and N. Jonoska and J. Miller",
- year = "2003",
- pages = "1639--1651",
- address = "Chicago",
- publisher_address = "Berlin",
- month = "12-16 " # jul,
- volume = "2724",
- series = "LNCS",
- ISBN = "3-540-40603-4",
- publisher = "Springer-Verlag",
- keywords = "genetic algorithms, genetic programming, theory, Binary Tree, Mathematical Entity, Symbolic Regression, Tree Shape",
-
URL = "
http://sitemaker.umich.edu/daida/files/LNCS2724lattice.pdf",
-
DOI = "
doi:10.1007/3-540-45110-2_58",
- size = "13 pages",
- abstract = "hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an unintended consequence of using trees as information structures. A model is described that predicts outcomes in GP that would arise solely from such mechanisms. Comparisons with empirical results from GP lend support to the existence of these mechanisms.",
-
notes = "GECCO-2003. A joint meeting of the twelfth
International Conference on Genetic Algorithms
(ICGA-2003) and the eighth Annual Genetic Programming
Conference (GP-2003).
Also known as \cite{daida:2003:gecco}",
