Abstract
Developmental Genetic Programming (DGP) algorithms have been introduced where the search space for a problem is divided into genotypes and corresponding phenotypes that are connected by a mapping (or “genetic code”). Current implementations of this concept involve evolution of the mappings in addition to the traditional evolution of genotypes. We introduce the latest version of Probabilistic Adaptive Mapping DGP (PAM DGP), a robust and highly customizable algorithm that overcomes performance problems identified for the latest competing adaptive mapping algorithm. PAM DGP is then shown to outperform the competing algorithm on two non-trivial regression benchmarks.
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.
