{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:13:16Z","timestamp":1725700396765},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315183"},{"type":"electronic","value":"9783642315190"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-31519-0_3","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T10:30:13Z","timestamp":1344853813000},"page":"41-56","source":"Crossref","is-referenced-by-count":5,"title":["Locality in Continuous Fitness-Valued Cases and Genetic Programming Difficulty"],"prefix":"10.1007","author":[{"given":"Edgar","family":"Galvan","sequence":"first","affiliation":[]},{"given":"Leonardo","family":"Trujillo","sequence":"additional","affiliation":[]},{"given":"James","family":"McDermott","sequence":"additional","affiliation":[]},{"given":"Ahmed","family":"Kattan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Altenberg, L.: Fitness Distance Correlation Analysis: An Instructive Counterexample. In: Back, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, San Francisco, CA, USA, pp. 57\u201364 (1997)","key":"3_CR1"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H. Beyer","year":"2002","unstructured":"Beyer, H., Schwefel, H.: Evolution strategies - A comprehensive introduction. Natural Computing\u00a01(1), 3\u201352 (2002)","journal-title":"Natural Computing"},{"unstructured":"D\u2019haeseleer, P., Bluming, J.: Effects of locality in individual and population evolution. In: Kinnear, K.E. (ed.) Advances in Genetic Programming, pp. 177\u2013198 (1994)","key":"3_CR3"},{"doi-asserted-by":"crossref","unstructured":"Galv\u00e1n-L\u00f3pez, E., McDermott, J., O\u2019Neill, M., Brabazon, A.: Defining locality in genetic programming to predict performance. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2010)","key":"3_CR4","DOI":"10.1109\/CEC.2010.5586095"},{"doi-asserted-by":"crossref","unstructured":"Galv\u00e1n-L\u00f3pez, E., McDermott, J., O\u2019Neill, M., Brabazon, A.: Towards an understanding of locality in genetic programming. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO 2010, New York, NY, USA, pp. 901\u2013908 (2010)","key":"3_CR5","DOI":"10.1145\/1830483.1830646"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10710-011-9136-3","volume":"12","author":"E. Galv\u00e1n-L\u00f3pez","year":"2011","unstructured":"Galv\u00e1n-L\u00f3pez, E., McDermott, J., O\u2019Neill, M., Brabazon, A.: Defining locality as a problem difficulty measure in genetic programming. Genetic Programming and Evolvable Machines\u00a012(4), 365\u2013401 (2011)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-642-05258-3_64","volume-title":"MICAI 2009: Advances in Artificial Intelligence","author":"E. Galv\u00e1n-L\u00f3pez","year":"2009","unstructured":"Galv\u00e1n-L\u00f3pez, E., Poli, R.: An empirical investigation of how degree neutrality affects GP search. In: Aguirre, A.H., Borja, R.M., Garci\u00e1, C.A.R. (eds.) MICAI 2009. LNCS, vol.\u00a05845, pp. 728\u2013739. Springer, Heidelberg (2009)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s12530-011-9030-5","volume":"2","author":"E. Galv\u00e1n-L\u00f3pez","year":"2011","unstructured":"Galv\u00e1n-L\u00f3pez, E., Poli, R., Kattan, A., O\u2019Neill, M., Brabazon, A.: Neutrality in evolutionary algorithms... what do we know? Evolving Systems\u00a02(3), 145\u2013163 (2011)","journal-title":"Evolving Systems"},{"key":"3_CR9","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"unstructured":"Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque (1995)","key":"3_CR10"},{"key":"3_CR11","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. The MIT Press, Cambridge (1992)"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/4235.843491","volume":"4","author":"B. Naudts","year":"2000","unstructured":"Naudts, B., Kallel, L.: A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Transactions on Evolutionary Computation\u00a04(1), 1\u201315 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/TEVC.2011.2132726","volume":"16","author":"R. Poli","year":"2012","unstructured":"Poli, R., Galv\u00e1n-L\u00f3pez, E.: The effects of constant and bit-wise neutrality on problem hardness, fitness distance correlation and phenotypic mutation rates. IEEE Trans. Evolutionary Computation\u00a016(2), 279\u2013300 (2012)","journal-title":"IEEE Trans. Evolutionary Computation"},{"unstructured":"Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms, 2nd edn. Physica-Verlag (2006)","key":"3_CR14"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1080\/08948550302439","volume":"8","author":"P.F. Stadler","year":"2003","unstructured":"Stadler, P.F., Stephens, C.R.: Landscapes and Effective Fitness. Comments on Theoretical Biology\u00a08(4), 389\u2013431 (2003)","journal-title":"Comments on Theoretical Biology"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1162\/1063656054088549","volume":"13","author":"M. Tomassini","year":"2005","unstructured":"Tomassini, M., Vanneschi, L., Collard, P., Clergue, M.: A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation\u00a013(2), 213\u2013239 (2005)","journal-title":"Evolutionary Computation"},{"doi-asserted-by":"crossref","unstructured":"Trujillo, L., Mart\u00ednez, Y., Galv\u00e1n-L\u00f3pez, E., Legrand, P.: Predicting problem difficulty for genetic programming applied to data classification. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, New York, NY, USA, pp. 1355\u20131362 (2011)","key":"3_CR17","DOI":"10.1145\/2001576.2001759"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-540-24855-2_76","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"L. Vanneschi","year":"2004","unstructured":"Vanneschi, L., Clergue, M., Collard, P., Tomassini, M., V\u00e9rel, S.: Fitness clouds and problem hardness in genetic programming. In: Deb, K., Tari, Z. (eds.) GECCO 2004. LNCS, vol.\u00a03103, pp. 690\u2013701. Springer, Heidelberg (2004)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-36599-0_43","volume-title":"Genetic Programming","author":"L. Vanneschi","year":"2003","unstructured":"Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness Distance Correlation in Structural Mutation Genetic Programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol.\u00a02610, pp. 455\u2013464. Springer, Heidelberg (2003)"},{"unstructured":"Wright, S.: The Roles of Mutation, Inbreeding, Crossbreeding and Selection in Evolution. In: Jones, D.F. (ed.) Proceedings of the Sixth International Congress on Genetics, vol.\u00a01, pp. 356\u2013366 (1932)","key":"3_CR20"}],"container-title":["Advances in Intelligent Systems and Computing","EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31519-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T20:16:03Z","timestamp":1676146563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31519-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642315183","9783642315190"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31519-0_3","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]}}}