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.
|Title of host publication||Theory and practice of natural computing : 5th international conference, TPNC 2016, Sendai, Japan, December 12-13, 2016, proceedings|
|Number of pages||13|
|Publication status||Published - 1 Jan 2016|
Bibliographical notePaper presented at the 5th International Conference on the Theory and Practice of Natural Computing (TPNC), Dec 12-13, 2016, Sendai, Japan.
- Adaptive grammar
- Bayesian network
- Estimation of distribution programming
- Genetic programming
WONG, P-K., WONG, M. L., & LEUNG, K-S. (2016). Learning grammar rules in probabilistic Grammar-based Genetic Programming. In Theory and practice of natural computing : 5th international conference, TPNC 2016, Sendai, Japan, December 12-13, 2016, proceedings (pp. 208-220). Springer. https://doi.org/10.1007/978-3-319-49001-4_17