Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes
From MaRDI portal
Publication:941886
DOI10.1134/S0032946007040096zbMath1213.62058MaRDI QIDQ941886
Publication date: 2 September 2008
Published in: Problems of Information Transmission (Search for Journal in Brave)
Nonparametric estimation (62G05) Non-Markovian processes: estimation (62M09) Theory of error-correcting codes and error-detecting codes (94B99)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using information theory approach to randomness testing
- Universal codes as a basis for time series testing
- The strong ergodic theorem for densities: Generalized Shannon-McMillan- Breiman theorem
- Prediction of random sequences and universal coding
- Using literal and grammatical statistics for authorship attribution
- Fast adaptive coding algorithm
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
- Experimental investigation of forecasting methods based on data compression algorithms
- Clustering by Compression
- Weakly convergent nonparametric forecasting of stationary time series
- Memory-universal prediction of stationary random processes
- Limits to consistent on-line forecasting for ergodic time series
- Entropy expressions for multivariate continuous distributions
- A universal predictor based on pattern matching
- Universal schemes for learning the best nonlinear predictor given the infinite past and side information
This page was built for publication: Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes
