A Note on Sequence Prediction over Large Alphabets

Building on results from data compression, we prove nearly tight bounds on how well sequences of length n can be predicted in terms of the size σ of the alphabet and the length k of the context considered when making predictions. We compare the performance achievable by an adaptive predictor with no...

Full description

Bibliographic Details
Main Author: Travis Gagie
Format: Article
Language:English
Published: MDPI AG 2012-02-01
Series:Algorithms
Subjects:
Online Access:http://www.mdpi.com/1999-4893/5/1/50/