Semantic building blocks in genetic programming

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

Volumn 4971 LNCS, Issue , 2008, Pages 134-145

  McPhee, Nicholas Freitag ^a   Ohs, Brian ^a   Hutchison, Tyler ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; COMPUTER PROGRAMMING; GENETIC ALGORITHMS; INFORMATION THEORY; SEMANTICS;

BUILDING BLOCKS; CROSSOVER EVENTS; EUROPEAN; HEIDELBERG (CO); RESEARCH AREA (RA); SEMANTIC ACTION; SEMANTIC SPACES; STRONG CORRELATIONS; SUB-TREE CROSSOVER;

GENETIC PROGRAMMING;

EID: 47249151453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78671-9_12     Document Type: Conference Paper

References (20)

1. Angeline, P.J.: Subtree crossover: Building block engine or macromutation? In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, CA, USA, July 13-16, pp. 9-17. Morgan Kaufmann, San Francisco (1997)
2. Blickle, T., Thiele, L.: Genetic programming and redundancy. In: Hopf, J. (ed.) Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), Im Stadtwald, Building 44, D-66123 Saarbrücken, Germany, pp. 33-38 (1994), Max-Planck-Institut für Informatik (MPI-I-94-241)
3. de Jong, E.D., Pollack, J.B.: Ideal evaluation from coevolution. Evolutionary Computation 12(2), 159-192 (2004)
4. Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)
5. Langdon, W.B., Soule, T., Poli, R., Foster, J.A.: The evolution of size and shape. In: Spector, L., Langdon, W.B., O'Reilly, U.-M., Angeline, P.J. (eds.) Advances in Genetic Programming 3, ch. 8, pp. 163-190. MIT Press, Cambridge (1999)
6. Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms, A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)
7. Luke, S.: Two fast tree-creation algorithms for genetic programming. IEEE Transactions on Evolutionary Computation 4(3), 274-283 (2000)
8. Luke, S., Spector, L.: A revised comparison of crossover and mutation in genetic programming. In: Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Goldberg, D.E., Iba, H., Riolo, R. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, July 22-25, pp. 208-213. Morgan Kaufmann, San Francisco (1998)
9. McPhee, N.F., Miller, J.D.: Accurate replication in genetic programming. In: Eshelman, L. (ed.) Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA 1995), Pittsburgh, PA, USA, July 15-19, pp. 303-309. Morgan Kaufmann, San Francisco (1995)
10. McPhee, N.F., Ohs, B., Hutchison, T.: Enumerating building block semantics in genetic programming. Technical report, University of Minnesota, Morris (2007), http://www.morris.umn.edu/academic/fclt/WorkingPapers/ Morris_WP_3.1.pdf
11. McPhee, N.F., Ohs, B., Hutchison, T.: Semantic building blocks in genetic programming. Technical report, University of Minnesota, Morris (2007), http://www.morris.umn.edu/ academic/fclt/WorkingPapers/Morris_WP_3.2.pdf
12. McPhee, N.F., Poli, R.: Using schema theory to explore interactions of multiple operators. In: Langdon, W.B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N. (eds.) GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, July 9-13, pp. 853-860. Morgan Kaufmann Publishers, San Francisco (2002)
13. O'Reilly, U.M., Oppacher, F.: The troubling aspects of a building block hypothesis for genetic programming. Working Paper 94-02-001, Santa Fe Institute, 1399 Hyde Park Road Santa Fe, New Mexico 87501-8943 USA (1992)
14. Poli, R.: Is crossover a local search operator? In: Position paper at the Workshop on Evolutionary Computation with Variable Size Representation at ICGA-1997, July 20 (1997)
15. Poli, R., Langdon, W.B.: Schema theory for genetic programming with one-point crossover and point mutation. Evolutionary Computation 6(3), 231-252 (1998)
16. Poli, R., McPhee, N.F.: General schema theory for genetic programming with subtree-swapping crossover: Part I. Evolutionary Computation 11(1), 53-66 (2003)
17. Poli, R., McPhee, N.F.: General schema theory for genetic programming with subtree-swapping crossover: Part II. Evolutionary Computation 11(2), 169-206 (2003)
18. 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), 37-56 (2000)
19. Rosca, J.P: Analysis of complexity drift in genetic programming. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, CA, USA, July 13-16, pp. 286-294. Morgan Kaufmann, San Francisco (1997)
20. Sastry, K, O'Reilly, U.-M., Goldberg, D.E., Hill, D.: Building block supply in genetic programming. In: Riolo, R.L., Worzel, B. (eds.) Genetic Programming Theory and Practice, ch. 9, pp. 137-154. Kluwer, Dordrecht (2003)