## Abstract / Description of output

Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Programming populations. However their method could only give static estimates of the degree of repetition of building blocks in one generation at a time, supplying no information about the flow of building blocks between generations. Here, we use a state-of-the-art tree compression algorithm, xmlppm, to estimate the extent to which frequent building blocks from one generation are still in use in a later generation.

While they compared the behaviour of different GP algorithms on one specific problem -- a simple symbolic regression problem -- we extend the analysis to a more complex problem, a symbolic regression problem to find a Fourier approximation to a sawtooth wave, and to a Boolean domain, odd parity.

While they compared the behaviour of different GP algorithms on one specific problem -- a simple symbolic regression problem -- we extend the analysis to a more complex problem, a symbolic regression problem to find a Fourier approximation to a sawtooth wave, and to a Boolean domain, odd parity.

Original language | English |
---|---|

Title of host publication | Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation |

Place of Publication | New York, NY, USA |

Publisher | ACM |

Pages | 1011-1018 |

Number of pages | 8 |

ISBN (Print) | 978-1-60558-325-9 |

DOIs | |

Publication status | Published - 2009 |

### Publication series

Name | GECCO '09 |
---|---|

Publisher | ACM |

## Keywords / Materials (for Non-textual outputs)

- building blocks, compression, genetic programming, regularity