Created by W.Langdon from gp-bibliography.bib Revision:1.2031
@Article{HBE:IEETEC:06,
title = "Representation and Structural Difficulty in Genetic
Programming",
author = "Nguyen Xuan Hoai and R. I. (Bob) McKay and
Daryl Essam",
journal = "IEEE Transactions on Evolutionary Computation",
year = "2006",
volume = "10",
number = "2",
pages = "157--166",
month = apr,
keywords = "genetic algorithms, genetic programming, Deletion,
insertion, operator, representation, structural
difficulty",
URL = "
http://sc.snu.ac.kr/courses/2006/fall/pg/aai/GP/nguyen/Structdiff.pdf",
doi = "
doi:10.1109/TEVC.2006.871252",
size = "10 pages",
abstract = "Standard tree-based genetic programming suffers from a
structural difficulty problem in that it is unable to
search effectively for solutions requiring very full or
very narrow trees. This deficiency has been variously
explained as a consequence of restrictions imposed by
the tree structure or as a result of the numerical
distribution of tree shapes. We show that by using a
different tree-based representation and local
(insertion and deletion) structural modification
operators, that this problem can be almost eliminated
even with trivial (stochastic hill-climbing) search
methods, thus eliminating the above explanations. We
argue, instead, that structural difficulty is a
consequence of the large step size of the operators in
standard genetic programming, which is itself a
consequence of the fixed-arity property embodied in its
representation.",
}
Genetic Programming entries for Nguyen Xuan Hoai R I (Bob) McKay Daryl Essam