Tournament Selection Based on Statistical Test in Genetic Programming
Selection plays a critical role in the performance of evolutionary algorithms. Tournament selection is often considered the most popular techniques among several selection methods. Standard tournament selection randomly selects several individuals from the population and the individual with the best fitness value is chosen as the winner. In the context of Genetic Programming, this approach ignores the error value on the fitness cases of the problem emphasising relative fitness quality rather than detailed quantitative comparison. Subsequently, potentially useful information from the error vector may be lost. In this paper, we introduce the use of a statistical test into selection that utilizes information from the individual’s error vector. Two variants of tournament selection are proposed, and tested on Genetic Programming for symbolic regression problems. On the benchmark problems examined we observe a benefit of the proposed methods in reducing code growth and generalisation error.
KeywordsGenetic Programming Tournament selection Statistical test
This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.01-2014.09. MON acknowledges the support of Science Foundation Ireland grant 13/IA/1850.
- 1.Altenberg, L.: The evolution of evolvability in genetic programming. In: Advances in Genetic Programming, pp. 47–74. MIT Press (1994)Google Scholar
- 2.Bache, K., Lichman, M.: UCI machine learning repository (2013). http://archive.ics.uci.edu/ml
- 3.Bäck, T.: Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. In: Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 57–62. IEEE Press, Piscataway (1994)Google Scholar
- 5.Cumming, G.: Understanding The New Statistics: Effect Sizes, Confidence Intervals, and Meta-Analysis. Routledge, New York (2012)Google Scholar
- 7.Gathercole, C.: An investigation of supervised learning in genetic programming. Ph.D. thesis. University of Edinburgh (1998)Google Scholar
- 9.Kim, J.J., Zhang, B.T.: Effects of selection schemes in genetic programming for time series prediction. Proc. Congr. Evol. Comput. 1, 252–258 (1999)Google Scholar
- 15.Sokolov, A., Whitley, D.: Unbiased tournament selection. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation, pp. 1131–1138. ACM, New York (2005)Google Scholar
- 18.Xie, H., Zhang, M., Andreae, P., Johnston, M.: Is the not-sampled issue in tournament selection critical? In: IEEE World Congress on Computational Intelligence, pp. 3710–3717, June 2008Google Scholar
- 19.Xie, H., Zhang, M., Andreae, P.: Automatic selection pressure control in genetic programming. In: Yang, B., Chen, Y. (eds.) 6th International Conference on Intelligent System Design and Applications, pp. 435–440. IEEE (2006)Google Scholar
- 20.Xie, H., Zhang, M., Andreae, P., Johnson, M.: An analysis of multi-sampled issue and no-replacement tournament selection. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008, pp. 1323–1330. ACM, New York (2008)Google Scholar