### Universal prediction of individual sequences

暂无分享，去创建一个

[1] Philip Wolfe,et al. Contributions to the theory of games , 1960 .

[2] H. Robbins,et al. Asymptotic Solutions of the Compound Decision Problem for Two Completely Specified Distributions , 1955 .

[3] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .

[4] Thomas M. Cover,et al. Behavior of sequential predictors of binary sequences , 1965 .

[5] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .

[6] Lee D. Davisson,et al. Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.

[7] G. Chaitin. A Theory of Program Size Formally Identical to Information Theory , 1975, JACM.

[8] Jorma Rissanen,et al. Generalized Kraft Inequality and Arithmetic Coding , 1976, IBM J. Res. Dev..

[9] Abraham Lempel,et al. On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[10] Thomas M. Cover,et al. Compound Bayes Predictors for Sequences with Apparent Markov Structure , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[11] Thomas M. Cover,et al. A convergent gambling estimate of the entropy of English , 1978, IEEE Trans. Inf. Theory.

[12] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[13] Jacob Ziv,et al. Coding theorems for individual sequences , 1978, IEEE Trans. Inf. Theory.

[14] JORMA RISSANEN,et al. A universal data compression system , 1983, IEEE Trans. Inf. Theory.

[15] Glen G. Langdon,et al. A note on the Ziv-Lempel model for compressing individual sequences , 1983, IEEE Trans. Inf. Theory.

[16] Lee D. Davisson,et al. Minimax noiseless universal coding for Markov sources , 1983, IEEE Trans. Inf. Theory.

[17] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.

[18] H. Robbins. Asymptotically Subminimax Solutions of Compound Statistical Decision Problems , 1985 .

[19] Jorma Rissanen,et al. Complexity of strings in the class of Markov sources , 1986, IEEE Trans. Inf. Theory.

[20] J. Rissanen. Stochastic Complexity and Modeling , 1986 .

[21] Meir Feder,et al. Gambling using a finite state machine , 1991, IEEE Trans. Inf. Theory.

[22] Marcelo Weinberger,et al. Upper Bounds On The Probability Of Sequences Emitted By Finite-state Sources And On The Redundancy Of The Lempel-Ziv Algorithm , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[23] P. Krishnan,et al. Optimal prefetching via data compression , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[24] Marcelo J. Weinberger,et al. Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm , 1992, IEEE Trans. Inf. Theory.

[25] Neri Merhav,et al. Universal schemes for sequential decision from individual data sequences , 1993, IEEE Trans. Inf. Theory.