(Enter summary)
Abstract: We describe a sequential universal data compression
procedure for binary tree sources that performs the "double
mixture." Using a context tree, this method weights in an efficient
recursive way the coding distributions corresponding to
all bounded memory tree sources, and achieves a desirable
coding distribution for tree sources with an unknown model and
unknown parameters. Computational and storage complexity of
the proposed procedure are both linear in the source sequence
length. We derive a... (Update)
Cited by: More
A Suffix Tree Based Prediction Scheme for Pervasive.. - Katsaros, Manolopoulos (2005)
(Correct)
Spam Filtering using Character-level Markov Models: - Experiments For The
(Correct)
Learning Markov chains with variable memory length from noisy.. - Angluin, Csürös (1997)
(Correct)
Similar documents (at the sentence level):
30.4%: The Context Tree Weighting Method: Basic Properties - Willems, Shtarkov, Tjalkens (1995)
(Correct)
Active bibliography (related documents): More All
0.0: Linear Time Universal Coding and Time Reversal of Tree .. - Martin, Seroussi.. (2004)
(Correct)
0.0: Efficient Coding Schemes for the Hard-Square Model - Roth, Siegel, Wolf (1999)
(Correct)
0.0: On Universal Simulation of Information Sources Using Training .. - Merhav, Weinberger (2002)
(Correct)
Similar documents based on text: More All
0.9: Context Weighting for General Finite-Context Sources - Willems, Shtarkov, Tjalkens (1996)
(Correct)
0.7: The Context-Tree Weighting Method: Extensions - Willems (1994)
(Correct)
0.6: Implementing The Context-Tree Weighting Method: Arithmetic.. - Tjalkens, Willems (1997)
(Correct)
Related documents from co-citation: More All
32: Elements of Information Theory (context) - Cover, Thomas - 1991
22: The performance of universal encoding (context) - Krichevsky, Trofimov - 1981
16: Universal coding, information, prediction, and estimation (context) - Rissanen - 1984
BibTeX entry: (Update)
F.M.J. Willems, Y.M. Shtarkov and Tj.J. Tjalkens, "The Context-Tree Weighting Method: Basic properties, " IEEE Trans. on Inform. Theory, May 1995, pp. 653-664. http://citeseer.ist.psu.edu/article/willems95contexttree.html More
@article{ willems95contexttree,
author = "F. M. J. Willems and Y. M. Shtarkov and Tj. J. Tjalkens",
title = "The context-tree weighting method: basic properties.",
journal = "IEEE Trans. Info. Theory",
pages = "653--664",
year = "1995",
url = "citeseer.ist.psu.edu/article/willems95contexttree.html" }
Citations (may not include all citations):
2319
Elements of Information Theory (context) - Cover, Thomas - 1991
16
Enumerative source encoding (context) - Cover - 1973
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs.haifa.ac.il/courses/src_coding/): More
Interval and Recency Rank Source Coding: Two On-Line Adaptive.. - Elias (1987)
(Correct)
A Universal Algorithm for Sequential Data Compression - Ziv, Lempel (1977)
(Correct)
A New Universal Coding Scheme for the Binary Memoryless Source - Lawrence (1977)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC