Abstract
This paper proposes a new tree-generation algorithm for grammarguided genetic programming that includes a parameter to control the maximum size of the trees to be generated. An important feature of this algorithm is that the initial populations generated are adequately distributed in terms of tree size and distribution within the search space. Consequently, genetic programming systems starting from the initial populations generated by the proposed method have a higher convergence speed. Two different problems have been chosen to carry out the experiments: a laboratory test involving searching for arithmetical equalities and the real-world task of breast cancer prognosis. In both problems, comparisons have been made to another five important initialization methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Koza JR. Genetically Breeding Populations of Computer Programs to Solve Problems in Artificial Intelligence. Tech. Rep. CS-TR-90-1314, Department of Computer Science, Stanford University, 1990
Langdon WB, Poli R. Foundations of Genetic Programming. Springer-Verlag, London, UK, 2001
Luke S. Two Fast Tree-Creation Algorithms for Genetic Programming. IEEE Trans, on Evolutionary Computation 2000; 4, 3: 274–283
Koza JR, Keane MA, Streeter MJ, et al. Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, Norwell, MA, 2005
Whigham PA. Grammatically-Based Genetic Programming. In: Rosea JP (ed) Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications. Tahoe City, California, USA, 1995, pp 33–41
Koza JR. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992
Luke S, Panait L. A Survey and Comparison of Tree Generation Algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, CA, USA, 2001, pp 81–88
Chellapilla K. Evolving Computer Programs without Subtree Crossover. IEEE Transactions on Evolutionary Computation 1997; 1,3: 209–216
Hao HT, Hoai NX, McKay RB. Does This Matter Where to Start in Grammar Guided Genetic Programming?. In: Proceedings of the 2nd Pacific Asian Workshop in Genetic Programming, Cairns, Australia, 2004 (Electronic)
Böhm W, Geyer-Schulz A. Exact Uniform Initialization for Genetic Programming. In: Belew RK, Bose M (ed) Foundations of Genetic Algorithms IV, Morgan Kaufmann, University of San Diego, CA, USA, 1996, pp 379–407
Manrique D, Marquez F, Rios J, Rodriguez-Patön A. Grammar Based Crossover Operator in Genetic Programming. In: Mira J, Alvarez JR (ed): Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. Springer-Verlag, New York, 2005, pp 252–261 (Lecture notes in computer science no. 3562)
Barrios D, Carrascal A, Manrique D, Rios J. Optimization with Real-Coded Genetic Algorithms Based on Mathematical Morphology. Intern J Computer Math 2003; 8, 3: 275–293
Geyer-Schulz A. Fuzzy Rule-Based Expert Systems and Genetic Machine Learning, vol 3. Springer-Verlag, New York, 1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag London Limited
About this paper
Cite this paper
García-Arnau, M., Manrique, D., Ríos, J., Rodríguez-Patón, A. (2007). Initialization Method for Grammar-Guided Genetic Programming. In: Bramer, M., Coenen, F., Tuson, A. (eds) Research and Development in Intelligent Systems XXIII. SGAI 2006. Springer, London. https://doi.org/10.1007/978-1-84628-663-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-84628-663-6_3
Publisher Name: Springer, London
Print ISBN: 978-1-84628-662-9
Online ISBN: 978-1-84628-663-6
eBook Packages: Computer ScienceComputer Science (R0)