A New Approach to Evaluate GP Schema in Context

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

@InProceedings{majeed:gecco05ws,

• author = "Hammad Majeed",
• title = "A New Approach to Evaluate {GP} Schema in Context",
• booktitle = "Genetic and Evolutionary Computation Conference {(GECCO2005)} workshop program",
• year = "2005",
• month = "25-29 " # jun,
• editor = "Franz Rothlauf and Misty Blowers and J{\"u}rgen Branke and Stefano Cagnoni and Ivan I. Garibay and Ozlem Garibay and J{\"o}rn Grahl and Gregory Hornby and Edwin D. {de Jong} and Tim Kovacs and Sanjeev Kumar and Claudio F. Lima and Xavier Llor{\`a} and Fernando Lobo and Laurence D. Merkle and Julian Miller and Jason H. Moore and Michael O'Neill and Martin Pelikan and Terry P. Riopka and Marylyn D. Ritchie and Kumara Sastry and Stephen L. Smith and Hal Stringer and Keiki Takadama and Marc Toussaint and Stephen C. Upton and Alden H. Wright",
• publisher = "ACM Press",
• address = "Washington, D.C., USA",
• keywords = "genetic algorithms, genetic programming",
• pages = "378--381",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco2005wks/papers/0378.pdf",
• abstract = "Evaluating GP schema in context is considered to be a complex,and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. We present a new approach to evaluate GP schema in context. It is simple in its implementation with a potential to address well-known GP problems, such as identification of significant schema, dead code (introns) and module acquisition to name a few. It is based on the principle that the contribution of a schema can be evaluated by neutralising the effect of the schema in the tree containing it (container-tree) and then checking its effect on the container-tree's fitness. Its usefulness is empirically demonstrated along with its limitation.",
• notes = "Distributed on CD-ROM at GECCO-2005. ACM 1-59593-097-3/05/0006",

}

Genetic Programming entries for Hammad Majeed

Citations