Best SubTree genetic programming

The result of the program encoded into a Genetic Programming(GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we present and investigate a new variant where the best subtree is chosen to provide the solution of the problem. The other nodes (not belonging to the best subtree) are deleted. This will reduce the size of the chromosome in those cases where its best subtree is different from the entire tree. We have tested this strategy on a wide range of regression and classification problems. Numerical experiments have shown that the proposed approach can improve both the search speed and the quality of results.

[1]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[2]  William B. Langdon,et al.  Quadratic Bloat in Genetic Programming , 2000, GECCO.

[3]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[4]  Wolfgang Banzhaf,et al.  A comparison of linear genetic programming and neural networks in medical data mining , 2001, IEEE Trans. Evol. Comput..

[5]  Leo Breiman,et al.  Bias, Variance , And Arcing Classifiers , 1996 .

[6]  Lutz Prechelt,et al.  PROBEN 1 - a set of benchmarks and benchmarking rules for neural network training algorithms , 1994 .

[7]  C. Sitthi-amorn,et al.  Bias , 1993, The Lancet.

[8]  James R. Levenick.  Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology , 1991, ICGA.

[9]  Astro Teller,et al.  A study in program response and the negative effects of introns in genetic programming , 1996 .

[10]  Riccardo Poli,et al.  A Schema Theory Analysis of the Evolution of Size in Genetic Programming with Linear Representations , 2001, EuroGP.

[11]  Gilbert Syswerda,et al.  A Study of Reproduction in Generational and Steady State Genetic Algorithms , 1990, FOGA.

[12]  J. Freidman,et al.  Multivariate adaptive regression splines , 1991 .

[13]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[14]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[15]  Lothar Thiele,et al.  Genetic Programming and Redundancy , 1994 .

[16]  Peter Nordin,et al.  Introns in Nature and in Simulated Structure Evolution , 1997, BCEC.

[17]  Julian Francis Miller,et al.  Cartesian genetic programming , 2000, GECCO '10.

[18]  Peter J. Angeline,et al.  Explicitly Defined Introns and Destructive Crossover in Genetic Programming , 1996 .

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