Jump to content

Context tree weighting: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Citation bot (talk | contribs)
Add: s2cid, doi, journal. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Data compression | #UCB_Category 5/179
 
(One intermediate revision by one other user not shown)
Line 42: Line 42:
| doi=10.1613/jair.1491
| doi=10.1613/jair.1491
| s2cid=47180476
| s2cid=47180476
| arxiv=1107.0051
}}
}}
== External links ==
== External links ==
Line 50: Line 51:


[[Category:Lossless compression algorithms]]
[[Category:Lossless compression algorithms]]



{{comp-sci-stub}}
{{comp-sci-stub}}

Latest revision as of 05:51, 12 April 2024

The context tree weighting method (CTW) is a lossless compression and prediction algorithm by Willems, Shtarkov & Tjalkens 1995. The CTW algorithm is among the very few such algorithms that offer both theoretical guarantees and good practical performance (see, e.g. Begleiter, El-Yaniv & Yona 2004). The CTW algorithm is an “ensemble method”, mixing the predictions of many underlying variable order Markov models, where each such model is constructed using zero-order conditional probability estimators.

References

[edit]
  • Willems; Shtarkov; Tjalkens (1995), "The Context-Tree Weighting Method: Basic Properties", IEEE Transactions on Information Theory, 41 (3), IEEE Transactions on Information Theory: 653–664, doi:10.1109/18.382012
  • Willems; Shtarkov; Tjalkens (1997), Reflections on "The Context-Tree Weighting Method: Basic Properties", vol. 47, IEEE Information Theory Society Newsletter, CiteSeerX 10.1.1.109.1872{{citation}}: CS1 maint: location missing publisher (link)
  • Begleiter; El-Yaniv; Yona (2004), "On Prediction Using Variable Order Markov Models", Journal of Artificial Intelligence Research, 22, Journal of Artificial Intelligence Research: 385–421, arXiv:1107.0051, doi:10.1613/jair.1491, S2CID 47180476
[edit]