Towards identifying salient patterns in genetic programming individuals

Authors:
András Joó;Juan Pablo Neirotti
Affiliations:
Aston University, Birmingham, United Kingdom;Aston University, Birmingham, United Kingdom
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 3
Cited 1

Mining the Genetic Program

IEEE Expert: Intelligent Systems and Their Applications
A new approach to evaluate GP schema in context

GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Frequent Subtree Mining - An Overview

Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences

Have your spaghetti and eat it too: evolutionary algorithmics and post-evolutionary analysis

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

A practical method for the offline extraction and analysis of salient patterns from tree-based genetic programming (GP) individuals is proposed. The method is contrasted with Tackett's algorithm [7] and it is shown that relying solely on frequency and fitness profiles for the salient pattern identification can be misleading. To amend Tackett's work a formula for measuring saliency is proposed. A method for separating inert and salient patterns is also discussed.