arXiv · cs/0505079
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
Abstract
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are suggested.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Boris Ryabko, Jaakko Astola, Alex Gammerman. 2005-05-29. Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series. https://searcharxiv.com/abs/cs/0505079
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.