Dynamic limits for bloat control: Variations on size and depth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3103, Issue , 2004, Pages 666-677

  Silva, Sara ^a   Costa, Ernesto ^a  

^a UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

CONTROL TECHNIQUES; DYNAMIC LIMITS; DYNAMIC SIZES; MAXIMUM TREES; PARITY PROBLEMS; SECOND VARIATION; SYMBOLIC REGRESSION; TREE-BASED;

ARTIFICIAL INTELLIGENCE;

EID: 35048842196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_74     Document Type: Article

References (17)

1. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic programming - an introduction, San Francisco, CA. Morgan Kaufmann (1998)
2. Brameier, M., Bankhaf, W.: Neutral variations cause bloat in linear GP. In G. Ryan et al., editors, Proceedings of EuroGP-2003, Berlin. Springer (2003) 286-296
3. Gathercole, C., Ross, P.: An adverse interaction between crossover and restricted tree depth in genetic programming. In J.R. Koza et al., editors, Proceedings of GP'96, Cambridge, MA. MIT Press (1996) 291-296
4. Koza, J.R.: Genetic programming - on the programming of computers by means of natural selection, Cambridge, MA. MIT Press (1992)
5. Langdon, W.B.: Genetic Programming + Data Structures = Automatic Programming!, Boston, MA. Kluwer (1998)
6. Langdon, W.B.: The evolution of size in variable length representations. In D. Fogel, editor, Proceedings of ICEC'98. IEEE Press (1998) 633-638
7. Langdon, W.B., Poli, R.: An analysis of the MAX problem in genetic programming. In J.R. Koza et al., editors, Proceedings of GP'97, San Francisco, CA. Morgan Kaufman (1997) 222-230
8. Luke, S., Panait, L.: Lexicographic parsimony pressure. In W.B. Langdon et al., editors, Proceedings of GECCO-2002, San Francisco, CA. Morgan Kaufmann (2002) 829-836
9. Luke, S., Panait, L.: Fighting bloat with nonparametric parsimony pressure. In J.J. Merelo Guervos et al. , editors, Proceedings of PPSN-2002, Berlin. Springer Verlag (2002) 411-421
10. Poli, R.: A simple but theoretically-motivated method to control bloat in genetic programming. In C. Ryan et al., editors, Proceedings of EuroGP-2003, Berlin. Springer (2003) 204-217
11. Silva, S.: GPLAB - a genetic programming toolbox for MATLAB. (2004) http://gplab.sourceforge.net
12. Silva, S., Almeida, J.: Dynamic maximum tree depth - a simple technique for avoiding bloat in tree-based GP. In E. Cantú-Paz et al., editors, Proceedings of GECCO-2003, Berlin. Springer Verlag (2003) 1776-1787
13. Soule, T.: Code growth in genetic programming. PhD thesis, University of Idaho (1998)
14. Soule, T.: Exons and code growth in genetic programming. In J.A. Foster et al., editors, Proceedings of EuroGP-2002, Berlin. Springer (2002) 142-151
15. Soule, T., Foster, J.A.: Effects of code growth and parsimony pressure on populations in genetic programming. Evolutionary Computation, 6(4) (1999) 293-309
16. Soule, T., Heckendorn, R.B.: An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines, 3 (2002) 283-309
17. Streeter, M.J.: The root causes of code growth in genetic programming. In C. Ryan et al., editors, Proceedings of EuroGP-2003, Berlin. Springer (2003) 449-458