Abstract
In this paper, a novel operator, semantic cluster operator, was developed to overcome the low convergence performance of genetic programming in symbolic regression. The main strategy for steep convergence was to narrow search space and scrutinize the narrowed search space using a semantic cluster library. To demonstrate the success of this idea, the computation time and offspring fitness of the operator developed in this paper were compared with those of exhaustive search. The computation time of the operator was approximately 6% of that of the exhaustive search, and its offspring fitness was in the top 0.5% among all offspring derived from the exhaustive search. In two application problems, derived models from an algorithm using the operator showed high prediction accuracy comparable to an artificial neural network, random forest, and support vector machine despite its simplicity.
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.
