Context tree switching

Data Compression Conference Proceedings

Volumn , Issue , 2012, Pages 327-336

  Veness, Joel ^a   Ng, Kee Siong ^b,c   Hutter, Marcus ^b   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c EMC Greenplum ^*  (Australia)

Author keywords

Context Tree Weighting

Indexed keywords

CALGARY; CONTEXT TREE WEIGHTING; ORIGINAL ALGORITHMS; SPACE COMPLEXITY; SWITCHING TECHNIQUES; WEIGHTING SCHEME;

DATA COMPRESSION; FORESTRY; TREES (MATHEMATICS);

BINARY TREES;

ALGORITHMS; DATA BASES; FORESTRY;

EID: 84862114069     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2012.39     Document Type: Conference Paper

References (18)

1. Ron Begleiter, Ran El-Yaniv, and Golan Yona. On prediction using variable order markov models. Journal of Artificial Intelligence Research, 22:385-421, 2004. (Pubitemid 41525891)
2. C. Bloom. Solving the problem of context modeling. http://www.cbloom.com/ papers/ppmz.pdf, 1998.
3. John G. Cleary, Ian, and Ian H. Witten. Data Compression Using Adaptive Coding and Partial String Matching. IEEE Transactions on Communications, 32:396-402, 1984.
4. J. Gasthaus, F. Wood, and Y. W. Teh. Lossless compression based on the sequence memoizer. In Data Compression Conference, 2010.
5. Mark Herbster and Manfred K. Warmuth. Tracking the best expert. Machine Learning, 32:151-178, August 1998. (Pubitemid 40626079)
6. R. Krichevsky and V. Trofimov. The performance of universal encoding. Information Theory, IEEE Transactions on, 27(2):199-207, 1981.
7. J. Rissanen. Universal coding, information, prediction, and estimation. Information Theory, IEEE Transactions on, 30(4):629-636, jul 1984. ISSN 0018-9448. doi: 10.1109/TIT.1984.1056936. (Pubitemid 14632095)
8. Tim van Erven, Peter Grünwald, and Steven de Rooij. Catching Up Faster in Bayesian Model Selection and Model Averaging. Neural Information Processing Systems (NIPS), 2007.
9. J. Veness, K.S. Ng, M. Hutter, and M. Bowling. Context Tree Switching. Technical Report. http://arxiv.org/abs/1111.3182, 2011.
10. P. Volf. Weighting techniques in data compression: Theory and algorithms. PhD thesis, Eindhoven University of Technology, 2002.
11. Paul A. J. Volf and Frans M. J. Willems. Switching between two universal source coding algorithms. In In Data Compression Conference, pages 491-500, 1998.
12. F. Willems and M. Krom. Live-and-die coding for binary piecewise i.i.d. sources. In Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on, page 68, jun-4 jul 1997. doi: 10.1109/ISIT.1997.612983.
13. F. Willems and T.J. Tjalkens. Complexity Reduction of the Context-Tree Weighting Algorithm: A Study for KPN Research. Tech. Rep. EIDMA Report RS.97.01, 1997.
14. F. M. J. Willems. CTW website. http://www.ele.tue.nl/ctw/, 2011.
15. Frans Willems, Yuri Shtarkov, and Tjalling Tjalkens. Reflections on "The Context Tree Weighting Method: Basic properties". Newsletter of the IEEE Information Theory Society, 47(1), 1997.
16. Frans M. J.Willems. Coding for a binary independent piecewise- identically-distributed source. IEEE Transactions on Information Theory, 42:2210-2217, 1996. (Pubitemid 126771547)
17. Frans M.J.Willems, Yuri M. Shtarkov, and Tjalling J. Tjalkens. The Context TreeWeighting Method: Basic Properties. IEEE Transactions on Information Theory, 41:653-664, 1995.
18. Ian H. Witten, Radford M. Neal, and John G. Cleary. Arithmetic coding for data compression. Commun. ACM, 30: 520-540, June 1987. ISSN 0001-0782.