{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T05:28:45Z","timestamp":1744349325252},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_37","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:10:53Z","timestamp":1279840253000},"page":"506-521","source":"Crossref","is-referenced-by-count":6,"title":["Sequence Prediction Based on Monotone Complexity"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Hutter","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","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 Transactions on Information Theory\u00a037, 1034\u20131054 (1991)","journal-title":"IEEE Transactions on Information Theory"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(83)90139-1","volume":"22","author":"P. G\u00e1cs","year":"1983","unstructured":"G\u00e1cs, P.: On the relation between descriptional complexity and algorithmic probability. Theoretical Computer Science\u00a022, 71\u201393 (1983)","journal-title":"Theoretical Computer Science"},{"key":"37_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44795-4_21","volume-title":"Machine Learning: ECML 2001","author":"M. Hutter","year":"2001","unstructured":"Hutter, M.: Convergence and error bounds of universal prediction for general alphabet. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol.\u00a02167, pp. 239\u2013250. Springer, Heidelberg (2001)"},{"issue":"4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1006\/jcss.2000.1743","volume":"62","author":"M. Hutter","year":"2001","unstructured":"Hutter, M.: New error bounds for Solomonoff prediction. Journal of Computer and System Sciences\u00a062(4), 653\u2013667 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR5","unstructured":"Hutter, M.: Convergence and loss bounds for Bayesian sequence prediction. Technical Report IDSIA-09-01, IDSIA, Manno(Lugano), CH (2002), \n                    \n                      http:\/\/arxiv.org\/abs\/cs.LG\/0301014"},{"key":"37_CR6","volume-title":"Stochastic Systems: Estimation, Identification, and Adaptive Control","author":"P.R. Kumar","year":"1986","unstructured":"Kumar, P.R., Varaiya, P.P.: Stochastic Systems: Estimation, Identification, and Adaptive Control. Prentice Hall, Englewood Cliffs (1986)"},{"issue":"5","key":"37_CR7","first-page":"1413","volume":"14","author":"L.A. Levin","year":"1973","unstructured":"Levin, L.A.: On the notion of a random sequence. Soviet Math. Dokl.\u00a014(5), 1413\u20131416 (1973)","journal-title":"Soviet Math. Dokl."},{"key":"37_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"37_CR9","unstructured":"Schmidhuber, J.: Algorithmic theories of everything. Report IDSIA-20-00, quant-ph\/0011122, IDSIA, Manno (Lugano), Switzerland (2000)"},{"issue":"1\u201322","key":"37_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference: Part 1 and 2. Inform. Control\u00a07, 1\u201322, 224\u2013254 (1964)","journal-title":"Inform. Control"},{"key":"37_CR11","doi-asserted-by":"crossref","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 IT - 24, 422\u2013432 (1978)","journal-title":"IEEE Trans. Inform. Theory IT -"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/279943.279947","volume-title":"Proceedings of the 11th Annual Conference on Computational Learning Theory (COLT 1998)","author":"V.G. Vovk","year":"1998","unstructured":"Vovk, V.G., Watkins, C.: Universal portfolio selection. In: Proceedings of the 11th Annual Conference on Computational Learning Theory (COLT 1998), pp. 12\u201323. ACM Press, New York (1998)"},{"issue":"6","key":"37_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys\u00a025(6), 83\u2013124 (1970)","journal-title":"Russian Mathematical Surveys"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T07:23:23Z","timestamp":1552807403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}