World Scientific
  • Search
  •   
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

SEMANTIC SEARCH TECHNIQUES FOR LEARNING SMALLER BOOLEAN EXPRESSION TREES IN GENETIC PROGRAMMING

    https://doi.org/10.1142/S1469026814500187Cited by:0 (Source: Crossref)

    One sub-field of Genetic Programming (GP) which has gained recent interest is semantic GP, in which programs are evolved by manipulating program semantics instead of program syntax. This paper introduces a new semantic GP algorithm, called SGP+, which is an extension of an existing algorithm called SGP. New crossover and mutation operators are introduced which address two of the major limitations of SGP: large program trees and reduced accuracy on high-arity problems. Experimental results on "deceptive" Boolean problems show that programs created by the SGP+ are 3.8 times smaller while still maintaining accuracy as good as, or better than, SGP. Additionally, a statistically significant improvement in program accuracy is observed for several high-arity Boolean problems.

    References

    • J. R.   Koza , Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems ( Stanford University, Department of Computer Science , 1990 ) . Google Scholar
    • M.   O'Neill et al. , Genetic Programming and Evolvable Machines   11 , 339 ( 2010 ) . CrossrefGoogle Scholar
    • A. Moraglio, K. Krawiec and C. Johnson, Geometric semantic genetic programming, Parallel Problem Solving from Nature — PPSN XII7491, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2012) pp. 21–31. Google Scholar
    • J. Lehman and K. O. Stanley, Efficiently evolving programs through the search for novelty, Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO '10 (2010) pp. 837–844. Google Scholar
    • G. Cuccu and F. Gomez, Applications of Evolutionary Computation, Lecture Notes in Computer Science 6624 (Springer, Berlin/Heidelberg, 2011) pp. 234–243. CrossrefGoogle Scholar
    • J.-B. Mouret and S. Doncieux, Using behavioral exploration objectives to solve deceptive problems in neuro-evolution, Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (2009) pp. 627–634. Google Scholar
    • D. Jackson, Promoting phenotypic diversity in genetic programming, Parallel Problem Solving from Nature, PPSN XI6239, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2010) pp. 472–481. Google Scholar
    • N. McPhee, B. Ohs and T. Hutchison, Genetic Programming, Lecture Notes in Computer Science 4971 (Springer, Berlin/Heidelberg, 2008) pp. 134–145. CrossrefGoogle Scholar
    • D. N. Phonget al., Evolving approximations for the gaussian q-function by genetic programming with semantic based crossover, IEEE Congress on Evolutionary Computation (CEC) (2012) pp. 1–6. Google Scholar
    • N. Q. Uyet al., Semantics based crossover for boolean problems, Proceedings of the 12th annual conference on Genetic and evolutionary computation, GECCO '10 (2010) pp. 869–876. Google Scholar
    • N. Q. Uyet al., Genetic Programming and Evolvable Machines 12(2), 91 (2011). CrossrefGoogle Scholar
    • K. Krawiec, On relationships between semantic diversity, complexity and modularity of programming tasks, Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference, GECCO '12 (2012) pp. 783–790. Google Scholar
    • K. Krawiec, Semantically embedded genetic programming: Automated design of abstract program representations, Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO '11 (2011) pp. 1379–1386. Google Scholar
    • K. Krawiec and B. Wieloch, Functional modularity for genetic programming, Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO '09 (2009) pp. 995–1002. Google Scholar
    • K. Krawiec and B. Wieloch, Foundation Of Computing And Decision Sciences 34(4), 265 (2009). Google Scholar
    • K. Krawiec and B. Wieloch, Automatic generation and exploitation of related problems in genetic programming, IEEE Congress on Evolutionary Computation (CEC) (2010) pp. 1–8. Google Scholar
    • A. Kattan, A. Agapitos and R. Poli, Genetic Programming, Lecture Notes in Computer Science 6021, eds. A. Esparcia-Alczaret al. (Springer, Berlin/Heidelberg, 2010) pp. 122–133. CrossrefGoogle Scholar
    • K. Krawiec, Genetic Programming, Lecture Notes in Computer Science 7244 (Springer, Berlin/Heidelberg, 2012) pp. 61–72. CrossrefGoogle Scholar
    • K. Krawiec and T. Pawlak, Locally geometric semantic crossover, Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference Companion (2012) pp. 1487–1488. Google Scholar
    • K. Krawiec and P. Lichocki, Approximating geometric crossover in semantic space, Proceedings of the 11th Annual conference on Genetic and Evolutionary Computation (2009) pp. 987–994. Google Scholar
    Remember to check out the Most Cited Articles!

    Check out these titles in artificial intelligence!