{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:34:28Z","timestamp":1761597268688,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642204067"},{"type":"electronic","value":"9783642204074"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20407-4_3","type":"book-chapter","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T13:23:02Z","timestamp":1303824182000},"page":"25-36","source":"Crossref","is-referenced-by-count":14,"title":["A Quantitative Study of Learning and Generalization in Genetic Programming"],"prefix":"10.1007","author":[{"given":"Mauro","family":"Castelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Manzoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"Vanneschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-01181-8_28","volume-title":"Genetic Programming","author":"N.M. Amil","year":"2009","unstructured":"Amil, N.M., Bredeche, N., Gagn\u00e9, C., Gelly, S., Schoenauer, M., Teytaud, O.: A statistical learning perspective of genetic programming. In: Vanneschi, L., Gustafson, S., Moraglio, A., De Falco, I., Ebner, M. (eds.) EuroGP 2009. LNCS, vol.\u00a05481, pp. 327\u2013338. Springer, Heidelberg (2009)"},{"key":"3_CR2","first-page":"255","volume-title":"GECCO 2006","author":"F. Archetti","year":"2006","unstructured":"Archetti, F., Lanzeni, S., Messina, E., Vanneschi, L.: Genetic programming for human oral bioavailability of drugs. In: Keijzer, M., et al. (eds.) GECCO 2006, vol.\u00a01, pp. 255\u2013262. ACM Press, New York (2006)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-61723-X_994","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"W. Banzhaf","year":"1996","unstructured":"Banzhaf, W., Francone, F.D., Nordin, P.: The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 300\u2013309. Springer, Heidelberg (1996)"},{"key":"3_CR4","volume-title":"Pattern Classification and Scene Analysis","author":"R.O. Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)"},{"key":"3_CR5","first-page":"72","volume-title":"GP 1996","author":"F.D. Francone","year":"1996","unstructured":"Francone, F.D., Nordin, P., Banzhaf, W.: Benchmarking the generalization capabilities of a compiling genetic programming system using sparse data sets. In: Koza, J.R., et al. (eds.) GP 1996, pp. 72\u201380. MIT Press, Cambridge (1996)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11729976_10","volume-title":"Genetic Programming","author":"C. Gagn\u00e9","year":"2006","unstructured":"Gagn\u00e9, C., Schoenauer, M., Parizeau, M., Tomassini, M.: Genetic programming, validation sets, and parsimony pressure. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ek\u00e1rt, A. (eds.) EuroGP 2006. LNCS, vol.\u00a03905, pp. 109\u2013120. Springer, Heidelberg (2006)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/978-3-642-04277-5_77","volume-title":"Artificial Neural Networks \u2013 ICANN 2009","author":"F.J. Gomez","year":"2009","unstructured":"Gomez, F.J., Togelius, J., Schmidhuber, J.: Measuring and optimizing behavioral complexity for evolutionary reinforcement learning. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009. LNCS, vol.\u00a05769, pp. 765\u2013774. Springer, Heidelberg (2009)"},{"key":"3_CR8","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1016379201230","volume":"18","author":"I. Kushchu","year":"2002","unstructured":"Kushchu, I.: An evaluation of evolutionary generalization in genetic programming. Artificial Intelligence Review\u00a018(1), 3\u201314 (2002)","journal-title":"Artificial Intelligence Review"},{"key":"3_CR10","doi-asserted-by":"publisher","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)"},{"issue":"3-4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10710-010-9113-2","volume":"11","author":"M. O\u2019Neill","year":"2010","unstructured":"O\u2019Neill, M., Vanneschi, L., Gustafson, S., Banzhaf, W.: Open issues in genetic programming. Genetic Programming and Evolvable Machines\u00a011(3-4), 339\u2013363 (2010)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"3_CR12","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008), Published via \n                    \n                      http:\/\/lulu.com\n                    \n                    \n                   and freely available at \n                    \n                      http:\/\/www.gp-field-guide.org.uk"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica\u00a014, 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"3_CR14","first-page":"381","volume-title":"GP 1996","author":"J. Rosca","year":"1996","unstructured":"Rosca, J.: Generality versus size in genetic programming. In: Koza, J.R., et al. (eds.) GP 1996, pp. 381\u2013387. MIT Press, Cambridge (1996)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10710-008-9075-9","volume":"10","author":"S. Silva","year":"2009","unstructured":"Silva, S., Costa, E.: Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories. Genetic Programming and Evolvable Machines\u00a010(2), 141\u2013179 (2009)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"3_CR16","first-page":"1115","volume-title":"GECCO 2009","author":"S. Silva","year":"2009","unstructured":"Silva, S., Vanneschi, L.: Operator equalisation, bloat and overfitting: a study on human oral bioavailability prediction. In: Raidl, G., et al. (eds.) GECCO 2009, pp. 1115\u20131122. ACM, New York (2009)"},{"key":"3_CR17","first-page":"877","volume-title":"GECCO 2010","author":"L. Vanneschi","year":"2010","unstructured":"Vanneschi, L., Castelli, M., Silva, S.: Measuring bloat, overfitting and functional complexity in genetic programming. In: GECCO 2010, pp. 877\u2013884. ACM, New York (2010)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-04686-5_6","volume-title":"Progress in Artificial Intelligence","author":"L. Vanneschi","year":"2009","unstructured":"Vanneschi, L., Silva, S.: Using operator equalisation for prediction of drug toxicity with genetic programming. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (eds.) EPIA 2009. LNCS, vol.\u00a05816, pp. 65\u201376. Springer, Heidelberg (2009)"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TEVC.2008.926486","volume":"13","author":"E.J. Vladislavleva","year":"2009","unstructured":"Vladislavleva, E.J., Smits, G.F., den Hertog, D.: Order of nonlinearity as a complexity measure for models generated by symbolic regression via pareto genetic programming. IEEE Transactions on Evolutionary Computation\u00a013(2), 333\u2013349 (2009)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20407-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:16:37Z","timestamp":1558574197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20407-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642204067","9783642204074"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20407-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}