Building on success in genetic programming: Adaptive variation and developmental evaluation

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

Volumn 4683 LNCS, Issue , 2007, Pages 137-146

  Hoang, Tuan Hao ^a   Essam, Daryl ^a   McKay, Bob ^b   Hoai, Nguyen Xuan ^c  

^a School of Engineering and Information Technology   (Australia)

^b Seoul National University   (South Korea)

^c Natural Computation Group   (Viet Nam)

Author keywords

Adaptive mutation; Developmental; Genetic programming; Incremental learning

Indexed keywords

LEARNING SYSTEMS; MATHEMATICAL OPERATORS; REGRESSION ANALYSIS; TREES (MATHEMATICS);

ADAPTIVE MUTATION; GENETIC OPERATOR APPLICATIONS; INCREMENTAL LEARNING; SYMBOLIC REGRESSION PROBLEMS;

GENETIC PROGRAMMING;

EID: 38049034428     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74581-5_15     Document Type: Conference Paper

References (19)

1. Lindenmayer, A.: Mathematical models for cellular interaction in development, parts i and ii. Journal of Theoretical Biology 18 (1968) 280-299 and 300-315
2. Hoai, N.X., McKay, R.I.B., Essam, D.: Representation and structural difficulty in genetic programming. IEEE Transactions on Evolutionary Computation 10(2) (April 2006) 157-166
3. McKay, R.I., Hoang, T.H., Essam, D.L., Nguyen, X.H.: Developmental evaluation in genetic programming: the preliminary results. In Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A., eds.: Proceedings of the 9th European Conference on Genetic Programming. Volume 3905 of Lecture Notes in Computer Science., Budapest, Hungary, Springer (10 - 12 April 2006) 280-289
4. Hao, H.T., Essam, D., McKay, R.I., Nguyen, X.H.: Developmental evaluation in genetic programming: A TAG-based framework. In Pham, T.L., Le, H.K., Nguyen, X.H., eds.: Proceedings of the Third Asian-Pacific workshop on Genetic Programming, Military Technical Academy, Hanoi, VietNam (2006) 86-97
5. Shin, J., Kang, M., McKay, R.I.B., Nguyen, X., Hoang, T.H., Mori, N., Essam, D.: Analysing the regularity of genomes using compression and expression simplification. In: Proceedings of the 10th European Conference on Genetic Programming (EuroGP2007, Valencia, Spain). Volume 4445 of Springer Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany (April 2007) 251-260
6. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA (1992)
7. Schwefel, H.P.: Numerical Optimization of Computer Models. John Wiley & Sons, Inc., New York, NY, USA (1981)
8. Back, T., Schwefel, H.P.: An overview of evolutionary algorithms for parameter optimization. Evol. Comput. 1(1) (1993) 1-23
9. Angelinì, P.J., Pollack, J.B.: Coevolving high-level representations. In Langton, CG., ed.: Artificial Life III. Volume XVII of SFI Studies in the Sciences of Complexity., Santa Fe, New Mexico, Addison-Wesley (15-19 June 1992 1994) 55-71
10. Rosea, J.P., Ballard, D.H.: Hierarchical self-organization in genetic programming. In: Proceedings of the Eleventh International Conference on Machine Learning, Morgan Kaufmann (1994)
11. Angeline, P.J.: Two self-adaptive crossover operators for genetic programming. In Angelinì, P.J., Kinnear, Jr., K.E., eds.: Advances in Genetic Programming 2. MIT Press, Cambridge, MA, USA (1996) 89-110
12. Teller, A.: Evolving programmers: The co-evolution of intelligent recombination operators. In Angelinì, P.J., Kinnear, Jr., K.E., eds.: Advances in Genetic Programming 2. MIT Press, Cambridge, MA, USA (1996) 45-68
13. Iba, H., de Garis, H.: Extending genetic programming with recombinative guidance. In Angelinì, P.J., Kinnear, Jr., K.E., eds.: Advances in Genetic Programming 2. MIT Press, Cambridge, MA, USA (1996) 69.....88
14. Angeline, P.J.: Adaptive and self-adaptive evolutionary computations. In Palaniswami, M., Attikiouzel, Y., eds.: Computational Intelligence: A Dynamic Systems Perspective. IEEE Press (1995) 152-163
15. Prusinkiewicz, P., Lindenmayer, A.: The algorithmic beauty of plants. SpringerVerlag New York, Inc., New York, NY, USA (1996)
16. Langdon, W.B., Poli, R.: Why "building blocks" don't work on parity problems. Technical Report CSRP-98-17, University of Birmingham, School of Computer Science (13 July 1998)
17. Poli, R., Page, J.: Solving high-order boolean parity problems with smooth uniform crossover, sub-machine code GP and demes. Genetic Programming and Evolvable Machines 1(1/2) (April 2000) 37-56
18. Schabes, Y., Waters, R.: Tree insertion grammar: A cubic-time parsable formalism that lexicalizes context-free grammar without changing the trees produced. Computational Linguistics 20(1) (1995) 479-513
19. Lukasiewicz, J. In: On Three-Valued Logic. Clarendon Press, Oxford, UK (1967) 16-18