Approximate entropy as a measure of system complexity.
Proceedings of the National Academy of Sciences · 1991 · 5,906 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Pincus, S. M. (1991). Approximate entropy as a measure of system complexity. Proceedings of the National Academy of Sciences, 88(6), 2297–2301. https://doi.org/10.1073/pnas.88.6.2297
In text: (Pincus, 1991)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
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.
Related papers
- Investigating Causal Relations by Econometric Models and Cross-spectral Methods1969
- Testing for a Unit Root in Time Series Regression1988
- Power-Law Distributions in Empirical Data2009
- Physiological time-series analysis using approximate entropy and sample entropy2000
- Fractional Brownian Motions, Fractional Noises and Applications1968
Metadata from OpenAlex (CC0). Citations are generated from the published record.