{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:40:28Z","timestamp":1740336028953,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213468"},{"type":"electronic","value":"9783540246503"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24650-3_7","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:08:29Z","timestamp":1280761709000},"page":"67-77","source":"Crossref","is-referenced-by-count":6,"title":["Toward an Alternative Comparison between Different Genetic Programming Systems"],"prefix":"10.1007","author":[{"given":"Nguyen Xuan","family":"Hoai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. I.","family":"McKay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Essam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. A.","family":"Abbass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055923","volume-title":"Genetic Programming: An Introduction","author":"W. Banzhaf","year":"1998","unstructured":"Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction. Morgan Kaufmann Pub., San Francisco (1998)"},{"doi-asserted-by":"crossref","unstructured":"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\u2013543 (2001)","key":"7_CR2","DOI":"10.1109\/CEC.2001.934438"},{"unstructured":"Blickle, T., Thiele, L.: Genetic Programming and Redundancy. In: Hopf, J. (ed.) Genetic Algorithms within the Framework of Evolutionary Computation, pp. 33\u201338 (1994)","key":"7_CR3"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-61723-X_1020","volume-title":"PPSN IV","author":"T. Blickle","year":"1996","unstructured":"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\u2013573. Springer, Heidelberg (1996)"},{"key":"7_CR5","first-page":"403","volume-title":"Proc. The Genetic and Evolutionary Computation (GECCO 2000)","author":"M.C.J. Bot","year":"2000","unstructured":"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\u2013410. Morgan-Kaufman Publishers, San Francisco (2000)"},{"unstructured":"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\u201328 (1999)","key":"7_CR6"},{"unstructured":"Daida, J.M., Ampy, D.S., Ratanasavetavadhana, M., Li, H., Chaudhri, O.A.: Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson\u2019s Magic, 11-10-2003 (2003), Accessed at http:\/\/citeseer.nj.nec.com\/257412.html","key":"7_CR7"},{"key":"7_CR8","first-page":"122","volume-title":"Genetic Programming 1997: Proceedings of the Second Annual Conference","author":"J.M. Daida","year":"1998","unstructured":"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\u2013127. Morgan Kaufman Publishers, San Francisco (1998)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1025122906870","volume":"4","author":"E.D. Dejong","year":"2003","unstructured":"Dejong, E.D., Pollack, J.B.: Multi-Objective Methods for Tree Size Control. Genetic Programming and Evolvable Machines\u00a04, 211\u2013233 (2003)","journal-title":"Genetic Programming and Evolvable Machines"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1010070616149","volume":"2","author":"A. Ekart","year":"2001","unstructured":"Ekart, A., Nemeth, S.Z.: Selection Based on the Pareto Non-domination Criterion for Controlling Code Growth in Genetic Programming. Genetic Programming & Evolvable Machines\u00a02(1), 61\u201373 (2001)","journal-title":"Genetic Programming & Evolvable Machines"},{"unstructured":"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\u201399 (2001)","key":"7_CR11"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-36599-0_31","volume-title":"Genetic Programming","author":"N.X. Hoai","year":"2003","unstructured":"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.\u00a02610, pp. 335\u2013344. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"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\u20131331 (2002)","key":"7_CR13","DOI":"10.1109\/CEC.2002.1004435"},{"issue":"2","key":"7_CR14","first-page":"87","volume":"13","author":"C. Ferreira","year":"2001","unstructured":"Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex Systems\u00a013(2), 87\u2013129 (2001)","journal-title":"Complex Systems"},{"key":"7_CR15","first-page":"122","volume-title":"Genetic Programming 1998: Proceedings of the Third Annual Conference","author":"T. Haynes","year":"1998","unstructured":"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\u2013127. Morgan Kaufman Publishers, San Francisco (1998)"},{"key":"7_CR16","volume-title":"Advances in Genetic Programming","author":"H. Iba","year":"1994","unstructured":"Iba, H., Garis, H., Sato, T.: Genetic Programming Using a Minimum Description Length Principle. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming,\u00a0ch. 12. MIT Press, Cambridge (1994)"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A.K. Joshi","year":"1975","unstructured":"Joshi, A.K., Levy, L.S., Takahashi, M.: Tree Adjunct Grammars. Journal of Computer and System Sciences\u00a010(1), 136\u2013163 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages","author":"A.K. Joshi","year":"1997","unstructured":"Joshi, A.K., Schabes, Y.: Tree Adjoining Grammars. In: Rozenberg, G., Saloma, A. (eds.) Handbook of Formal Languages, pp. 69\u2013123. Springer, Heidelberg (1997)"},{"key":"7_CR19","volume-title":"Genetic Programming","author":"J. Koza","year":"1992","unstructured":"Koza, J.: Genetic Programming. MIT Press, Cambridge (1992)"},{"key":"7_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04726-2","volume-title":"Foundations of Genetic Programming","author":"W.B. Langdon","year":"2002","unstructured":"Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)"},{"key":"7_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5731-9","volume-title":"Genetic Programming + Data Structure =Automatic Programming","author":"W.B. Langdon","year":"1998","unstructured":"Langdon, W.B.: Genetic Programming + Data Structure =Automatic Programming. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"7_CR22","first-page":"81","volume-title":"Proceedings of The Genetic and Evolutionary Computation (GECCO 2001)","author":"S. Luke","year":"2001","unstructured":"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\u201388. Morgan Kaufman Publishers, San Francisco (2001)"},{"key":"7_CR23","volume-title":"Machine Learning","author":"T.M. Michell","year":"1997","unstructured":"Michell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"issue":"4","key":"7_CR24","first-page":"349","volume":"4","author":"M. O\u2019Neil","year":"2000","unstructured":"O\u2019Neil, M., Ryan, C.: Grammatical Evolution. IEEE Trans on Evolutionary Computation\u00a04(4), 349\u2013357 (2000)","journal-title":"IEEE Trans on Evolutionary Computation"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1162\/evco.1998.6.4.293","volume":"6","author":"T. Soule","year":"1999","unstructured":"Soule, T., Foster, J.: Effects of Code Growth and Parsimony Pressure on Population in Genetic Programming. Evolutionary Computation\u00a06(4), 293\u2013309 (1999)","journal-title":"Evolutionary Computation"},{"unstructured":"Whigham, P.A.: Grammatical Bias for Evolutionary Learning. Ph.D Thesis, University of New South Wales, Australia (1996)","key":"7_CR26"},{"issue":"1","key":"7_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1162\/evco.1995.3.1.17","volume":"3","author":"B.T. Zhang","year":"1995","unstructured":"Zhang, B.T., Muhlenbein, H.: Balancing Accuracy and Parsimony in Genetic Programming. Evolutionary Computation\u00a03(1), 17\u201338 (1995)","journal-title":"Evolutionary Computation"},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multi-objective Evolutionary Algorithms: A Comparative Case Study and The Strength Pareto Approach. IEEE Trans on Evolutionary Computation\u00a03(1), 257\u2013271 (1999)","journal-title":"IEEE Trans on Evolutionary Computation"},{"unstructured":"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)","key":"7_CR29"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24650-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:02:25Z","timestamp":1740333745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24650-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213468","9783540246503"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24650-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}