Context Tree Switching
暂无分享,去创建一个
Joel Veness | Michael H. Bowling | Marcus Hutter | Kee Siong Ng | K. S. Ng | Michael Bowling | J. Veness | Marcus Hutter
[1] Raphail E. Krichevsky,et al. The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.
[2] Ian H. Witten,et al. Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..
[3] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[4] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[5] Frans M. J. Willems,et al. The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.
[6] Frans M. J. Willems,et al. Coding for a binary independent piecewise-identically-distributed source , 1996, IEEE Trans. Inf. Theory.
[7] F. Willems,et al. Live-and-die coding for binary piecewise i.i.d. sources , 1997, Proceedings of IEEE International Symposium on Information Theory.
[8] F. Willems,et al. Complexity reduction of the context-tree weighting algorithm : a study for KPN Research , 1997 .
[9] Frans M. J. Willems,et al. Switching between two universal source coding algorithms , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).
[10] F. Willems,et al. Reflections on “ The Context-Tree Weighting Method : Basic Properties ” , 2002 .
[11] Mark Herbster,et al. Tracking the Best Expert , 1995, Machine Learning.
[12] Ran El-Yaniv,et al. On Prediction Using Variable Order Markov Models , 2004, J. Artif. Intell. Res..
[13] Y. Shtarkov,et al. The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.
[14] Steven de Rooij,et al. Catching Up Faster in Bayesian Model Selection and Model Averaging , 2007, NIPS.
[15] Yee Whye Teh,et al. Lossless Compression Based on the Sequence Memoizer , 2010, 2010 Data Compression Conference.