Representation and structural difficulty in genetic programming

IEEE Transactions on Evolutionary Computation

Volumn 10, Issue 2, 2006, Pages 157-166

  Hoai, Nguyen Xuan ^a   McKay, Rim I ^b   Essam, Daryl ^c  

^a MILITARY TECHNICAL ACADEMY   (Viet Nam)

^b Seoul National University   (South Korea)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Deletion; Genetic programming (GP); Insertion; Operator; Representation; Structural difficulty

Indexed keywords

GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; NUMERICAL METHODS;

GENETIC PROGRAMMING; NUMERICAL DISTRIBUTION; STRUCTURAL DIFFICULTY; TREE-BASED REPRESENTATION;

MATHEMATICAL PROGRAMMING;

EID: 33645575048     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.871252     Document Type: Article

References (48)

1. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone, Genetic Programming: An Introduction. San Mateo, CA: Morgan Kaufmann, 1998.
2. T. Blickle and L. Thiele L., "Genetic programming and redundancy," in Proc. KI-94 Workshop on Genetic Algorithms within the Framework of Evolutionary Computation, J. Hopf, Ed., 1994, pp. 33-38.
3. O. A. Chaudhri, J. M. Daida, J. C. Khoo, W. S. Richardsons, R. Harrison, and W. J. Sloat, "Characterizing a tunably difficult problem in genetic programming," in Proc. Genetic Algorithms Evol. Comput. Conf., 2000, pp. 395-402.
4. N. L. Cramer, "A representation for the adaptive generation of sequential programs," in Proc. Int. Conf. Genetic Algorithms Applications, 1985, pp. 183-187.
5. J. M. Daida, S. Ross, J. McClain, D. Ampy, and M. Holczer, "Challenges with verification, repeatability, and meaningful comparisons in genetic programming," in Proc. 2nd Annu. Conf. Genetic Programming. San Mateo, CA, 1997, pp. 64-69.
6. J. M. Daida, J. A. Bertram, J. A. Polito, II, and S. A. Stanhope, "Analysis of single-node (building) blocks in genetic programming," in Advances Genetic Programming III, L. Spector and W. B. Langdon, Eds. Cambridge, MA: MIT Press, 1999, pp. 217-241.
7. J. M. Daida, J. A. Polito, II, S. A. Stanhope, R. R. Bertram, J. C. Khoo, S. A. Chaudhary, and O. A. Chaudhri, "What makes a problem GP-hard? Analysis of a tunably difficult problem in genetic programming," Genetic Programming Evolvable Machines, vol. 2, pp. 165-191, 2001.
8. J. M. Daida, "Limit to expression in genetic programming: Lattice-aggregate modeling," in Proc. Congr. Evol. Comput, 2002, pp. 273-278.
9. J. M. Daida and A. M. Hilss, "Identifying structural mechanism in standard GP," in Proc. Genetic Algorithms Evol. Comput. Conf. (GECCO'2003), Lecture Notes Computer Science 2724, 2003, pp. 1639-1651.
10. J. M. Daida, H. Li, R. Tang, and A. M. Hilss, "What makes a problem GP-hard? Validating a hypothesis of structural causes," in Proc. Genetic Algorithms Evol. Comput. Conf., Lecture Notes Computer Science 2724, 2003, pp. 1665-1677.
11. S. Droste and D. Wiesmann. (2004, Oct.) On representation and genetic operators in evolutionary algorithms. [Online]. Available: citeseer.ist.psu.edu/droste98representation.html
12. J. Gottlieb and G. R. Raidl, "Characterizing locality in decoder-based EA's for the multidimensional knapsack problem," in Proc. Artificial Evolution, Lecture Notes Computer Science 1829. New York, 1999, pp. 38-52.
13. C. Igel, "Causality of hierarchical variable length representations," in Proc. IEEE World Congr. Comput. Intell.. New York, 1998, pp. 324-329.
14. A. K. Joshi, L. S. Levy, and M. Takahashi, "Tree adjunct grammars," J. Comput. Syst. Sci., vol. 10, no. 1, pp. 136-163, 1975.
15. A. K. Joshi, "Constraints on structural descriptions: Local transformation," in SIAM J. Comput., Jun. 1977.
16. A. K. Joshi, "How much context-sensitivity is necessary for characterizing structural description," in Natural Language Processing - Theoretical, Computational and Psychological Perspectives, D. Dowty et al., Eds. Cambridge, U.K.: Cambridge Univ. Press, 1985.
17. A. K. Joshi, "An introduction to tree adjoining grammars," in Mathematics of Language, A. Manaster-Ramer, Ed. Amsterdam, The Netherlands: John Benjamins, 1987.
18. A. K. Joshi, "The convergence of mildly context-sensitive grammar formalisms," in Foundation Issues in Natural Language Processing, P. Sells et al., Eds. Cambridge, MA: MIT Press, 1991.
19. Handbook of Formal Languages, G. Rozenberg and A. Saloma, Eds., Springer-Verlag, New York, 1997, pp. 69-123.
20. J. R. Koza, Genetic Programming: On the Programming of Computers by Natural Selection. Cambridge, MA: MIT Press, 1992.
21. A. Kroch and A. K. Joshi, "Linguistic relevance of tree adjoining grammars," Dept. Comput. Sci. Inf. Sci., Univ. Pennsylvania, Philadelphia, PA, Tech. Rep. MS-CIS-85-18, Apr. 1985.
22. A. Kroch, "Unbounded dependencies and subjacency in a tree adjoining grammar," in Mathematics of Language, A. Manaster-Ramer, Ed. Amsterdam, The Netherlands: John Benjamins, 1987.
23. W. B. Langdon and R. Poli, Foundations of Genetic Programming. Berlin, Germany: Springer-Verlag, 2002.
24. P. K. Lehre and P. C. Haddow, "Developmental mapping and phenotypic complexity," in Proc. Congr. Evol. Comput., 2003, pp. 62-65.
25. S. Y. Lu, "The tree-to-tree distance and its application in cluster analysis," IEEE Trans. Pattern Anal., vol. PAMI-1, no. 2, pp. 219-222, 1979.
26. N. X. Hoai, R. I. McKay, and D. Essam, "Some experimental results with tree adjunct grammar guided genetic programming," in Proc. 5th Eur. Conf. Genetic Programming, Lecture Notes Computer Science 2278. New York, 2002, pp. 328-337.
27. N. X. Hoai, R. I. McKay, and D. Essam, "Genetic transposition in tree adjoining grammar-guided genetic programming: The relocation operator," in Proc. 5th Int. Conf. Simulated Evolution Learning (SEAL 04), 2004. CD-ROM.
28. U. M. O'Reilly, "Using a distance metric on genetic programs to understand genetic operators," in Proc. Late Breaking Papers Genetic Programming Conf., 1997, pp. 199-206.
29. C. C. Palmer and A. Kershenbaum, "Representing trees in genetic algorithms," in Proc. 1st IEEE Conf. Evol. Comput., 1994, pp. 379-384.
30. I. Rechenberg, Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biologischen Evolution. Stuttgart, Germany: Fromman-Hozlboog Verlag, 1973.
31. J. P. Rosca and D. H. Ballard, "Causality in genetic programming," in Genetic Algorithms: Proc. 6th Int. Conf. (ICGA95). San Mateo, CA, 1995.
32. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms. New York: Physica-Verlag, 2002.
33. W. Rudin, Principles of Mathematical Analysis, 3rd ed. New York: McGraw-Hill, 1976.
34. Y. Schabes, "Mathematical and computational aspects of lexicalized grammars," Ph.D. dissertation, Dept. Comput. Inf. Sci., Univ. Pennsylvania, Philadelphia, PA, 1990.
35. Y. Schabes, "Lexicalized context-free grammars," Mitsubishi Electric Research Laboratories, Cambridge Center, Cambridge, MA, Tech. Rep. TR93-01, 1993.
36. Y. Schabes and R. C. Waters, "Lexicalized context-free grammar: A cubic-time parsable, lexicalized normal form for context-free grammar that preserves tree structure," Mitsubishi Electric Research Laboratories, Cambridge Center, Cambridge, MA, Tech. Rep. TR93-04, 1993.
37. Y. Schabes and S. Shieber, "An alternative conception of tree-adjoining derivation," Computational Linguistics, vol. 20, no. 1, pp. 91-124, 1994.
38. Y. Schabes and R. C. Waters, "Tree insertion grammar: A cubic-time parsable formalism that lexicalizes context-free grammar without changing the trees produced," Computational Linguistics, vol. 20, no. 1, pp. 479-513, 1995.
39. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms. Reading, MA: Addison-Wesley, 1996.
40. B. Sendhoff, M. Kreutz, and W. V. Seelen, "A condition for the genotype-phenotype mapping: Causality," in Proc. 7th Int. Conf. Genetic Algorithms, 1997, pp. 73-80.
41. M. Shackleton, R. Shipman, and M. Ebner, "An investigation of redundant genotype-phenotype mappings and their role in evolutionary search," in Proc. Congr. Evol. Comput., 2000, pp. 493-500.
42. V. Shanker, "A study of tree adjoining grammars," Ph.D. dissertation, Dept. Comput. Inf. Sci., Univ. Pennsylvania, Philadelphia, PA, 1987.
43. R. Shipman, "Genetic redundancy: Desirable or problematic for evolutionary search?," in Proc. 4th Int. Conf. Artificial Neural Networks Genetic Algorithms, 1999, pp. 1-11.
44. R. Shipman, M. Shackleton, and I. Harvey, "The use of neutral genotype-phenotype mappings for improved evolutionary search," BT Technol. J., vol. 18, no. 4, pp. 103-111, 2000.
45. T. Soule and J. A. Foster, "Effects of code growth and parsimony pressure on population in genetic programming," Evol. Comput., vol. 6, no. 4, pp. 293-309, 1999.
46. P. Stagge and C. Igel, "Structure optimization and isomorphisms," in Theoretical Aspects of Evolutionary Computing. New York: Springer-Verlag, 2000.
47. D. J. Weir, "Characterizing mildly context-sensitive grammar formalisms," Ph.D. dissertation, Dept. Comput. Inf. Sci., Univ. Pennsylvania, Philadelphia, PA, 1988.
48. P. A. Whigham, "Grammatical bias for evolutionary learning," Ph.D. dissertation, Univ. New South Wales, Campbell, Australia, 1996.