Options
Learning grammar rules in probabilistic grammar-based genetic programming
Date Issued
2016
ISBN
978-3-319-49001-4
978-3-319-49000-7
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10071 LNCS, pp. 208-220
Type
Conference Paper
Abstract
Grammar-based Genetic Programming (GBGP) searches for a computer program in order to solve a given problem. Grammar constrains the set of possible programs in the search space. It is not obvious to write an appropriate grammar for a complex problem. Our proposed Bayesian Grammar-Based Genetic Programming with Hierarchical Learning (BGBGP-HL) aims at automatically designing new rules from existing relatively simple grammar rules during evolution to improve the grammar structure. The new grammar rules also reflects the new understanding of the existing grammar under the given fitness evaluation function. Based on our case study in asymmetric royal tree problem, our evaluation shows that BGBGP-HL achieves the best performance among the competitors. Compared to other algorithms, search performance of BGBGP-HL is demonstrated to be more robust against dependencies and the changes in complexity of programs.
Loading...
Availability at HKSYU Library
