DMCA
Complexity Compression and Evolution (1995)
| Venue: | Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95 |
| Citations: | 154 - 19 self |
BibTeX
@INPROCEEDINGS{Nordin95complexitycompression,
author = {Peter Nordin and Wolfgang Banzhaf and Fachbereich Informatik and Fachbereich Informatik and Lehrstuhl Fur Systemanalyse and Lehrstuhl Fur Systemanalyse},
title = {Complexity Compression and Evolution},
booktitle = {Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95},
year = {1995},
pages = {310--317},
publisher = {Morgan Kaufmann}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Compression of information is an important concept in the theory of learning. We argue for the hypothesis that there is an inherent compression pressure towards short, elegant and general solutions in a genetic programming system and other variable length evolutionary algorithms. This pressure becomes visible if the size or complexity of solutions are measured without non-effective code segments called introns. The built in parsimony pressure effects complex fitness functions, crossover probability, generality, maximum depth or length of solutions, explicit parsimony, granularity of fitness function, initialization depth or length, and modularization. Some of these effects are positive and some are negative. In this work we provide a basis for an analysis of these effects and suggestions to overcome the negative implications in order to obtain the balance needed for successful evolution. An empirical investigation that supports our hypothesis is also presented. 1 Introduction The prin...
Keyphrases
complexity compression inherent compression pressure towards genetic programming system empirical investigation crossover probability initialization depth fitness function explicit parsimony negative implication non-effective code segment variable length evolutionary algorithm successful evolution maximum depth general solution important concept
