Modularization by Multi-Run Frequency Driven Subtree Encapsulation

In tree-based Genetic Programming, subtrees which represent potentially useful sub-solutions can be encapsulated in order to protect them and aid their prolifer-ation throughout the population. This paper investigates implementing this as a multi-run method. A two-stage encapsulation scheme based on subtree survival and frequency is compared against Automatically Defined Functions in fixed and evolved architectures and standard Genetic Programming for solving a Parity problem.

[1]  K. Chellapilla,et al.  Investigating the influence of depth and degree of genotypic change on fitness in genetic programming , 1999 .

[2]  N. Hopper,et al.  Analysis of genetic diversity through population history , 1999 .

[3]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .

[4]  Larry Bull,et al.  Genetic Programming for Kernel-Based Learning with Co-evolving Subsets Selection , 2006, PPSN.

[5]  Paul R. Halmos.  Does mathematics have elements? , 1981 .

[6]  E. Wasserstrom.  Numerical Solutions by the Continuation Method , 1973 .

[7]  Terence Soule,et al.  Removal bias: a new cause of code growth in tree based evolutionary programming , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[8]  Justinian P. Rosca,et al.  Discovery of subroutines in genetic programming , 1996 .

[9]  Antonina Starita,et al.  An Analysis of Automatic Subroutine Discovery in Genetic Programming , 1999, GECCO.

[10]  Karl Benson,et al.  Evolutionary computation method for pattern recognition of cis-acting sites. , 2003, Bio Systems.

[11]  E. Bono.  Lateral Thinking: A Textbook of Creativity , 1970 .

[12]  Daniel Howard,et al.  A staged genetic programming strategy for image analysis , 1999 .

[13]  Riccardo Poli,et al.  Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes , 2000, Genetic Programming and Evolvable Machines.

[14]  Conor Ryan,et al.  Machine Vision: Exploring Context With Genetic Programming , 2002, GECCO.

[15]  Riccardo Poli,et al.  Fitness Causes Bloat: Mutation , 1997, EuroGP.

[16]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[17]  John R. Koza,et al.  Iterative Refinement Of Computational Circuits Using Genetic Programming , 2002, GECCO.

[18]  Daniel Howard,et al.  Target detection in SAR imagery by genetic programming , 1999 .

[19]  John R. Koza,et al.  Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.

[20]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[21]  J. Pollack,et al.  Coevolving High-Level Representations , 1993 .

[22]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[23]  Sean Luke,et al.  Modification Point Depth and Genome Growth in Genetic Programming , 2003, Evolutionary Computation.