Grammar-based genetic programming with Bayesian network
Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
Institute of Electrical and Electronics Engineers Inc.
Grammar-Based Genetic Programming (GBGP) improves the search performance of Genetic Programming (GP) by formalizing constraints and domain specific knowledge in grammar. The building blocks (i.e. the functions and the terminals) in a program can be dependent. Random crossover and mutation destroy the dependence with a high probability, hence breeding a poor program from good programs. Understanding on the syntactic and semantic in the grammar plays an important role to boost the efficiency of GP by reducing the number of poor breeding. Therefore, approaches have been proposed by introducing context sensitive ingredients encoded in probabilistic models. In this paper, we propose Grammar-Based Genetic Programming with Bayesian Network (BGBGP) which learns the dependence by attaching a Bayesian network to each derivation rule and demonstrates its effectiveness in two benchmark problems.
Copyright © 2014 IEEE. Access to external full text or publisher's version may require subscription.
Paper presented at the IEEE Congress on Evolutionary Computation (CEC), Jul 06-11, 2014, Beijing, China.
ISBN of the source publication: 9781479914883
Wong, P.-K., L, L.-Y., Wong, M.-L., & Leung, K.-S. (2014). Grammar-based genetic programming with Bayesian network. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014 (pp.739-746). doi: 10.1109/CEC.2014.6900423