rmit university aspgpanalysis of genetic programming runs1 vic ciesielski and xiang li {vc, school...
If you can't read please download the document
DESCRIPTION
RMIT UNIVERSITY ASPGPAnalysis of Genetic Programming Runs3 Introduction Analyzing GP runs is important –Help to understand the problem in depth; Find important patterns; Improve the search techniques Eg. MAX by Gathorcole and Ross, 1996 ; Langdon and Poli, 1997 Eg. Fitness Landscape by Kinnear, Jr. 1994; Ant by Langdon and Poli, 1998 Previous works have limitations –Only one or two problems –Only limited aspects of the problems, eg. convergence, bloat, fitness landscape, tree shapes (limited) Research questions –How many duplicate individuals are evaluated in a run? –What percentage of possible tree shapes are evaluated? –Are there any patterns in the size and depth of the trees examined? –Are there any differences between the toy and the real world problems? –Are any improvements to the GP process suggested by the discovered patterns?