A Detailed Analysis of a PushGP Run

  • McPhee N
  • Finzel M
  • Casale M
  • et al.
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In evolutionary computation runs there is a great deal of data that could be saved and analysed. This data is often put aside, however, in favour of focusing on the final outcomes, typically captured and presented in the form of summary statistics and performance plots. Here we examine a genetic programming run in detail and trace back from the solution to determine how it was derived. To visualize this genetic programming run, the ancestry graph is extracted, running from the solution(s) in the final generation up to their ancestors in the initial random population. The key instructions in the solution are also identified, and a genetic ancestry graph is constructed, a subgraph of the ancestry graph containing only those individuals contributed genetic information (or instructions) to the solution. This visualization and our ability to trace these key instructions throughout the run allowed us to identify general inheritance patterns and key evolutionary moments in this run.

Cite

CITATION STYLE

APA

McPhee, N. F., Finzel, M. D., Casale, M. M., Helmuth, T., & Spector, L. (2018). A Detailed Analysis of a PushGP Run (pp. 65–83). https://doi.org/10.1007/978-3-319-97088-2_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free