LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Oliveira, Luiz O.V.B.; Otero, Fernando E.B.; Pappa, Gisele L. (2016)
Publisher: ACM Press
Languages: English
Types: Unknown
Subjects: QA76
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.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] 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.
    • [2] 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.
    • [3] 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.
    • [4] J. Botzheim, C. Cabrita, L. T. Ko´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.
    • [5] 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.
    • [6] 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.
    • [7] 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.
    • [8] 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.
    • [9] I. Gonc¸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.
    • [10] 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.
    • [11] J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection, volume 1. MIT Press, 1992.
    • [12] M. Lichman. UCI machine learning repository, 2015. http://archive.ics.uci.edu/ml.
    • [13] A. Moraglio. Abstract convex evolutionary search. In Proc. of the 11th FOGA, pages 151-162, 2011.
    • [14] A. Moraglio, K. Krawiec, and C. G. Johnson. Geometric semantic genetic programming. In Proc. of PPSN XII, volume 7491, pages 21-31. 2012.
    • [15] 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.
    • [16] T. P. Pawlak. Competent Algorithms for Geometric Semantic Genetic Programming. PhD thesis, Poznan University of Technology, Poznan, Poland, 2015.
    • [17] S. Roman. Advanced linear algebra, volume 135 of Graduate Texts in Mathematics. Springer New York, 2nd edition, 2005.
    • [18] 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.
    • [19] 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.
    • [20] 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.
    • [21] D. White, J. McDermott, M. Castelli, L. Manzoni, B. Goldman, G. Kronberger, W. Ja´skowski, 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.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article