CISUC - Dynamic Limits for Bloat Control - Variations on Size and Depth
CISUC

Dynamic Limits for Bloat Control - Variations on Size and Depth

Authors

Abstract

We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending the idea to non tree-based GP. Dynamic Maximum Tree Depth introduces a dynamic limit on the depth of the trees allowed into the population, initially set with a low value but increased whenever needed to accommodate a new best individual that would otherwise break the limit. The first variation to this idea is the Heavy Dynamic Limit that, unlike the original one, may fall again to a lower value after it has been raised, in case the new best individual allows it. The second variation is the Dynamic Size Limit, where size is the number of nodes, instead and regardless of depth. The variations were tested in two problems, Symbolic Regression and Parity, and the results show that the heavy limit performs generally better than the original technique, but the dynamic limit on size fails in the Parity problem. The possible reasons for success and failure are discussed.

Keywords

genetic programming, bloat, code growth, introns, tree depth

Subject

Genetic Programming

Conference

Genetic and Evolutionary Computation Conference (GECCO-2004), June 2004

PDF File


Cited by

Year 2011 : 3 citations

 Neshatian K, Zhang M (2011). Using genetic programming for context-sensitive feature scoring in classification problems. Connection Science 23(3): 183-207.

 Bhardwaj A, Sakalle A, Chouhan H, Bhardwaj H (2011). Controlling the problem of bloating using stepwise crossover and double mutation technique. Advanced Computing: An International Journal (ACIJ), 2(6): 59–68.

 Selle B, Muttil N (2011). Testing the structure of a hydrological model using Genetic Programming. Journal of Hydrology 397(1–2): 1–9.

Year 2010 : 1 citations

 Beikia M, Basharib A, Majdia A (2010). Genetic programming approach for estimating the deformation modulus of rock mass using sensitivity analysis by neural network. International Journal of Rock Mechanics and Mining Sciences, 47(7): 1091--1103.

Year 2009 : 4 citations

 Amil NM, Bredeche N, Gagné C, Gelly S, Schoenauer M, Teytaud O (2009). A Statistical Learning Perspective of Genetic Programming. In Proc 12th European Conference on Genetic Programming (EuroGP) at EvoStar 2009, 327"338.

 Kumar R, Bal BK, Rockett PI (2009). Multiobjective Genetic Programming Approach to Evolving Heuristics for the Bounded Diameter Minimum Spanning Tree Problem. In Proc Genetic and Evolutionary Computation Conference (GECCO 2009), 309"316.

 Neshatian K, Zhang M (2009). Pareto Front Feature Selection: Using Genetic Programming to Explore Feature Space. In Proc Genetic and Evolutionary Computation Conference (GECCO 2009), 1027"1034.

 Kouchakpour P, Zaknich A, Braunl T (2009). A survey and taxonomy of performance improvement of canonical genetic programming. Knowledge and Information Systems 21(1): 1-39.

Year 2008 : 4 citations

 Poli R, Langdon WB, McPhee NF (2008). A Field Guide to Genetic Programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk (With contributions by J.R. Koza).

 William E, Northern J (2008). Genetic Programming Lab (GPLab) Tool Set Version 3.0. In Proc 2008 IEEE Region 5 Conference, 1"6.

 Neshatian K, Zhang M (2008). Genetic Programming and Class-Wise Orthogonal Transformation for Dimension Reduction in Classification Problems. In Proc 11th European Conference on Genetic Programming (EuroGP) at EvoStar 2008, 242"253.

 Kouchakpour P (2008). Population Variation in Canonical Tree-based Genetic Programming. PhD Thesis, School of Electrical, Electronic and Computer Engineering, University of Western Australia. Nedlands, Perth, Western Australia.

Year 2007 : 3 citations

 Neshatian K, Zhang M, Johnston M (2007). Feature Construction and Dimension Reduction Using Genetic Programming. In Proc 20th Australian Conference on Artificial Intelligence, 160"170.

 Parasuramana K, Elshorbagya A, Sib BC (2007). Estimating Saturated Hydraulic Conductivity Using Genetic Programming. Soil Science Society America Journal, 71: 1676"1684.

 Parasuraman K (2007). Hydrologic Prediction Using Pattern Recognition and Soft-Computing Techniques. PhD Thesis, Department of Civil and Geological Engineering, University of Saskatchewan, Saskatoon, Canada.

Year 2006 : 3 citations

 Luke S, Panait L (2006). A Comparison of Bloat Control Methods for Genetic Programming. Evolutionary Computation 14(3): 309"344.

 Gelly S, Teytaud O, Bredeche N, Schoenauer M (2006). Universal Consistency and Bloat in GP. Revue d"Intelligence Artificielle 20(6): 805"827.

 Shuhua Z, Qian G, Jianguo S (2006). Genetic Programming Approach for Predicting Surface Subsidence Induced by Mining. Journal of China University of Geosciences 17(4): 361"366.