{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:49:39Z","timestamp":1725454179080},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341052"},{"type":"electronic","value":"9783642341069"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34106-9_29","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:56:27Z","timestamp":1349070987000},"page":"365-379","source":"Crossref","is-referenced-by-count":2,"title":["Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes"],"prefix":"10.1007","author":[{"given":"Mrinalkanti","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyadev","family":"Nandakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Billingsley, P.: Ergodic Theory and Information. John Wiley & Sons (1965)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning and Games. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546921"},{"issue":"29-30","key":"29_CR3","doi-asserted-by":"publisher","first-page":"2647","DOI":"10.1016\/j.tcs.2010.04.003","volume":"411","author":"A. Chernov","year":"2010","unstructured":"Chernov, A., Kalnishkan, Y., Zhdanov, F., Vovk, V.: Supermartingales in prediction with expert advice. Theor. Comput. Sci.\u00a0411(29-30), 2647\u20132669 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Downarowicz, T.: Entropy in Dynamical Systems. New Mathematical Monographs. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511976155"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/18.133269","volume":"37","author":"M. Feder","year":"1991","unstructured":"Feder, M.: Gambling using a finite state machine. IEEE Transactions on Information Theory\u00a037, 1459\u20131461 (1991)","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/18.144706","volume":"38","author":"M. Feder","year":"1992","unstructured":"Feder, M., Merhav, N., Gutman, M.: Universal prediction of individual sequences. IEEE Transations on Information Theory\u00a038, 1258\u20131270 (1992)","journal-title":"IEEE Transations on Information Theory"},{"key":"29_CR7","unstructured":"Folland, G.B.: Real Analysis. Wiley (1999)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.jcss.2004.10.007","volume":"70","author":"L. Fortnow","year":"2005","unstructured":"Fortnow, L., Lutz, J.H.: Prediction and dimension. Journal of Computer and System Sciences\u00a070, 570\u2013589 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"29_CR9","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1214\/009053604000000553","volume":"32","author":"P.D. Gr\u00fcnwald","year":"2004","unstructured":"Gr\u00fcnwald, P.D., Dawid, A.P.: Game theory, maximum entropy, minimum discrepancy and robust bayesian decision theory. Annals of Statistics\u00a032(4), 1367\u20131433 (2004)","journal-title":"Annals of Statistics"},{"key":"29_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-72927-3_22","volume-title":"Learning Theory","author":"Y. Kalnishkan","year":"2007","unstructured":"Kalnishkan, Y., Vovk, V., Vyugin, M.V.: Generalised Entropy and Asymptotic Complexities of Languages. In: Bshouty, N.H., Gentile, C. (eds.) COLT. LNCS (LNAI), vol.\u00a04539, pp. 293\u2013307. Springer, Heidelberg (2007)"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.tcs.2003.11.005","volume":"313","author":"Y. Kalnishkan","year":"2004","unstructured":"Kalnishkan, Y., Vovk, V., Vyugin, M.V.: Loss functions, complexities, and the Legendre transformation. Theor. Comput. Sci.\u00a0313(2), 195\u2013207 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR12","unstructured":"Khinchin, A.Y.: Mathematical Foundations of Information Theory. Dover Publications (1957)"},{"key":"29_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M. Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"issue":"6","key":"29_CR14","doi-asserted-by":"publisher","first-page":"2124","DOI":"10.1109\/18.720534","volume":"44","author":"N. Merhav","year":"1998","unstructured":"Merhav, N., Feder, M.: Universal prediction. IEEE Transactions on Information Theory\u00a044(6), 2124\u20132147 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Shiryaev, A.N.: Probability, 2nd edn. Graduate Texts in Mathematics, vol.\u00a095. Springer (1995)","DOI":"10.1007\/978-1-4757-2539-1"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Vovk, V.: A game of prediction with expert advice. Journal of Computer and System Sciences, 153\u2013173 (1998)","DOI":"10.1006\/jcss.1997.1556"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Vovk, V.G., Watkins, C.: Universal portfolio selection. In: COLT, pp. 12\u201323 (1998)","DOI":"10.1145\/279943.279947"},{"key":"29_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45435-7_7","volume-title":"Computational Learning Theory","author":"M.V. Vyugin","year":"2002","unstructured":"Vyugin, M.V., V\u2019yugin, V.V.: Predictive Complexity and Information. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 90\u2013105. Springer, Heidelberg (2002)"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/inco.2001.3066","volume":"175","author":"V. V\u2019yugin","year":"2006","unstructured":"V\u2019yugin, V.: Suboptimal measures of predictive complexity for absolute loss function. Information and Computation\u00a0175, 146\u2013157 (2006)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34106-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:53:39Z","timestamp":1687740819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34106-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341052","9783642341069"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34106-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}