Learning probabilistic tree grammars for genetic programming

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

Volumn 3242, Issue , 2004, Pages 192-201

  Bosman, Peter A N ^a   De Jong, Edwin D ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTEXT FREE GRAMMARS; FORESTRY; GENETIC ALGORITHMS; GENETIC PROGRAMMING; STRUCTURAL OPTIMIZATION;

BENCH-MARK PROBLEMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; EVOLUTIONARY METHOD; GENETIC ALGORITHM (GAS); PROBABILISTIC MODELING; PROBABILISTIC TREES; STRUCTURAL FEATURE; TREE REPRESENTATION;

PROBLEM SOLVING;

EID: 35048853003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_20     Document Type: Article

References (17)

1. Cramer, N.L.: A representation for the adaptive generation of simple sequential programs. In Grefenstette, J.J., ed.: Proceedings of the First International Conference on Genetic Algorithms and their Applications, Hillsdale, NJ, Carnegie-Mellon University, Lawrence Erlbaum Associates (1985) 183-187
2. Koza, J.R.: Genetic Programming. The MIT Press, Cambridge, MA (1992)
3. Angeline, P.J., Pollack, J.B.: The evolutionary induction of subroutines. In: Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, Hillsdale, NJ, Lawrence Erlbaum Associates (1992) 236-241
4. Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. The MIT Press, Cambridge, MA (1994)
5. Rosca, J.P., Ballard, D.H.: Discovery of subroutines in genetic programming. In Angeline, P., Kinnear, Jr., K.E., eds.: Advances in Genetic Programming 2. The MIT Press, Cambridge, MA (1996) 177-202
6. Salustowicz, R.P., Schmidhuber, J.: Probabilistic incremental program evolution. Evolutionary Computation 5 (1997) 123-141
7. Sastry, K., Goldberg, D.E.: Probabilistic model building and competent genetic programming. In Riolo, R.L., Worzel, B., eds.: Genetic Programming Theory and Practise. Kluwer (2003) 205-220
8. Shan, Y., McKay, R., Baxter, R., Abbass, H., Essam, D., Nguyen, H.: Grammar model-based program evolution. In: Proceedings of the 2004 Congress on Evolutionary Computation - CEC2004, Piscataway, New Jersey, IEEE Press (2004)
9. Bosman, P.A.N.: Design and Application of Iterated Density-Estimation Evolutionary Algorithms. PhD thesis, Utrecht Univ., Utrecht, the Netherlands (2003)
10. Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic, London (2001)
11. Pelikan, M.: Bayesian optimization algorithm: From single level to hierarchy. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, Illinois (2002)
12. Pelikan, M., Goldberg, D.E., Lobo, F.G.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21 (2002) 5-20
13. Rissanen, J.: Hypothesis selection and testing by the MDL principle. The Computer Journal 42 (1999) 260-269
14. Buntine, W.: A guide to the literature on learning probabilistic networks from data. IEEE Transactions On Knowledge And Data Engineering 8 (1996) 195-210
15. Punch, W.F., Zongker, D., Goodman, E.D.: The royal tree problem, a benchmark for single and multiple population genetic programming. In Angeline, P. J., Kinnear, Jr., K.E., eds.: Advances in Genetic Programming 2. The MIT Press, Cambridge, MA, USA (1996) 299-316
16. Korkmaz, E.E., Üçoluk, G.: Design and usage of a new benchmark problem for genetic programming. In: Proceedings of the 18th International Symposium on Computer and Information Sciences ISCIS-2003, Berlin, Springer-Verlag (2003) 561-567
17. Bosman, P.A.N., de Jong, E.D.: Grammar transformations in an EDA for genetic programming. In Pelikan, M., et al., eds.: Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference GECCO-2004, Berlin, Springer-Verlag (2004)