Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 1991 Mar 15;88(6):2297–2301. doi: 10.1073/pnas.88.6.2297

Approximate entropy as a measure of system complexity.

S M Pincus 1
PMCID: PMC51218  PMID: 11607165

Abstract

Techniques to determine changing system complexity from data are evaluated. Convergence of a frequently used correlation dimension algorithm to a finite value does not necessarily imply an underlying deterministic model or chaos. Analysis of a recently developed family of formulas and statistics, approximate entropy (ApEn), suggests that ApEn can classify complex systems, given at least 1000 data values in diverse settings that include both deterministic chaotic and stochastic processes. The capability to discern changing complexity from such a relatively small amount of data holds promise for applications of ApEn in a variety of contexts.

Full text

PDF
2297

Selected References

These references are in PubMed. This may not be the complete list of references from this article.

  1. Babloyantz A., Destexhe A. Is the normal heart a periodic oscillator? Biol Cybern. 1988;58(3):203–211. doi: 10.1007/BF00364139. [DOI] [PubMed] [Google Scholar]

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES