{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:47Z","timestamp":1725511787087},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_35","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"405-416","source":"Crossref","is-referenced-by-count":0,"title":["On the Consistency of Discrete Bayesian Learning"],"prefix":"10.1007","author":[{"given":"Jan","family":"Poland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11894841_22","volume-title":"Algorithmic Learning Theory","author":"J. Poland","year":"2006","unstructured":"Poland, J.: The missing consistency theorem for Bayesian learning: Stochastic model selection. In: Balc\u00e1zar, J.L., Long, P.M., Stephan, F. (eds.) ALT 2006. LNCS (LNAI), vol.\u00a04264, pp. 259\u2013273. Springer, Heidelberg (2006)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1214\/aoms\/1177704456","volume":"33","author":"D. Blackwell","year":"1962","unstructured":"Blackwell, D., Dubins, L.: Merging of opinions with increasing information. Annals of Mathematical Statistics\u00a033, 882\u2013887 (1962)","journal-title":"Annals of Mathematical Statistics"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/18.54897","volume":"36","author":"B.S. Clarke","year":"1990","unstructured":"Clarke, B.S., Barron, A.R.: Information-theoretic asymptotics of Bayes methods. IEEE Trans. Inform. Theory\u00a036, 453\u2013471 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1109\/18.720554","volume":"44","author":"A.R. Barron","year":"1998","unstructured":"Barron, A.R., Rissanen, J.J., Yu, B.: The minimum description length principle in coding and modeling. IEEE Trans. Inform. Theory\u00a044, 2743\u20132760 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"35_CR5","doi-asserted-by":"crossref","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, 185\u2013194 (1968)","journal-title":"Computer Journal"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C.S. Wallace","year":"1999","unstructured":"Wallace, C.S., Dowe, D.L.: Minimum Message Length and Kolmogorov Complexity. Computer Journal\u00a042, 270\u2013283 (1999)","journal-title":"Computer Journal"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.481776","volume":"42","author":"J.J. Rissanen","year":"1996","unstructured":"Rissanen, J.J.: Fisher Information and Stochastic Complexity. IEEE Trans. Inform. Theory\u00a042, 40\u201347 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/18.86996","volume":"37","author":"A.R. Barron","year":"1991","unstructured":"Barron, A.R., Cover, T.M.: Minimum complexity density estimation. IEEE Trans. Inform. Theory\u00a037, 1034\u20131054 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"35_CR9","volume-title":"Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability","author":"M. Hutter","year":"2004","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin (2004)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"3780","DOI":"10.1109\/TIT.2005.856956","volume":"51","author":"J. Poland","year":"2005","unstructured":"Poland, J., Hutter, M.: Asymptotics of discrete MDL for online prediction. IEEE Transactions on Information Theory\u00a051, 3780\u20133795 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-540-27819-1_23","volume-title":"Learning Theory","author":"P. Gr\u00fcnwald","year":"2004","unstructured":"Gr\u00fcnwald, P., Langford, J.: Suboptimal behaviour of Bayes and MDL in classification under misspecification. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol.\u00a03120, pp. 331\u2013347. Springer, Heidelberg (2004)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Comley, J.W., Dowe, D.L.: Minimum message length and generalized Bayesian nets with asymmetric languages. In: Gr\u00fcnwald, P., Myung, I.J., Pitt, M.A. (eds.) Advances in Minimum Description Length: Theory and Applications, pp. 265\u2013294 (2005)","DOI":"10.7551\/mitpress\/1114.003.0016"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","volume":"24","author":"R.J. Solomonoff","year":"1978","unstructured":"Solomonoff, R.J.: Complexity-based induction systems: comparisons and convergence theorems. IEEE Trans. Inform. Theory\u00a024, 422\u2013432 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11222-006-6746-3","volume":"16","author":"J. Poland","year":"2006","unstructured":"Poland, J., Hutter, M.: MDL convergence speed for Bernoulli sequences. Statistics and Computing\u00a016, 161\u2013175 (2006)","journal-title":"Statistics and Computing"},{"key":"35_CR15","volume-title":"Mathematical Statistics","author":"A.A. Borovkov","year":"1998","unstructured":"Borovkov, A.A., Moullagaliev, A.: Mathematical Statistics. Gordon & Breach, Newark (1998)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T13:19:38Z","timestamp":1707916778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_35","relation":{},"subject":[]}}