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.
| Originalsprache | Englisch |
|---|---|
| Titel | Lecture Notes in Computer Science |
| Herausgeber*innen | R. Moreno-Diaz, F.R. Pichler, A. Quesada-Arencibia |
| Seitenumfang | 7 |
| Publikationsstatus | Veröffentlicht - 2017 |
Wissenschaftszweige
- 102 Informatik
- 102001 Artificial Intelligence
- 102011 Formale Sprachen
- 102022 Softwareentwicklung
- 102031 Theoretische Informatik
- 603109 Logik
- 202006 Computer Hardware
JKU-Schwerpunkte
- Computation in Informatics and Mathematics
Dieses zitieren
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver