{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:17:22Z","timestamp":1743099442320,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540389903"},{"type":"electronic","value":"9783540389910"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_101","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"998-1007","source":"Crossref","is-referenced-by-count":9,"title":["Model Complexity vs. Performance in the Bayesian Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Elon S.","family":"Correa","sequence":"first","affiliation":[]},{"given":"Jonathan L.","family":"Shapiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"101_CR1","first-page":"729","volume":"16","author":"L. Berthier","year":"2004","unstructured":"Berthier, L., Young, A.P.: Time and length scales in spin glasses. Journal of Physics: Condensed Matter\u00a016, 729\u2013734 (2004)","journal-title":"Journal of Physics: Condensed Matter"},{"key":"101_CR2","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-44652-4_22","volume-title":"Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"C. Borgelt","year":"2001","unstructured":"Borgelt, C., Kruse, R.: An empirical investigation of the k2 metric. In: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Toulouse, France, pp. 240\u2013251. Springer, Heidelberg (2001)"},{"key":"101_CR3","first-page":"102","volume-title":"Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence","author":"R.R. Bouckaert","year":"1994","unstructured":"Bouckaert, R.R.: Properties of Bayesian belief network learning algorithms. In: de Mantaras, R.L., Poole, D. (eds.) Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, Seattle, WA, USA, pp. 102\u2013109. Morgan Kaufmann, San Francisco (1994)"},{"key":"101_CR4","unstructured":"Chickering, D.M., Geiger, D., Heckerman, D.: Learning Bayesian networks is NP-hard. Technical Report MSR-TR-94-17, Microsoft Research (November 1994)"},{"key":"101_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the third Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, USA, May 1971, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"101_CR6","unstructured":"Cooper, G.F., Herskovits, E.: A Bayesian method for induction of probabilistic networks from data. Technical Report SMI-91-01, University of Pittsburgh, Pittsburgh, PA, USA (January 1991)"},{"key":"101_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1613\/jair.7","volume":"1","author":"I.P. Gent","year":"1993","unstructured":"Gent, I.P., Walsh, T.: An empirical analysis of search in GSAT. Artificial Intelligence Research\u00a01, 47\u201359 (1993)","journal-title":"Artificial Intelligence Research"},{"key":"101_CR8","unstructured":"Gu, J., Pardalos, P., Du, D.-Z.: Satisfiability problem: theory and applications. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a035. American Mathematical Society (October 1997)"},{"key":"101_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3502-4","volume-title":"Bayesian networks and decision graphs","author":"F.V. Jensen","year":"2001","unstructured":"Jensen, F.V.: Bayesian networks and decision graphs, 1st edn. Springer, Heidelberg (2001)","edition":"1"},{"key":"101_CR10","first-page":"459","volume-title":"Proceedings of the tenth National Conference on Artificial Intelligence","author":"D.G. Mitchell","year":"1992","unstructured":"Mitchell, D.G., Selman, B., Levesque, H.J.: Hard and easy distributions for SAT problems. In: Rosenbloom, P., Szolovits, P. (eds.) Proceedings of the tenth National Conference on Artificial Intelligence, pp. 459\u2013465. AAAI Press, Menlo Park (1992)"},{"key":"101_CR11","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference, 1st edn. Morgan Kaufmann, San Francisco (1988)","edition":"1"},{"key":"101_CR12","unstructured":"Pelikan, M.: Bayesian optimization algorithm: from single level to hierarchy. PhD thesis, Department of Computer Science at the University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA (2002)"},{"key":"101_CR13","first-page":"216","volume-title":"Workshop of the Genetic and Evolutionary Computation Conference - GECCO 2000","author":"M. Pelikan","year":"2000","unstructured":"Pelikan, M., Goldberg, D.E.: Research on the Bayesian optimization algorithm. In: Wu, A.S. (ed.) Workshop of the Genetic and Evolutionary Computation Conference - GECCO 2000, Las Vegas, NV, USA, pp. 216\u2013219. Morgan Kaufmann, San Francisco (2000)"},{"key":"101_CR14","first-page":"525","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999","author":"M. Pelikan","year":"1999","unstructured":"Pelikan, M., Goldberg, D.E., Cant\u00fa-Paz, E.: BOA: the Bayesian optimization algorithm. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, Orlando, Florida, USA, vol.\u00a01, pp. 525\u2013532. Morgan Kaufmann, San Francisco (1999)"},{"key":"101_CR15","unstructured":"Pennock, D.M., Stout, Q.F.: Exploiting a theory of phase transitions in three-satisfiability problems. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), Portland, OR, USA, August 1996, pp. 253\u2013258 (1996)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:16:33Z","timestamp":1664241393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11844297_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}