Adaptive Fitness Functions for Dynamic Growing/Pruning of Program Trees

Created by W.Langdon from gp-bibliography.bib Revision:1.8066

@InCollection{zhang:1996:aigp2,

• author = "Byoung-Tak Zhang and Heinz M{\"u}hlenbein",
• title = "Adaptive Fitness Functions for Dynamic Growing/Pruning of Program Trees",
• booktitle = "Advances in Genetic Programming 2",
• publisher = "MIT Press",
• year = "1996",
• editor = "Peter J. Angeline and K. E. {Kinnear, Jr.}",
• pages = "241--256",
• chapter = "12",
• address = "Cambridge, MA, USA",
• keywords = "genetic algorithms, genetic programming, Occam's Razor, minimum description length (MDL), neural trees, adaptive fitness functions",
• ISBN = "0-262-01158-1",
• URL = "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6277536",
• DOI = "doi:10.7551/mitpress/1109.003.0017",
• size = "16 pages",
• abstract = "An adaptive method for fitness evaluation is described that dynamically guides genetic programming to grow and prune program trees. The method is based on the minimum description length principle and evolves parsimonious solutions while preventing premature convergence. The effectiveness of the adaptive fitness functions is shown by evolving neural programs for modelling technical and environmental systems.",

}

Genetic Programming entries for Byoung-Tak Zhang Heinz Muhlenbein

Citations