Abstract
This paper proposes a new expression of probabilistic tree for probabilistic model building GPs (PMBGP). Tree-structured PMBGPs estimate the probability of appearance of symbols at each node of the tree from past search information, and decide the symbol based on the probability at each node in generating a solution. The probabilistic tree is a key component of PMBGPs to keep appearance frequencies of symbols at each node by probabilistic tables, and the probabilistic prototype tree (PPT) expressed as a perfect tree has been often employed in order to include any breadth of trees. The depth of PPT is an important parameter that involves trade-off between the search accuracy and the computational cost. The appropriate depth depends on problems and is difficult to be estimated in advance. Our proposed probabilistic tree is constructed by a union operator between probabilistic trees, and its depth and breadth are extendable, so that the depth of the probabilistic tree is not required as a parameter and it needs not necessarily be a perfect tree. Through numerical experiments, we show the effectiveness of the proposed probabilistic tree by incorporating it to a local search-based crossover in symbolic regression problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sałustowicz, R.P., Jurgen Schmidhuber, J.: Probabilistic incremental program evolution. Evol. Comput. 5(2), 123–141 (1997)
Majeed, H., Ryan, C.: A less destructive, context-aware crossover operator for GP. In: Proceedings of the 9th European Conference on Genetic Programming (EuroGP), Lecture Notes in Computer Science, vol. 3905, pp. 36–48 (2006)
Hasegawa, Y., Iba, H.: A Bayesian network approach to program generation. Proc. IEEE Trans. Evol. Comput. 12(6), 750–764 (2008)
Beadle, L., Johnson, C.G.: Semantically driven crossover in genetic programming. In: Proceedings of IEEE World Congr. Comput. Intell. (WCCI), vol. 2008, pp. 111–116 (2008)
Sato, H., Hasegawa, Y., Bollegala, D., Iba, H.: Probabilistic model building GP with belief propagation. In: Proceedings of WCCI 2012 IEEE World Congress on Computational Intelligence, pp. 2089–2096 (2012)
Yanai, K., Iba, H.: Estimation of distribution programming based on Bayesian Network. In: Proceedings of Congress on Evolutionary Computation, vol. 2003, pp. 1618–1625 (2003)
Matsumura, K., Hanada, Y., Ono, K.: Probabilistic model-based multistep crossover considering dependency between nodes in tree optimization. In: Studies in Computational Intelligence book series, vol. 721, pp. 187–200 (2017)
Ikeda, K., Kobayashi, S.: Deterministic multi-step crossover fusion: a handy crossover for GAs. In: Proceeding of Parallel Problem Solving from Nature VII, pp. 162–171 (2002)
Hanada, Y., Hiroyasu, T., Miki, M.: Genetic multi-step search in interpolation and extrapolation domain. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol. 2007, pp. 1242–1249 (2007)
Nagata, Y.: New EAX crossover for large TSP instances. In: Proceedings of the Parallel Problem Solving from Nature (PPSN) IX, pp. 372–381 (2006)
Acknowledgements
This work was supported by JSPS KAKENHI Grant Number 26330290.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kumoyama, D., Hanada, Y., Ono, K. (2020). A New Probabilistic Tree Expression for Probabilistic Model Building Genetic Programming. In: Lee, R. (eds) Computational Science/Intelligence and Applied Informatics. CSII 2019. Studies in Computational Intelligence, vol 848. Springer, Cham. https://doi.org/10.1007/978-3-030-25225-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-25225-0_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25224-3
Online ISBN: 978-3-030-25225-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)