Behavioral Search Drivers for Genetic Programing
- 818 Downloads
Synthesizing a program with the desired input-output behavior by means of genetic programming is an iterative process that needs appropriate guidance. That guidance is conventionally provided by a fitness function that measures the conformance of program output with the desired output. Contrary to widely adopted stance, there is no evidence that this quality measure is the best choice; alternative search drivers may exist that make search more effective. This study proposes and investigates a new family of behavioral search drivers, which inspect not only final program output, but also program behavior meant as the partial results it arrives at while executed.
KeywordsGenetic Programing Candidate Solution Search Operator Single Point Mutation Behavioral Evaluation
Unable to display preview. Download preview PDF.
- 1.Krawiec, K., Swan, J.: Pattern-guided genetic programming. In: Blem, C., et al. (eds.) GECCO 2013: Proceeding of the Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference, Amsterdam, The Netherlands, pp. 949–956. ACM (2013)Google Scholar
- 2.Quinlan, J.: C4.5: Programs for machine learning. Morgan Kaufmann (1992)Google Scholar
- 5.Smith, R., Forrest, S., Perelson, A.: Searching for diverse, cooperative populations with genetic algorithms. Evolutionary Computation 1(2) (1993)Google Scholar
- 8.Iba, H., Sato, T., de Garis, H.: System identification approach to genetic programming. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, vol. 1, pp. 401–406. IEEE Press (1994)Google Scholar
- 10.McPhee, N.F., Ohs, B., Hutchison, T.: Semantic building blocks in genetic programming. In: O’Neill, M., Vanneschi, L., Gustafson, S., Esparcia Alcázar, A.I., De Falco, I., Della Cioppa, A., Tarantino, E. (eds.) EuroGP 2008. LNCS, vol. 4971, pp. 134–145. Springer, Heidelberg (2008)CrossRefGoogle Scholar