Abstract
The genetic programming (GP) search method can often vary greatly in the quality of solution derived from one run to the next. As a result, it is often the case that a number of runs must be performed to ensure that an effective solution is found. This paper introduces several methods which attempt to better utilise the computational resources spent on performing a number of independent GP runs. Termed metasearch strategies, these methods seek to search the space of evolving GP populations in an attempt to focus computational resources on those populations which are most likely to yield competitive solutions.
Two meta-search strategies are introduced and evaluated over a set of classification problems. The meta-search strategies are termed a pyramid search strategy and a population beam search strategy. Additional to these methods, a combined approach using properties of both the pyramid and population beam search methods is evaluated.
Over a set of five classification problems, results show that meta-search strategies can substantially improve the accuracy of solutions over those derived by a set of independent GP runs. In particular the combined approach is demonstrated to give more accurate classification performance whilst requiring less time to train than a set of independent GP runs, making this method a promising approach for problems for which multiple GP runs must be performed to ensure a quality solution.
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
Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone. Genetic Programming-An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, dpunkt.verlag, January 1998.
C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.
Erick Cantu-Paz. Topologies, migration rates, and multi-population parallel genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 91–98, Orlando, Florida, USA, 13–17 July 1999. Morgan Kaufmann.
F. Fernandez, M. Tomassini, W. F. Punch III, and J. M. Sanchez. Experimental study of multipopulation parallel genetic programming. In Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 283–293, Edinburgh, 15–16 April 2000. Springer-Verlag.
Matthias Fuchs. Large populations are not always the best choice in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1033–1038, Orlando, Florida, USA, 13–17 July 1999. Morgan Kaufmann.
Chris Gathercole and Peter Ross. Small populations over many generations can beat large populations over few generations in genetic programming. In Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 111–118, Stanford University, CA, USA, 13–16 July 1997. Morgan Kaufmann.
John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
Thomas Loveard and Vic Ciesielski. Genetic programming for classification: An analysis of convergence behaviour. Lecture Notes in Computer Science, 2557:309–320, 2002.
Thomas Loveard and Victor Ciesielski. Representing classification problems in genetic programming. In Proceedings of the Congress on Evolutionary Computation, volume 2, pages 1070–1077, COEX, Seoul, Korea, 27–30 May 2001. IEEE Press.
Thomas Loveard and Victor Ciesielski. Employing nominal attributes in classification using genetic programming. In Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL02), volume 2, pages 487–491, Orchid Country Club, Singapore, 2002.
Sean Luke. When short runs beat long runs. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 74–80, San Francisco, California, USA, 7–11 July 2001. Morgan Kaufmann.
Louis Steinberg and Khaled Rasheed. Optimization by searching a tree of populations. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1723–1730, Orlando, Florida, USA, 13–17 July 1999. Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loveard, T. (2003). Genetic Programming with Meta-search: Searching for a Successful Population within the Classification Domain. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive