{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:44:34Z","timestamp":1725529474645},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540879862"},{"type":"electronic","value":"9783540879879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87987-9_17","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:20:06Z","timestamp":1237288806000},"page":"169-182","source":"Crossref","is-referenced-by-count":0,"title":["Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor"],"prefix":"10.1007","author":[{"given":"Daniil","family":"Ryabko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TIT.1972.1054753","volume":"8","author":"S. Arimoto","year":"1972","unstructured":"Arimoto, S.: An algorithm for computing the capacity of arbitrary discrete memoryless channels. IEEE Transactions on Information Theory\u00a0IT-I 8, 14\u201320 (1972)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_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":"17_CR3","unstructured":"Gallager, R.: Source Coding With Side Information and Universal Coding (unplublished) M.I.T. LIDS-P-937 (1976) (revised 1979)"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/18.605594","volume":"43","author":"D. Haussler","year":"1997","unstructured":"Haussler, D.: A General Minimax Result for Relative Entropy. IEEE Transactions on Information Theory\u00a043(4), 1276\u20131280 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/b138233","volume-title":"Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability","author":"M. Hutter","year":"2005","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin (2005)"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1111\/1468-0262.00055","volume":"67","author":"M. Jackson","year":"1999","unstructured":"Jackson, M., Kalai, E., Smorodinsky, R.: Bayesian representation of stochastic processes under learning: de Finetti revisited. Econometrica\u00a067(4), 794\u2013875 (1999)","journal-title":"Econometrica"},{"key":"17_CR7","volume-title":"Universal Compression and Retrival","author":"R. Krichevsky","year":"1993","unstructured":"Krichevsky, R.: Universal Compression and Retrival. Kluwer Academic Publishers, Dordrecht (1993)"},{"issue":"2","key":"17_CR8","first-page":"134","volume":"15","author":"B. Ryabko","year":"1979","unstructured":"Ryabko, B.: Coding of a source with unknown but ordered probabilities. Problems of Information Transmission\u00a015(2), 134\u2013138 (1979)","journal-title":"Problems of Information Transmission"},{"key":"17_CR9","first-page":"87","volume":"24","author":"B. Ryabko","year":"1988","unstructured":"Ryabko, B.: Prediction of random sequences and universal coding. Problems of Information Transmission\u00a024, 87\u201396 (1988)","journal-title":"Problems of Information Transmission"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-007-0037-z","volume":"49","author":"D. Ryabko","year":"2007","unstructured":"Ryabko, D.: On sample complexity for computational classification problems. Algorithmica\u00a049(1), 69\u201377 (2007)","journal-title":"Algorithmica"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Ryabko, D., Hutter, M.: On sequence prediction for arbitrary measures. In: Proc. 2007 IEEE International Symposium on Information Theory, Nice, France, pp. 2346\u20132350 (2007)","DOI":"10.1109\/ISIT.2007.4557570"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.aml.2007.04.004","volume":"21","author":"D. Ryabko","year":"2008","unstructured":"Ryabko, D., Hutter, M.: Predicting Non-Stationary Processes. Applied Mathematics Letters\u00a021(5), 477\u2013482 (2008)","journal-title":"Applied Mathematics Letters"},{"key":"17_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2539-1","volume-title":"Probability","author":"A. Shiryaev","year":"1996","unstructured":"Shiryaev, A.: Probability. Springer, Heidelberg (1996)"},{"key":"17_CR14","first-page":"3","volume":"23","author":"Y.. Shtarkov","year":"1988","unstructured":"Shtarkov, Yu.: Universal sequential coding of single messages. Problems of Information Transmission\u00a023, 3\u201317 (1988)","journal-title":"Problems of Information Transmission"},{"key":"17_CR15","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. Information Theory\u00a0IT-24, 422\u2013432 (1978)","journal-title":"IEEE Trans. Information Theory"},{"key":"17_CR16","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. John Wiley & Sons, Inc., New York (1998)"},{"issue":"2","key":"17_CR17","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/18.825803","volume":"46","author":"Q. Xie","year":"1997","unstructured":"Xie, Q., Barron, A.: Asymptotic minimax regret for data compression, gambling, and prediction. IEEE Transactions on Information Theory\u00a046(2), 431\u2013445 (1997)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87987-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:53:27Z","timestamp":1619524407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87987-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540879862","9783540879879"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87987-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}