ABSTRACT
Recent advances in geometric semantic genetic programming (GSGP) have shown that the results obtained by these methods can outperform those obtained by classical genetic programming algorithms, in particular in the context of symbolic regression. However, there are still many open issues on how to improve their search mechanism. One of these issues is how to get around the fact that the GSGP crossover operator cannot generate solutions that are placed outside the convex hull formed by the individuals of the current population. Although the mutation operator alleviates this problem, we cannot guarantee it will find promising regions of the search space within feasible computational time. In this direction, this paper proposes a new geometric dispersion operator that uses multiplicative factors to move individuals to less dense areas of the search space around the target solution before applying semantic genetic operators. Experiments in sixteen datasets show that the results obtained by the proposed operator are statistically significantly better than those produced by GSGP and that the operator does indeed spread the solutions around the target solution.
- J. Albinati, G. L. Pappa, F. E. B. Otero, and L. O. V. B. Oliveira. The effect of distinct geometric semantic crossover operators in regression problems. In Proc. of EuroGP, pages 3--15, 2015.Google ScholarCross Ref
- 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 Publishers, 1998. Google ScholarDigital Library
- L. Beadle and C. G. Johnson. Semantic analysis of program initialisation in genetic programming. Genetic Prog. and Evolvable Machines, 10(3):307--337, Sep 2009. Google ScholarDigital Library
- J. Botzheim, C. Cabrita, L. T. Kóczy, and A. E. Ruano. Genetic and bacterial programming for b-spline neural networks design. Journal of Advanced Computational Intelligence, 11(2):220--231, 2007.Google Scholar
- M. Castelli, S. Silva, and L. Vanneschi. A C+ framework for geometric semantic genetic programming. Genetic Prog. and Evolvable Machines, 16(1):73--81, Mar 2015. Google ScholarDigital Library
- M. Castelli, L. Trujillo, L. Vanneschi, S. Silva, E. Z-Flores, and P. Legrand. Geometric semantic genetic programming with local search. In Proc. GECCO'15, pages 999--1006. ACM, 2015. Google ScholarDigital Library
- M. Castelli, L. Vanneschi, and S. Silva. Semantic search-based genetic programming and the effect of intron deletion. Cybernetics, IEEE Trans. on, 44(1):103--113, Jan 2014.Google Scholar
- M. Castelli, L. Vanneschi, S. Silva, and S. Ruberto. How to exploit alignment in the error space: Two different GP models. In Genetic Programming Theory and Practice XII, pages 133--148. 2015.Google ScholarCross Ref
- I. Gonçalves, S. Silva, and C. M. F. Fonseca. On the generalization ability of geometric semantic genetic programming. In Proc. of EuroGP, pages 41--52, 2015.Google ScholarCross Ref
- R. L. Iman and J. M. Davenport. Approximations of the critical region of the Friedman statistic. Communications in Statistics - Theory and Methods, 9(6):571--595, 1980.Google Scholar
- J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection, volume 1. MIT Press, 1992. Google ScholarDigital Library
- M. Lichman. UCI machine learning repository, 2015. http://archive.ics.uci.edu/ml.Google Scholar
- A. Moraglio. Abstract convex evolutionary search. In Proc. of the 11th FOGA, pages 151--162, 2011. Google ScholarDigital Library
- A. Moraglio, K. Krawiec, and C. G. Johnson. Geometric semantic genetic programming. In Proc. of PPSN XII, volume 7491, pages 21--31. 2012. Google ScholarDigital Library
- J. Ni, R. H. Drieberg, and P. I. Rockett. The use of an analytic quotient operator in genetic programming. Evolutionary Computation, IEEE Trans. on, 17(1):146--152, Apr 2013. Google ScholarDigital Library
- T. P. Pawlak. Competent Algorithms for Geometric Semantic Genetic Programming. PhD thesis, Poznan University of Technology, Poznan, Poland, 2015.Google Scholar
- S. Roman. Advanced linear algebra, volume 135 of Graduate Texts in Mathematics. Springer New York, 2nd edition, 2005.Google Scholar
- S. Ruberto, L. Vanneschi, M. Castelli, and S. Silva. ESAGP - a semantic GP framework based on alignment in the error space. In Proc. of EuroGP, pages 150--161, 2014. Google ScholarDigital Library
- L. Vanneschi, M. Castelli, and S. Silva. A survey of semantic methods in genetic programming. Genetic Prog. and Evolvable Machines, 15(2):195--214, 2014. Google ScholarDigital Library
- L. Vanneschi, S. Silva, M. Castelli, and L. Manzoni. Geometric semantic genetic programming for real life applications. In R. Riolo et al., editors, Genetic Prog. Theory and Practice XI, pages 191--209. 2014.Google Scholar
- D. White, J. McDermott, M. Castelli, L. Manzoni, B. Goldman, G. Kronberger, W. Jaskowski, U. M. O'Reilly, and S. Luke. Better GP benchmarks: community survey results and proposals. Genetic Prog. and Evolvable Machines, 14(1):3--29, Mar 2013. Google ScholarDigital Library
Index Terms
A Dispersion Operator for Geometric Semantic Genetic Programming
Recommendations
Solving the exponential growth of symbolic regression trees in geometric semantic genetic programming
GECCO '18: Proceedings of the Genetic and Evolutionary Computation ConferenceAdvances in Geometric Semantic Genetic Programming (GSGP) have shown that this variant of Genetic Programming (GP) reaches better results than its predecessor for supervised machine learning problems, particularly in the task of symbolic regression. ...
A study of dynamic populations in geometric semantic genetic programming
AbstractAllowing the population size to variate during the evolution can bring advantages to evolutionary algorithms (EAs), retaining computational effort during the evolution process. Dynamic populations use computational resources wisely in ...
Cellular geometric semantic genetic programming
AbstractAmong the different variants of Genetic Programming (GP), Geometric Semantic GP (GSGP) has proved to be both efficient and effective in finding good solutions. The fact that the operators of GSGP operate on the semantics of the individuals in a ...
Comments