Abstract
In this study, we propose a novel pre-learning approach for genetic programming (GP) that aims to investigate the effect of the probability of being selected for each operator. Furthermore, we present a technique that combines chaos theory and searches for a relatively good possibility mapping for each operator using one-dimensional chaotic mapping. We conducted several sets of comparative experiments on real-world data to test the viability of the proposal. These experiments included comparisons with conventional GP, examination of the impact of various chaotic mappings on the proposed algorithm, and implementation of different optimization strategies to find the relative optimal probability mapping. The experimental results demonstrate that the proposed method can achieve better results than conventional GP in the tested dataset, without considering the total quantitative calculation amount. Through statistical tests, it has been proven that the proposed method is significantly different from the conventional method. However, the discussion regarding the circumstances under which the proposed method can obtain better results when the total calculation amount is limited is not yet fully explored due to the small-scale nature of the experiments. Our future studies will focus on improving and fully discussing this idea.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Vapnik, V.: Principles of risk minimization for learning theory. In: Proceedings of Advances in Neural Information Processing Systems, pp. 831–838 (1991)
Koza, J.R.: Genetic programming as a means for programming computers by natural selection. Stat. Comput. 4(2), 87–112 (1994)
Ying, B., Xue, B., Zhang, M.: A divide-and-conquer genetic programming algorithm with ensembles for image classification. IEEE Trans. Evol. Comput. 25(6), 1148–1162 (2021)
Gao, S., Yu, Y., Wang, Y., et al.: Chaotic local search-based differential evolution algorithms for optimization. IEEE Trans. Syst. Man Cybern. Syst. 51(6), 3954–3967 (2021)
Pei, Y.: Chaotic evolution: fusion of chaotic ergodicity and evolutionary iteration for optimization. Nat. Comput. 13(1), 79–96 (2014)
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. (CSUR) 35(3), 268–308 (2003)
May, R.M.: Simple mathematical models with very complicated dynamics. In: Hunt, B.R., Li, TY., Kennedy, J.A., Nusse, H.E. (eds.) Proceedings of The Theory of Chaotic Attractors, pp. 85–93. Springer, New York (2004). https://doi.org/10.1007/978-0-387-21830-4_7
Xing, H., Salleb-Aouissi, A., Verma, N.: Automated symbolic law discovery: a computer vision approach. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 1, pp. 508–515 (2021)
Lathrop, D.: Nonlinear dynamics and chaos: with applications to physics, biology, chemistry, and engineering. Phys. Today 68(4), 54 (2015)
García, S., Fernández, A., Luengo, J., Herrera, F.: Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Proc. Inform. Sci. 180(10), 2044–2064 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Cao, P., Pei, Y., Li, J. (2024). Symbolic Regression Using Genetic Programming with Chaotic Method-Based Probability Mappings. In: Hung, J.C., Yen, N., Chang, JW. (eds) Frontier Computing on Industrial Applications Volume 4. FC 2023. Lecture Notes in Electrical Engineering, vol 1134. Springer, Singapore. https://doi.org/10.1007/978-981-99-9342-0_32
Download citation
DOI: https://doi.org/10.1007/978-981-99-9342-0_32
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-9341-3
Online ISBN: 978-981-99-9342-0
eBook Packages: EngineeringEngineering (R0)