{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:32:36Z","timestamp":1775838756733,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642158827","type":"print"},{"value":"9783642158834","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15883-4_16","type":"book-chapter","created":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T09:29:46Z","timestamp":1282037386000},"page":"243-258","source":"Crossref","is-referenced-by-count":2,"title":["Automatic Model Adaptation for Complex Structured Domains"],"prefix":"10.1007","author":[{"given":"Geoffrey","family":"Levine","sequence":"first","affiliation":[]},{"given":"Gerald","family":"DeJong","sequence":"additional","affiliation":[]},{"given":"Li-Lun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Rajhans","family":"Samdani","sequence":"additional","affiliation":[]},{"given":"Shankar","family":"Vembu","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Roth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The Minimum Description Length Principle","author":"P. Grunwald","year":"2007","unstructured":"Grunwald, P.: The Minimum Description Length Principle. MIT Press, Cambridge (2007)"},{"issue":"6","key":"16_CR2","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H. Akaike","year":"1974","unstructured":"Akaike, H.: A new look at the statistical model identification. IEEE Transactions on Automatic Control\u00a019(6), 716\u2013723 (1974)","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G.E. Schwarz","year":"1978","unstructured":"Schwarz, G.E.: Estimating the dimension of a model. Annals of Statistics\u00a06(2), 461\u2013464 (1978)","journal-title":"Annals of Statistics"},{"key":"16_CR4","unstructured":"ESPN: Fantasy football, http:\/\/games.espn.go.com\/frontpage\/football (Online; accessed 15-April-2008)"},{"key":"16_CR5","volume-title":"Introduction to Mathematical Statistics","author":"R. Hogg","year":"2005","unstructured":"Hogg, R., McKean, J., Craig, A.: Introduction to Mathematical Statistics. Pearson Prentice Hall, London (2005)"},{"key":"16_CR6","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: A Library for Support Vector Machines (2001), http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"key":"16_CR7","unstructured":"Krueger, M.: Player rankings and projections - ff today, http:\/\/www.fftoday.com\/rankings\/index.html (Online; accessed 8-April-2008)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1162\/153244303321897717","volume":"3","author":"D. Chickering","year":"2002","unstructured":"Chickering, D.: Optimal structure identification with greedy search. Journal of Machine Learning Research\u00a03, 507\u2013554 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"16_CR9","unstructured":"Friedman, N., Yakhini, Z.: On the sample complexity of learning bayesian networks. In: The 12th Conference on Uncertainty in Artificial Intelligence (1996)"},{"key":"16_CR10","first-page":"1287","volume":"5","author":"D. Chickering","year":"2004","unstructured":"Chickering, D.: Large-sample learning of bayesian networks is np-hard. Journal of Machine Learning Research\u00a05, 1287\u20131330 (2004)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C. Chow","year":"1968","unstructured":"Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory\u00a014(3), 462\u2013467 (1968)","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0004-3702(02)00360-0","volume":"143","author":"N. Srebro","year":"2003","unstructured":"Srebro, N.: Maximum likelihood bounded tree-width markov networks. Artificial Intelligence\u00a0143, 123\u2013138 (2003)","journal-title":"Artificial Intelligence"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Brooks, S., Giudici, P., Roberts, G.: Efficient construction of reversible jump markov chain monte carlo proposal distributions. Journal of the Royal Statistical Society\u00a0(65), 3\u201355 (2003)","DOI":"10.1111\/1467-9868.03711"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15883-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:09Z","timestamp":1606185729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15883-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158827","9783642158834"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15883-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}