The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Approximate Entropy and Sample Entropy: A Comprehensive Tutorial
Open accessAbstract
Approximate Entropy and Sample Entropy are two algorithms for determining the regularity of series of data based on the existence of patterns. Despite their similarities, the theoretical ideas behind those techniques are different but usually ignored. This paper aims to be a complete guideline of the theory and application of the algorithms, intended to explain their characteristics in detail to researchers from different fields. While initially developed for physiological applications, both algorithms have been used in other fields such as medicine, telecommunications, economics or Earth sciences. In this paper, we explain the theoretical aspects involving Information Theory and Chaos Theory, provide simple source codes for their computation, and illustrate the techniques with a step by step example of how to use the algorithms properly. This paper is not intended to be an exhaustive review of all previous applications of the algorithms but rather a comprehensive tutorial where no previous knowledge is required to understand the methodology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Physiological time-series analysis using approximate entropy and sample entropy
Richman, J. S., & Moorman, J. R. (2000) · American Journal of Physiology-Heart and Circulatory Physiology · doi:10.1152/ajpheart.2000.278.6.h2039 · Cited by 7,880
Approximate entropy as a measure of system complexity.
Pincus, S. M. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.6.2297 · Cited by 5,811
Ergodic theory of chaos and strange attractors
Eckmann, J. P., & Ruelle, D. (1985) · Reviews of Modern Physics · doi:10.1103/revmodphys.57.617 · Cited by 4,941
Information Theory and Statistical Mechanics. II
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.108.171 · Cited by 3,253
Hartley, R. V. L. (1928) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1928.tb01236.x · Cited by 1,828
On a measure of the information provided by an experiment
Lindley, D. V. (1956) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728069 · Cited by 1,509
Estimation of the Kolmogorov entropy from a chaotic signal
Grassberger, P., & Procaccia, I. (1983) · Physical Review A · doi:10.1103/physreva.28.2591 · Cited by 1,440
Physiological time-series analysis: what does regularity quantify?
Pincus, S. M., & Goldberger, A. L. (1994) · American Journal of Physiology-Heart and Circulatory Physiology · doi:10.1152/ajpheart.1994.266.4.h1643 · Cited by 1,315
Cited by
Heart Rate Variability in Psychology: A Review of HRV Indices and an Analysis Tutorial
Pham, T., Lau, Z. J., Chen, S. H. A., & Makowski, D. (2021) · Sensors · doi:10.3390/s21123998 · Cited by 480
Metadata
- Authors
- Delgado-Bonal, A., & Marshak, A.
- Venue
- Entropy
- Publisher
- MDPI AG
- Published
- 2019-05-28
- Volume
- 21
- Issue
- 6
- Pages
- 541
- ISSN
- 1099-4300 (ISSN-L)
- OpenAlex
- W2947459187
- Cited by
- 660
- References
- 34
- FWCI
- 33.91
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximate Entropy and Sample Entropy: A Comprehensive Tutorial. https://app.cochat.ai/papers/10.3390/e21060541
- The paper
- Delgado-Bonal, A., & Marshak, A. (2019). Approximate Entropy and Sample Entropy: A Comprehensive Tutorial. Entropy. https://doi.org/10.3390/e21060541
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.