What question did this study set out to answer?

To evaluate methods for determining changing system complexity and assess the capability of approximate entropy to classify dynamics using small datasets.

March 15, 1991Proceedings of the National Academy of SciencesOpen Access

Approximate entropy as a measure of system complexity.

View Full Paper

Ask AI

Bookmark

To evaluate methods for determining changing system complexity and assess the capability of approximate entropy to classify dynamics using small datasets.
Evaluated the convergence properties of a standard correlation dimension algorithm against deterministic and chaotic models.
Analyzed the statistical behavior of approximate entropy across deterministic chaotic and stochastic processes using datasets of at least 1000 values.
Finite convergence of standard correlation dimension algorithms does not definitively indicate deterministic chaos or an underlying deterministic model.
Approximate entropy consistently distinguishes and classifies changing complexity in both chaotic and stochastic systems using as few as 1000 data points.

Discussion

No takes yet. Share an insight, caveat, or question.

Implication

Methodological evaluation demonstrates robust classification of system complexity in chaotic and stochastic processes, highlighting the diagnostic utility of approximate entropy with limited data.

Cite This Study

Steven M. Pincus (1991) studied this question.

synapsesocial.com/papers/69d68dc196200ba434db82d8 https://doi.org/10.1073/pnas.88.6.2297

View Full Paper

Ask AI

Bookmark

Implication

Methodological evaluation demonstrates robust classification of system complexity in chaotic and stochastic processes, highlighting the diagnostic utility of approximate entropy with limited data.

Approximate entropy as a measure of system complexity.

Key Points

Discussion

Implication

Cite This Study

Approximate entropy as a measure of system complexity.

Key Points

Discussion

Implication

Cite This Study

Also Consider

Also Consider