Towards identifying salient patterns in genetic programming individuals


This thesis addresses the problem of offline identification of salient patterns in genetic programming individuals. It discusses the main issues related to automatic pattern identification systems, namely that these (a) should help in understanding the final solutions of the evolutionary run, (b) should give insight into the course of evolution and (c) should be helpful in optimizing future runs. Moreover, it proposes an algorithm, Extended Pattern Growing Algorithm ([E]PGA) to extract, filter and sort the identified patterns so that these fulfill as many as possible of the following criteria: (a) they are representative for the evolutionary run and/or search space, (b) they are human-friendly and (c) their numbers are within reasonable limits. The results are demonstrated on six problems from different domains.

Divisions: College of Engineering & Physical Sciences
Additional Information: Department: Mathematics If you have discovered material in AURA which is unlawful e.g. breaches copyright, (either yours or that of a third party) or any other law, including but not limited to those relating to patent, trademark, confidentiality, data protection, obscenity, defamation, libel, then please read our Takedown Policy and contact the service immediately. Digitised thesis available via EThOS
Institution: Aston University
Uncontrolled Keywords: genetic programming,tree mining,data mining.
Last Modified: 28 Jun 2024 07:57
Date Deposited: 15 Feb 2011 09:51
Completed Date: 2010-06-12
Authors: Joó, András


Export / Share Citation


Additional statistics for this record