Abstract
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and separate out the effects of different search space sizes and search algorithms. Experimental results are given, comparing the performance and search behavior of Tree Adjoining Grammar Guided Genetic Programming (TAG3P) and Standard Genetic Programming (GP) on some standard problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction. Morgan Kaufmann Pub., San Francisco (1998)
Bleuler, S., Brack, M., Thiele, L., Zitzler, E.: Multiobjective Genetic Programming: Reducing Bloat Using SPEA2. In: Proc. Congress on Evolutionary Computation, CEC 2001, pp. 536–543 (2001)
Blickle, T., Thiele, L.: Genetic Programming and Redundancy. In: Hopf, J. (ed.) Genetic Algorithms within the Framework of Evolutionary Computation, pp. 33–38 (1994)
Blickle, T.: Evolving Compact Solutions in Genetic Programming: A Case Study. In: Voigt, H.M., Ebeling, W., Rechenberg, I., Schwefel, P. (eds.) PPSN IV, pp. 564–573. Springer, Heidelberg (1996)
Bot, M.C.J.: Improving Induction of Linear Classification Tree with Genetic Programming. In: Whitley, D., et al. (eds.) Proc. The Genetic and Evolutionary Computation (GECCO 2000), pp. 403–410. Morgan-Kaufman Publishers, San Francisco (2000)
Candito, M.H., Kahane, S.: Can the TAG Derivation Tree Represent a Semantic Graph? An Answer in the Light of Meaning-Text Theory. In: Proc. of TAG+4, Philadelphia, pp. 25–28 (1999)
Daida, J.M., Ampy, D.S., Ratanasavetavadhana, M., Li, H., Chaudhri, O.A.: Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson’s Magic, 11-10-2003 (2003), Accessed at http://citeseer.nj.nec.com/257412.html
Daida, J.M., Ross, S.J., McClain, J.J., Ampy, D.S., Holczer, M.: Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming. In: Koza, J.R., Deb, K., Dorigo, M., et al. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 122–127. Morgan Kaufman Publishers, San Francisco (1998)
Dejong, E.D., Pollack, J.B.: Multi-Objective Methods for Tree Size Control. Genetic Programming and Evolvable Machines 4, 211–233 (2003)
Ekart, A., Nemeth, S.Z.: Selection Based on the Pareto Non-domination Criterion for Controlling Code Growth in Genetic Programming. Genetic Programming & Evolvable Machines 2(1), 61–73 (2001)
Hoai, N.X., McKay, R.I.: A Framework for Tree Adjunct Grammar Guided Genetic Programming. In: Abbass, H.A., Barlow, M. (eds.) Proceedings of Post Graduate ADFA Conference on Computer Science (PACCS 2001), pp. 93–99 (2001)
Hoai, N.X., McKay, R.I., Abbass, H.A.: Tree Adjoining Grammars, Language Bias, and Genetic Programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 335–344. Springer, Heidelberg (2003)
Hoai, N.X., McKay, R.I., Essam, D., 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), Hawai, pp. 1326–1331 (2002)
Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex Systems 13(2), 87–129 (2001)
Haynes, T.: Perturbing the Representation, Decoding, and Evaluation of Chromosomes. In: Koza, J.R., et al. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 122–127. Morgan Kaufman Publishers, San Francisco (1998)
Iba, H., Garis, H., Sato, T.: Genetic Programming Using a Minimum Description Length Principle. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, ch. 12. MIT Press, Cambridge (1994)
Joshi, A.K., Levy, L.S., Takahashi, M.: Tree Adjunct Grammars. Journal of Computer and System Sciences 10(1), 136–163 (1975)
Joshi, A.K., Schabes, Y.: Tree Adjoining Grammars. In: Rozenberg, G., Saloma, A. (eds.) Handbook of Formal Languages, pp. 69–123. Springer, Heidelberg (1997)
Koza, J.: Genetic Programming. MIT Press, Cambridge (1992)
Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)
Langdon, W.B.: Genetic Programming + Data Structure =Automatic Programming. Kluwer Academic Publishers, Dordrecht (1998)
Luke, S., Panait, L.: A Survey and Comparison of Tree Generation Algorithms. In: Spector, L., et al. (eds.) Proceedings of The Genetic and Evolutionary Computation (GECCO 2001), pp. 81–88. Morgan Kaufman Publishers, San Francisco (2001)
Michell, T.M.: Machine Learning. McGraw-Hill, New York (1997)
O’Neil, M., Ryan, C.: Grammatical Evolution. IEEE Trans on Evolutionary Computation 4(4), 349–357 (2000)
Soule, T., Foster, J.: Effects of Code Growth and Parsimony Pressure on Population in Genetic Programming. Evolutionary Computation 6(4), 293–309 (1999)
Whigham, P.A.: Grammatical Bias for Evolutionary Learning. Ph.D Thesis, University of New South Wales, Australia (1996)
Zhang, B.T., Muhlenbein, H.: Balancing Accuracy and Parsimony in Genetic Programming. Evolutionary Computation 3(1), 17–38 (1995)
Zitzler, E., Thiele, L.: Multi-objective Evolutionary Algorithms: A Comparative Case Study and The Strength Pareto Approach. IEEE Trans on Evolutionary Computation 3(1), 257–271 (1999)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TK), ETH Zurich, Switzerland (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoai, N.X., McKay, R.I.(., Essam, D., Abbass, H.A. (2004). Toward an Alternative Comparison between Different Genetic Programming Systems. In: Keijzer, M., O’Reilly, UM., Lucas, S., Costa, E., Soule, T. (eds) Genetic Programming. EuroGP 2004. Lecture Notes in Computer Science, vol 3003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24650-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24650-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21346-8
Online ISBN: 978-3-540-24650-3
eBook Packages: Springer Book Archive