{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:53:52Z","timestamp":1725753232841},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449574"},{"type":"electronic","value":"9783642449581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44958-1_31","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T10:54:01Z","timestamp":1382439241000},"page":"399-410","source":"Crossref","is-referenced-by-count":1,"title":["MDL\/Bayesian Criteria Based on Universal Coding\/Measure"],"prefix":"10.1007","author":[{"given":"Joe","family":"Suzuki","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1214\/aop\/1176992813","volume":"13","author":"A.R. Barron","year":"1985","unstructured":"Barron, A.R.: The Strong Ergodic Theorem for Densities: Generalized Shannon-McMillan-Breiman Theorem. Annals. Probability\u00a013(4), 1292\u20131303 (1985)","journal-title":"Annals. Probability"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01889584","volume":"2","author":"W.L. Buntine","year":"1991","unstructured":"Buntine, W.L.: Learning Classification Trees. Statistics and Computing\u00a02, 63\u201373 (1991)","journal-title":"Statistics and Computing"},{"key":"31_CR3","volume-title":"Probability & Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability & Measure, 3rd edn. Wiley, New York (1995)","edition":"3"},{"key":"31_CR4","first-page":"309","volume":"9","author":"G.F. Cooper","year":"1992","unstructured":"Cooper, G.F., Herskovits, E.: A Bayesian Method for the Induction of Probabilistic Networks from Data. Machine Learning\u00a09, 309\u2013347 (1992)","journal-title":"Machine Learning"},{"key":"31_CR5","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1995","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, New York (1995)","edition":"2"},{"issue":"5","key":"31_CR6","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1093\/comjnl\/bxm117","volume":"51","author":"D.L. Dowe","year":"2008","unstructured":"Dowe, D.L.: Foreword re C. S. Wallace. Computer Journal\u00a051(5), 523\u2013560 (2008), Christopher Stewart WALLACE (1933-2004) memorial special issue","journal-title":"Computer Journal"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Dowe, D.L.: MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness. In: Bandyopadhyay, P.S., Forster, M.R. (eds.) Handbook of the Philosophy of Science (HPS). Philosophy of Statistics, vol.\u00a07, pp. 901\u2013982. Elsevier (June 2011)","DOI":"10.1016\/B978-0-444-51862-0.50030-7"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","volume":"27","author":"R.E. Krichevsky","year":"1981","unstructured":"Krichevsky, R.E., Trofimov, V.K.: The Performance of Universal Encoding. IEEE Trans. Inform. Theory\u00a027(2), 199\u2013207 (1981)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S. Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Statistics\u00a022(1), 79\u201386 (1951)","journal-title":"Ann. Math. Statistics"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica\u00a014, 465\u2013471 (1978)","journal-title":"Automatica"},{"issue":"9","key":"31_CR11","doi-asserted-by":"publisher","first-page":"4309","DOI":"10.1109\/TIT.2009.2025546","volume":"55","author":"B. Ryabko","year":"2009","unstructured":"Ryabko, B.: Compression-Based Methods for Nonparametric Prediction and Estimation of Some Characteristics of Time Series. IEEE Trans. on Inform. Theory\u00a055(9), 4309\u20134315 (2009)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"22","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A Formal Theory of Inductive Inference. Information and Control\u00a022, 224\u2013254 (1964)","journal-title":"Information and Control"},{"issue":"11","key":"31_CR13","doi-asserted-by":"publisher","first-page":"4767","DOI":"10.1109\/TIT.2006.883611","volume":"52","author":"J. Suzuki","year":"2006","unstructured":"Suzuki, J.: On Strong Consistency of Model Selection in Classification. IEEE Trans. on Inform. Theory\u00a052(11), 4767\u20134774 (2006)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Suzuki, J.: A Construction of Bayesian Networks from Databases on an MDL Principle. In: The Ninth Conference on Uncertainty in Artificial Intelligence, vol.\u00a07, pp. 266\u2013273 (1993)","DOI":"10.1016\/B978-1-4832-1451-1.50037-8"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Suzuki, J.: The Universal Measure for General Sources and its Application to MDL\/Bayesian Criteria. In: Data Compression Conference 2011, Snowbird, Utah (2011)","DOI":"10.1109\/DCC.2011.82"},{"issue":"2","key":"31_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"C.S. Wallace","year":"1968","unstructured":"Wallace, C.S., Boulton, D.M.: An information measure for classification. Computer Journal\u00a011(2), 185\u2013194 (1968)","journal-title":"Computer Journal"},{"key":"31_CR17","unstructured":"Wallace, C.S.: Statistical and Inductive Inference by Minimum Message Length. Springer (2005) ISBN: 0-387-23795-X"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44958-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:54:25Z","timestamp":1558637665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}