Application of data compression methods to hypothesis testing for ergodic and stationary processesConference paper
Authors: Boris Ryabko 1; Jaakko Astola 2
NULL##NULL
Boris Ryabko;Jaakko Astola
- 1 Siberian State University of Telecommunications and Informatics
- 2 Department of Signal Processing [Tampere]
We show that data compression methods (or universal codes) can be applied for hypotheses testing in a framework of classical mathematical statistics. Namely, we describe tests, which are based on data compression methods, for the three following problems: i) identity testing, ii) testing for independence and iii) testing of serial independence for time series. Applying our method of identity testing to pseudorandom number generators, we obtained experimental results which show that the suggested tests are quite efficient.
Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [en] hypothesis testing, data compression, universal coding, Information Theory, universal predictors, Shannon entropy.