Analysis of schema frequencies in genetic programming

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Genetic Programming (GP) schemas are structural templates equivalent to hyperplanes in the search space. Schema theories provide information about the properties of subsets of the population and the behavior of genetic operators. In this paper we propose a practical methodology to identify relevant schemas and measure their frequency in the population. We demonstrate our approach on an artificial symbolic regression benchmark where the parts of the formula are already known. Experimental results reveal how solutions are assembled within GP and explain diversity loss in GP populations through the proliferation of repeated patterns.

Cite

CITATION STYLE

APA

Burlacu, B., Affenzeller, M., Kommenda, M., Kronberger, G., & Winkler, S. (2018). Analysis of schema frequencies in genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10671 LNCS, pp. 432–438). Springer Verlag. https://doi.org/10.1007/978-3-319-74718-7_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free