Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Application of data ...
Conference paper

Application of data compression methods to hypothesis testing for ergodic and stationary processes

Boris Ryabko (1), Jaakko Astola (2)
(1) Siberian State University of Telecommunications and Informatics
(2) Department of Signal Processing [Tampere]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Proceedings
DOI
10.46298/dmtcs.3380
License
https://about.hal.science/hal-authorisation-v1
Indicators
479
Views
416
Downloads

Application of data compression methods to hypothesis testing for ergodic and stationary processes

Boris Ryabko (1), Jaakko Astola (2)
(1) Siberian State University of Telecommunications and Informatics
(2) Department of Signal Processing [Tampere]
Abstract
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.
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]
  • hypothesis testing
  • data compression
  • universal coding
  • Information Theory
  • universal predictors
  • Shannon entropy.
Cited by

Source: OpenCitations

  • HydroZIP: How Hydrological Knowledge can Be Used to Improve Compression of Hydrological Data

    Entropy

    Authors : Steven Weijs ORCID, Nick Van de Giesen ORCID, Marc Parlange ORCID

    Journal reference : Volume 15, 2013, pp. 1289-1310

    DOI : 10.3390/e15041289
Preview
Loading PDF preview...