DagSemProc.06051.2.pdf
- Filesize: 209 kB
- 13 pages
Document
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6051
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-07-31
Cite As Get BibTex
Boris Ryabko, Jaakko Astola, and Alex Gammerman. Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.06051.2
Abstract
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are described.
Subject Classification
Keywords
- Algorithmic complexity
- algorithmic information theory
- Kolmogorov complexity
- universal coding
- hypothesis testing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads