{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:30:53Z","timestamp":1755599453955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030166915"},{"type":"electronic","value":"9783030166922"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16692-2_34","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T19:44:24Z","timestamp":1554839064000},"page":"504-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Improving NeuroEvolution Efficiency by Surrogate Model-Based Optimization with Phenotypic Distance Kernels"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Stork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Zaefferer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Bartz-Beielstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,30]]},"reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-7012(00)00201-3","volume":"43","author":"IA Basheer","year":"2000","unstructured":"Basheer, I.A., Hajmeer, M.: Artificial neural networks: fundamentals, computing, design, and application. J. Microbiol. Methods 43(1), 3\u201331 (2000)","journal-title":"J. Microbiol. Methods"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/106365602320169811","volume":"10","author":"KO Stanley","year":"2002","unstructured":"Stanley, K.O., Miikkulainen, R.: Evolving neural networks through augmenting topologies. Evol. Comput. 10(2), 99\u2013127 (2002)","journal-title":"Evol. Comput."},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"JF Miller","year":"2000","unstructured":"Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121\u2013132. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/978-3-540-46239-2_9"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Turner, A.J., Miller, J.F.: Cartesian genetic programming encoded artificial neural networks: a comparison using three benchmarks. In: Proceedings of GECCO 2013, pp. 1005\u20131012. ACM (2013)","DOI":"10.1145\/2463372.2463484"},{"key":"34_CR5","series-title":"Applications in Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7551-4","volume-title":"Surrogate-based Modeling and Optimization","author":"S Koziel","year":"2013","unstructured":"Koziel, S., Leifsson, L.: Surrogate-based Modeling and Optimization. Applications in Engineering. Springer, New York (2013). \n                      https:\/\/doi.org\/10.1007\/978-1-4614-7551-4"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.asoc.2017.01.039","volume":"55","author":"T Bartz-Beielstein","year":"2017","unstructured":"Bartz-Beielstein, T., Zaefferer, M.: Model-based methods for continuous and discrete global optimization. Appl. Soft Comput. 55, 154\u2013167 (2017)","journal-title":"Appl. Soft Comput."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Zaefferer, M., Stork, J., Friese, M., Fischbach, A., Naujoks, B., Bartz-Beielstein, T.: Efficient global optimization for combinatorial problems. In: Proceedings of GECCO 2014, pp. 871\u2013878. ACM (2014)","DOI":"10.1145\/2576768.2598282"},{"key":"34_CR8","unstructured":"Stork, J., Zaefferer, M., Bartz-Beielstein, T.: Distance-based kernels for surrogate model-based neuroevolution. arXiv preprint \n                      arXiv:1807.07839\n                      \n                     (2018)"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-99259-4_18","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"M Zaefferer","year":"2018","unstructured":"Zaefferer, M., Stork, J., Flasch, O., Bartz-Beielstein, T.: Linear combination of distance measures for surrogate models in genetic programming. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 220\u2013231. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99259-4_18"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Gaier, A., Asteroth, A., Mouret, J.B.: Data-efficient neuroevolution with kernel-based surrogate models. In: Genetic and Evolutionary Computation Conference (GECCO) (2018)","DOI":"10.1145\/3205455.3205510"},{"issue":"3","key":"34_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1162\/EVCO_a_00133","volume":"23","author":"T Hildebrandt","year":"2015","unstructured":"Hildebrandt, T., Branke, J.: On using surrogates with genetic programming. Evol. Comput. 23(3), 343\u2013367 (2015)","journal-title":"Evol. Comput."},{"key":"34_CR12","unstructured":"Stork, J., Bartz-Beielstein, T., Fischbach, A., Zaefferer, M.: Surrogate assisted learning of neural networks. In: GMA CI-Workshop 2017 (2017)"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10710-014-9233-1","volume":"16","author":"AJ Turner","year":"2015","unstructured":"Turner, A.J., Miller, J.F.: Introducing a cross platform open source Cartesian genetic programming library. Genet. Program. Evolvable Mach. 16(1), 83\u201391 (2015)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"34_CR14","doi-asserted-by":"publisher","DOI":"10.1002\/9780470770801","volume-title":"Engineering Design via Surrogate Modelling","author":"A Forrester","year":"2008","unstructured":"Forrester, A., Sobester, A., Keane, A.: Engineering Design via Surrogate Modelling. Wiley, Hoboken (2008)"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-20364-0_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"A Moraglio","year":"2011","unstructured":"Moraglio, A., Kattan, A.: Geometric generalisation of surrogate model based optimisation to combinatorial spaces. In: Merz, P., Hao, J.-K. (eds.) EvoCOP 2011. LNCS, vol. 6622, pp. 142\u2013154. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-20364-0_13"},{"key":"34_CR16","unstructured":"Mockus, J., Tiesis, V., Zilinskas, A.: The application of Bayesian methods for seeking the extremum. In: Towards Global Optimization 2, North-Holland, pp. 117\u2013129 (1978)"},{"issue":"4","key":"34_CR17","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4), 455\u2013492 (1998)","journal-title":"J. Global Optim."},{"key":"34_CR18","unstructured":"Zaefferer, M.: Combinatorial Efficient Global Optimization in R - CEGO v2.2.0. \n                      https:\/\/cran.r-project.org\/package=CEGO\n                      \n                     (2017), \n                      https:\/\/cran.r-project.org\/package=CEGO\n                      \n                    . Accessed 10 Jan 2018"},{"issue":"1","key":"34_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endow. 2(1), 25\u201336 (2009)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16692-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:05:28Z","timestamp":1558343128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16692-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030166915","9783030166922"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16692-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2019\/cfp_evoapps.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"MyReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}