Softening the structural difficulty in genetic programming with TAG-based representation and insertion/deletion operators

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

Volumn 3103, Issue , 2004, Pages 605-616

  Hoai, Nguyen Xuan ^a   McKay, R I ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; FORESTRY; GENETIC ALGORITHMS;

CATALAN TREES; DUAL OPERATORS; GENETIC OPERATORS; MUTATION OPERATORS; SEARCH SPACES; TAG-BASED; TREE ADJOINING GRAMMARS; TREE REPRESENTATION;

GENETIC PROGRAMMING;

EID: 35048847922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_69     Document Type: Article

References (30)

1. Banzhaf W., Nordin P., Keller R.E., and Francone F.D.: Genetic Programming: An Introduction. Morgan Kaufmann Pub (1998).
2. Daida J.M., Ross S.J., McClain J.J., Ampy D.S., and Holczer M.: Challenges with Verification, Repeatability, and Meaningful Comparisons in Genetic Programming. In Genetic Programming 1997: Proceedings of the Second Annual Conference, Koza J. etal.(Eds), Morgan Kaufmann, (1997) 64-69.
3. Daida J.M., Bertram J.A., Polito J.A., and Stanhope S.A.: Analysis of Single-Node (Building) Blocks in Genetic Programming. In Advances in Genetic Programming 3, Spector L., Langdon W.B., O'Reilly, and Angeline P.J. (Eds), the MIT Press (1999) 217-241.
4. Chaudri O.A., et al.: Characterizing a Tunably Difficult Problem in Genetic Programming. In Proceedings of GECCO 2000, Witley L.D., et al. (Eds), Morgan Kaufmann Publisher (2000) 395-402.
5. Daida J.M., Polito J.A., Stanhope S.A., Bertram R.R., Khoo, J.C., Chaudhary S.A., and Chaudhri O.: What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Journal of Genetic Programming and Evolvable Machines, vol. 2 (2001) 165-191.
6. Daida J.M.: Limit to Expression in Genetic Programming: Lattice-Aggregate Modeling. In Proceedings of the 2002 Congress on Evolutionary Computation, IEEE Press (2002) 273-278.
7. Daida J.M. and Hilss. Identifying Structural Mechanism in Standard GP. In Proceedings of GECCO 2003, LNCS, Springer-Verlag (2003) 1639-1651.
8. Daida J.M., Li H., Tang R., and Hilss A.M.: What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes. In Proceedings of GECCO 2003, LNCS, Springer-Verlag (2003) 1665-1677.
9. Gruau F.: On Using Syntactic Constraints with Genetic Programming. In: Advances in Genetic Programming II, The MIT Press, (1996) 377-394.
10. Geyer-Schulz A.: Fuzzy Rule-Based Expert Systems and Genetic Machine Learning. Physica-Verlag, Germany, (1995).
11. Joshi A. K., Levy L. S., and Takahashi M.: Tree Adjunct Grammars. Journal of Computer and System Sciences, 10 (1), (1975) 136-163.
12. Joshi, A. K. and Schabes, Y.: Tree Adjoining Grammars. In: Handbook of Formal Languages, Rozenberg G. and Saloma A. (Eds.) Springer-Verlag, (1997) 69-123.
13. Koza, J. : Genetic Programming. The MIT Press (1992).
14. Nguyen Xuan Hoai and McKay R.I.: A Framework for Tree Adjunct Grammar Guided Genetic Programming. In: Proceedings of Post Graduate ADFA Conference on Computer Science (PACCS'01), H.A. Abbass and M. Barlow (Eds), (2001) 93-99.
15. Nguyen Xuan Hoai, McKay R.I., Essam D., and Chau R.: Solving the Symbolic Regression Problem with Tree Adjunct Grammar Guided Genetic Programming: The Comparative Result. In Proceedings of Congress on Evolutionary Computation (CEC'2002) (2002) 1326-1331.
16. Nguyen Xuan Hoai, McKay R.I., and Abbass H.A.: Tree Adjoining Grammars, Language Bias, and Genetic Programming. In Proceedings of EuroGP 2003, Ryan C. et al (Eds), LNCS 2610, Springer Verlag (2003) 335-344.
17. Nguyen Xuan Hoai and McKay R.I: An Investigation on the Roles of Insertion and Deletion Operators in Tree Adjoining Grammar Guided Genetic Programming. To appear in The Proceedings of Congress on Evolutionary Computation (CEC'2004) (2004).
18. O'Neil M. and Ryan C.: Grammatical Evolution. IEEE Trans on Evolutionary Computation, 4 (4), (2000) 349-357.
19. Schabes Y. and Shieber S.: An Alternative Conception of Tree-Adjoining Derivation. Computational Linguistics, 20 (1), (1994) 91-124.
20. Schabes Y. and Waters R. C.: Tree Insertion Grammar: A Cubic-Time Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced. Computational Linguistics, 21 (4), (1995) 479-514.
21. Schabes Y.: Mathematical and Computational Aspects of Lexicalized Grammars, Ph.D. Thesis, University of Pennsylvania, USA, (1990).
22. Sedgewick R. and Flajolet P: An Introduction to the Analysis of Algorithms. Addison-Wesley (1996).
23. Shanker V.: A Study of Tree Adjoining Grammars. PhD. Thesis, University of Pennsylvania, USA, 1987.
24. Vanneschi L., Tomassini M, Collard P., and Clergue M: Fitness Distance Correlation in Structural Mutation Genetic Programming. In Proceedings of EuroGP 2003, Ryan C. et al (Eds), LNCS 2610, Springer Verlag, (2003) 455-464.
25. Vanneschi L., Tomassini M, Collard P., and Clergue M: Fitness Distance Correlation in Genetic Programming: a Constructive Counterexample In Proceedings of Congress on Evolutionary Computation (CEC'2003), IEEE Press (2003) 289-296.
26. Weir D. J.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD. Thesis, University of Pennsylvania, USA, (1988).
27. Whigham P. A.: Grammatical Bias for Evolutionary Learning. Ph.D Thesis, University of New South Wales, Australia, (1996).
28. Whigham P. A.: Grammatically-based Genetic Programming. In: Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, Morgan Kaufmann Pub (1995) 33-41.
29. Whigham P. A.: Search Bias, Language Bias and Genetic Programming. In: Genetic Programming 1996, The MIT Press, USA, (1996) 230-237.
30. Wong M. L. and Leung K. S.: Evolutionary Program Induction Directed by Logic Grammars. Evolutionary Computation, 5 (1997) 143-180.