Effective normalization of complexity measurements for epoch length and sampling frequency
- 14 June 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 64 (1) , 016209
- https://doi.org/10.1103/physreve.64.016209
Abstract
The algorithmic complexity of a symbol sequence is sensitive to the length of the message. Additionally, in those cases where the sequence is constructed by the symbolic reduction of an experimentally observed wave form, the corresponding value of algorithmic complexity is also sensitive to the sampling frequency. In this contribution, we present definitions of algorithmic redundancy that are sequence-sensitive generalizations of Shannon’s original definition of information redundancy. In contrast with algorithmic complexity, we demonstrate that algorithmic redundancy is not sensitive to message length or to observation scale (sampling frequency) when stationary systems are examined.Keywords
This publication has 23 references indexed in Scilit:
- The measures of sequence complexity for EEG studiesChaos, Solitons, and Fractals, 1994
- Filtered noise can mimic low-dimensional chaotic attractorsPhysical Review E, 1993
- Hierarchical approach to complexity with applications to dynamical systemsPhysical Review Letters, 1990
- Inferring statistical complexityPhysical Review Letters, 1989
- Random number generators: good ones are hard to findCommunications of the ACM, 1988
- Cellular automata as models of complexityNature, 1984
- On grammars, complexity, and information measures of biological macromoleculesMathematical Biosciences, 1980
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966