Empirical Analysis of GP Tree-Fragments

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

@InProceedings{eurogp07:smart,

• author = "Will Smart and Peter Andreae and Mengjie Zhang",
• title = "Empirical Analysis of GP Tree-Fragments",
• editor = "Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar",
• booktitle = "Proceedings of the 10th European Conference on Genetic Programming",
• publisher = "Springer",
• series = "Lecture Notes in Computer Science",
• volume = "4445",
• year = "2007",
• address = "Valencia, Spain",
• month = "11-13 " # apr,
• pages = "55--67",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "3-540-71602-5",
• isbn13 = "978-3-540-71602-0",
• DOI = "doi:10.1007/978-3-540-71605-1_6",
• abstract = "Researchers have attempted to explain the power of Genetic Programming (GP) search using various notions of schema. However empirical studies of schemas have been limited due to their vast numbers in typical populations. This paper addresses the problem of analysing schemas represented by tree-fragments. It describes a new efficient way of representing the huge sets of fragments in a population of GP programs and presents an algorithm to find all fragments using this efficient representation. Using this algorithm, the paper presents an initial analysis of fragments in populations of up to 300 programs, each up to seven nodes deep. The analysis demonstrates a surprisingly large variation in the numbers of fragments through evolution and a non-monotonic rise in the most useful fragments. With his method, empirical investigation of the GP building block hypothesis and schema theory in realistic sized GP systems becomes possible.",
• notes = "Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007",

}

Genetic Programming entries for Will Smart Peter Andreae Mengjie Zhang

Citations