This work has the aim of exploring the area of symbolic regression problems by means of Genetic Programming. It is known that symbolic regression is a widely used method for mathematical function approximation. Previous works based on Genetic Programming have already dealt with this problem, but considering Koza's GP approach. This paper introduces a novel GP encoding based on multi-branches. In order to show the use of the proposed multi-branches representation, a set of testing equations has been selected. Results presented in this paper show the advantages of using this novel multibranches version of GP.
CITATION STYLE
Morales, C. O., & Vázquez, K. R. (2004). Symbolic regression problems by genetic programming with multi-branches. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2972, pp. 717–726). https://doi.org/10.1007/978-3-540-24694-7_74
Mendeley helps you to discover research relevant for your work.