Compression, Tests for Randomness and Estimating the Statistical Model of an Individual Sequence

J. Ziv
Additional contact information
J. Ziv: Technion — Israel Institute of Technology, Department of Electrical Engineering

A chapter in Sequences, 1990, pp 366-373 from Springer

Abstract: Abstract In this survey we consider finite alphabet stationary sources, where the only available statistics about the source is an individual sequence which is emitted by it. Based on this empirically observed statistics we want to perform a variety of tasks: testing for randomness, estimating the number of free parameters of the unknown statistical model such as the order of a finite Markov source, the number of states of a finite-state-stationary source, etc. We derive universal, asymptotically optimal algorithms, satisfying a Neyman-Pearson like criterion. These algorithms are shown to be related to the Lempel-Ziv data compression algorithm for individual sequences.

Keywords: Discriminant Function; Stationary Source; Individual Sequence; Asymptotic Optimality; Codeword Length (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_29

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_29

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().