Computer Science – Information Theory
Scientific paper
2012-01-10
Computer Science
Information Theory
11 LaTeX pages, 7 tables
Scientific paper
We describe an adaptive context tree weighting (ACTW) algorithm, as an extension to the standard context tree weighting (CTW) algorithm. Unlike the standard CTW algorithm, which weights all observations equally regardless of the depth, ACTW gives increasing weight to more recent observations, aiming to improve performance in cases where the input sequence is from a non-stationary distribution. Data compression results show ACTW variants improving over CTW on merged files from standard compression benchmark tests while never being significantly worse on any individual file.
Hutter Marcus
O'Neill Alexander
Shao Wen
Sunehag Peter
No associations
LandOfFree
Adaptive Context Tree Weighting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adaptive Context Tree Weighting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Context Tree Weighting will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-463063