Random tree generation for genetic programming

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

Volumn 1141, Issue , 1996, Pages 144-153

  Hitoshi, Iba ^a  

^a ELECTROTECHNICAL LABORATORY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; GENETIC ALGORITHMS; GENETIC PROGRAMMING; TREES (MATHEMATICS);

BIJECTIONS; INITIALIZATION PROCEDURES; RANDOM TREE; RECURSIVE METHODS;

PROBLEM SOLVING;

EID: 84958986849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_978     Document Type: Conference Paper

References (8)

1. Alonso, L. and Schott, R., Random Generation of Trees, Kluwer Academic Publishers, 1995
2. Er, M.C., Enumerating Ordered Trees Lexicographically, in The Computer Journal, vol. 28, no.5, pp.538-543, 1985
3. Iba, H., Generating Random Trees for Genetic Programming, Computers ETLTR-95-35, 1995
4. Koza, J. Genetic Programming, On the Programming of Computers by means of Natural Selection, MIT Press, 1992
5. Lang, K.J., Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza's, in Proe. of 12th Machine Learning Workshop, pp.340-344, 1995
6. Lovasz, L. Combinational problem and exercises, Akademiai Kiado, Budapest, 1979
7. Montana, D.J., Strongly Typed Genetic Programming, in Evolutionary Computation, vol.3, no.2, pp.199-230, 1995
8. Oakley, H. Two Scientific Applications of Genetic Programming: Stack Filters and Non-Linear Equation Fitting to Chaotic Data, in Advances in Genetic Programming, (ed. Kenneth E. Kinnear, Jr.), MIT Press, 1994