{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:03:06Z","timestamp":1725872586835},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319503486"},{"type":"electronic","value":"9783319503493"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-50349-3_2","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T02:12:11Z","timestamp":1480471931000},"page":"17-31","source":"Crossref","is-referenced-by-count":13,"title":["Surrogate Assisted Feature Computation for Continuous Problems"],"prefix":"10.1007","author":[{"given":"Nacim","family":"Belkhir","sequence":"first","affiliation":[]},{"given":"Johann","family":"Dr\u00e9o","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Sav\u00e9ant","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00453-008-9244-5","volume":"57","author":"A Auger","year":"2009","unstructured":"Auger, A., Teytaud, O.: Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica 57, 121\u2013146 (2009). https:\/\/hal.inria.fr\/inria-00369788","journal-title":"Algorithmica"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preu\u00df, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 313\u2013320. ACM (2012)","DOI":"10.1145\/2330163.2330209"},{"key":"2_CR3","unstructured":"Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking 2010: experimental setup. Technical report RR-7215, INRIA (2010)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos, H.H.: Programming by optimization. Commun. ACM 55(2), 70\u201380 (2012)","journal-title":"Commun. ACM"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods and evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00158-001-0160-4","volume":"23","author":"R Jin","year":"2000","unstructured":"Jin, R., Chen, W., Simpson, T.W.: Comparative studies of metamodeling techniques under multiple modeling criteria. Struct. Multidiscip. Optim. 23, 1\u201313 (2000)","journal-title":"Struct. Multidiscip. Optim."},{"issue":"1","key":"2_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin, Y.: A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput. 9(1), 3\u201312 (2005)","journal-title":"Soft Comput."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Lunacek, M., Whitley, D.: The dispersion metric and the CMA evolution strategy. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 477\u2013484. ACM (2006)","DOI":"10.1145\/1143997.1144085"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of 13th GECCO, pp. 829\u2013836. ACM (2011)","DOI":"10.1145\/2001576.2001690"},{"key":"2_CR10","unstructured":"M\u0131s\u0131r, M., Sebag, M.: Algorithm selection as a collaborative filtering problem. Technical report, INRIA-Saclay (2013). http:\/\/hal.inria.fr\/hal-00922840"},{"issue":"1","key":"2_CR11","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","volume":"19","author":"M Munoz","year":"2015","unstructured":"Munoz, M., Kirley, M., Halgamuge, S.K., et al.: Exploratory landscape analysis of continuous space optimization problems using information content. IEEE Trans. Evol. Comput. 19(1), 74\u201387 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"2_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"33","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 33, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50349-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:06:55Z","timestamp":1568588815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50349-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503486","9783319503493"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50349-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}