Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Automatic Derivation of Search Objectives for Test-Based Genetic Programming

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Year of publication

2015

Chapter type

paper

Publication language

english

Keywords
EN
  • genetic programming
  • program synthesis
  • Test-based problems
  • Multiobjective evolutionary computation
Abstract

EN In genetic programming (GP), programs are usually evaluated by applying them to tests, and fitness function indicates only how many of them have been passed. We posit that scrutinizing the outcomes of programs’ interactions with individual tests may help making program synthesis more effective. To this aim, we propose DOC, a method that autonomously derives new search objectives by clustering the outcomes of interactions between programs in the population and the tests. The derived objectives are subsequently used to drive the selection process in a single- or multiobjective fashion. An extensive experimental assessment on discrete program synthesis tasks representing two domains shows that DOC significantly outperforms conventional GP and implicit fitness sharing.

Pages (from - to)

53 - 65

DOI

10.1007/978-3-319-16501-1_5

URL

https://link.springer.com/chapter/10.1007/978-3-319-16501-1_5

Book

Genetic Programming : 18th European Conference, EuroGP 2015, Copenhagen, Denmark, April 8-10, 2015 : Proceedings

Presented on

18th European Conference on Genetic Programming, EuroGP 2015, 8-10.04.2015, Copenhagen, Denmark

Publication indexed in

WoS (15)

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.