A universal predictor based on pattern matching

DOI10.1109/TIT.2002.1003834MaRDI QIDQ4674519zbMATH OpenFDO

Authors Wojciech Szpankowski, Izydor Apostol, Philippe Jacquet

Publication date 11 May 2005

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

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

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 1552327
• Universal prediction of individual sequences
• Universal prediction
• Universal probability-free prediction
• An algorithm of predictability and its application
• scientific article; zbMATH DE number 1944143
• Universal Filtering Via Prediction
• A unified approach to pattern recognition
• On matching generalised repetitive patterns

Cited in

(9)

• Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
• scientific article; zbMATH DE number 1552327 (Why is no real title available?)
• Universal prediction
• Universal coding and prediction on ergodic random points
• Universal codes as a basis for time series testing
• A universal online caching algorithm based on pattern matching
• Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes

This page was built for publication: A universal predictor based on pattern matching

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