Automatic Creation of Taxonomies of Genetic Programming Systems
A few attempts to create taxonomies in evolutionary computation have been made. These either group algorithms or group problems on the basis of their similarities. Similarity is typically evaluated by manually analysing algorithms/problems to identify key characteristics that are then used as a basis to form the groups of a taxonomy. This task is not only very tedious but it is also rather subjective. As a consequence the resulting taxonomies lack universality and are sometimes even questionable. In this paper we present a new and powerful approach to the construction of taxonomies and we apply it to Genetic Programming (GP). Only one manually constructed taxonomy of problems has been proposed in GP before, while no GP algorithm taxonomy has ever been suggested. Our approach is entirely automated and objective. We apply it to the problem of grouping GP systems with their associated parameter settings. We do this on the basis of performance signatures which represent the behaviour of each system across a class of problems. These signatures are obtained thorough a process which involves the instantiation of models of GP’s performance. We test the method on a large class of Boolean induction problems.
KeywordsGenetic Programming Boolean Function Evolutionary Computation Tournament Selection Parallel Genetic Algorithm
Unable to display preview. Download preview PDF.
- 1.Ashlock, D., Bryden, K., Corns, S.: On taxonomy of evolutionary computation problems. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, Portland, Oregon, pp. 1713–1719. IEEE Press, Los Alamitos (2004)Google Scholar
- 2.Ashlock, D.A., Bryden, K.M., Corns, S., Schonfeld, J.: An updated taxonomy of evolutionary computation problems using graph-based evolutionary algorithms. In: Yen, G.G., Wang, L., Bonissone, P., Lucas, S.M. (eds.) Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pp. 403–410. IEEE Press, Los Alamitos (2006)Google Scholar
- 5.Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Annals of Statistics (2004)Google Scholar
- 6.Graff, M., Poli, R.: Practical model of genetic programming’s performance on rational symbolic regression problems. In: O’Neill, M., Vanneschi, L., Gustafson, S., Esparcia-Alcázar, A., Falco, I.D., Cioppa, A.D., Tarantino, E. (eds.) EuroGP 2008. LNCS, vol. 4971, pp. 122–133. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 12.Martin, P.: Building a taxonomy of genetic programming. In: Spector, L., Goodman, E.D., Wu, A., Langdon, W.B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), p. 182. Morgan Kaufmann, San Francisco (2001)Google Scholar
- 13.Nowostawski, M., Poli, R.: Parallel genetic algorithm taxonomy. In: Jain, L.C. (ed.) Proceedings of the Third International conference on knowledge-based intelligent information engineering systems (KES 1999), pp. 88–92. IEEE, Los Alamitos (1999)Google Scholar
- 15.Poli, R., Logan, B.: The evolutionary computation cookbook: Recipes for designing new algorithms. In: Proceedings of the Second Online Workshop on Evolutionary Computation, Nagoya, Japan (March 1996)Google Scholar
- 18.Zhang, B.-T.: A taxonomy of control schemes for genetic code growth. In: The Workshop on Evolutionary Computation with Variable Size Representation at ICGA 1997, July 20 (1997)Google Scholar