Approximate entropy as a measure of system complexity.
- 15 March 1991
- journal article
- Published by Proceedings of the National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 88 (6), 2297-2301
- https://doi.org/10.1073/pnas.88.6.2297
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.Keywords
This publication has 1 reference indexed in Scilit:
- Is the normal heart a periodic oscillator?Biological Cybernetics, 1988