Abstract
In this paper, we focus on solving symbolic regression problems, in which we find functions approximating the relationships between given input and output data. Genetic Programming (GP) is often used for evolving tree structural numerical expressions. Recently, new crossover operators based on semantics of tree structures have attracted many attentions for efficient search. In the semantics-based crossover, offspring is created from its parental individuals so that the offspring can be similar to the parents not structurally but semantically. Geometric Semantic Genetic Programming (GSGP) is a method in which offspring is produced by a convex combination of two parental individuals. In order to improve the search performance of GSGP, we propose an improved Geometric Semantic Crossover utilizing the information of the target semantics. In conventional GSGP, ratios of convex combinations are determined at random. On the other hand, our proposed method can use optimal ratios for affine combinations of parental individuals. We confirmed that our method showed better performance than conventional GSGP in several symbolic regression problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
