Abstract
In this contribution we investigate the evolution of operators for Genetic Programming by means of Genetic Programming. Metaevolution of recombination operators in graph-based GP is applied and compared to other methods for the variation of recombination operators in graph-based GP. We demonstrate that a straightforward application of recombination operators onto themselves does not work well. After introducing an additional level of recombination operators (the meta level) which are recombining a pool of recombination operators, even self-recombination on the additional level becomes feasible.We show that the overall performance of this system is better than in other variants of graph GP. As a test problem we use speaker recognition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P.J. Angeline. Multiple interacting programs: A representation for evolving complex behaviors. Cybernetics and Systems, 1998.
Th. Bäck. Self-adaptation. In Th. Bäck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, page C7.1. IOP Publishing, Bristol and Oxford Univ. Press, New York, 1997.
M. Brameier, P. Dittrich, W. Kantschik, and W. Banzhaf. SYSGP-A C++ library of different GP variants. Technical Report Internal Report of SFB 531,ISSN 1433-3325, Fachbereich Informatik, Universität Dortmund, 1998.
W. Banzhaf, P. Nordin, R. Keller, and F. Francone. Genetic Programming-An Introduction On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, San Francisco and dpunkt.verlag, Heidelberg, 1998.
B. Edmonds. Meta-genetic programming: Co-evolving the operators of variation. CPM Report 98-32, Manchester Metropolitan University, 1998.
R.A. Finan, A.T. Sapeluk, and R.I. Damper. VQ score normalisation for text-dependent and text-independent speaker recognition. In Audio-and Video-based Biometric Person Authentication, pages 211–218. First International Conference, AVBPA’97, 1997.
J. Koza. Genetic Programming. MIT Press, 1992.
J. Koza. Genetic Programming II. MIT Press, 1994.
J. P. Nordin. A Compiling Genetic Programming System that Directly Manipulates the Machinecode. Cambridge, MIT Press, 1994.
R. Poli. Some steps towards a form of parallel distributed genetic programming. In The 1st Online Workshop on Soft Computing (WSC1), http://www.bioele.nuee.nagoya-u.ac.jp/wsc1/, 19–30 August 1996. Nagoya University, Japan.
A.E. Rosenberg and F.K. Soong. Evaluation of a vector quantization talker recognition system in text independent and text dependent modes. Proc. ICASSP, pages 873–876, 1986.
A.E. Rosenberg and F.K. Soong. On the use of instantaneous and transitional spectral information in speaker recognition. Proc. ICASSP, pages 877–880, 1986.
H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie (Inderdisciplinary Systems Research 26). Birkhäuser, Basel, 1977.
H.-P. Schwefel. Evolution and Optimum Seeking. John Wiley & Sons, Inc., 1996.
A. Teller. Evolving programmers: The co-evolution of intelligent recombination operators. In P. Angeline and K. Kinnear, editors, Advances in Genetic Programming II. MIT Press, 1996.
A. Teller and M. Veloso. Pado: A new learning architecture for object recognition. In Symbolic Visual Learning, pages 81–116. Oxford University Press, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kantschik, W., Dittrich, P., Brameier, M., Banzhaf, W. (1999). Meta-Evolution in Graph GP. In: Poli, R., Nordin, P., Langdon, W.B., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1999. Lecture Notes in Computer Science, vol 1598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48885-5_2
Download citation
DOI: https://doi.org/10.1007/3-540-48885-5_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65899-3
Online ISBN: 978-3-540-48885-9
eBook Packages: Springer Book Archive