A universal prediction lemma and applications to universal data compression and prediction

DOI10.1109/18.923732MaRDI QIDQ4544585zbMATH OpenOpenAlexWikidataFDO

Authors Jacob Ziv

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.923732

zbMATH Keywords

training datauniversal data compressionuniversal prediction

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Recommendations

• An efficient universal prediction algorithm for unknown sources with limited training data
• Universal prediction
• On sliding-window universal data compression with limited memory
• Inequalities and algorithms for universal data compression
• Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences

Cited in

(4)

• Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
• Using a VOM model for reconstructing potential coding regions in EST sequences
• An efficient universal prediction algorithm for unknown sources with limited training data
• Time series prediction based on data compression methods

This page was built for publication: A universal prediction lemma and applications to universal data compression and prediction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544585)