A universal predictor based on pattern matching
From MaRDI portal
Publication:4674519
DOI10.1109/TIT.2002.1003834zbMath1061.94021MaRDI QIDQ4674519
Wojciech Szpankowski, Izydor Apostol, Philippe Jacquet
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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)
Related Items (6)
A universal online caching algorithm based on pattern matching ⋮ Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes ⋮ A fast and efficient nearly-optimal adaptive Fano coding scheme ⋮ Universal codes as a basis for time series testing ⋮ Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series ⋮ Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
This page was built for publication: A universal predictor based on pattern matching
