The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Approximate entropy for all signals
Abstract
Calculation of approximate entropy (ApEn) requires a priori determination of two unknown parameters, m and r. While the recommended values of r, in the range of 0.1¿0.2 times the standard deviation of the signal, have been shown to be applicable for a wide variety of signals, in certain cases, r values within this prescribed range can lead to an incorrect assessment of the complexity of a given signal. To circumvent this limitation, we recently advocated finding the maximum ApEn value by assessing all values of r from 0 to 1 and found that the maximum ApEn does not always occur within the prescribed range of r values. Our results indicate that finding the maximum ApEn leads to the correct interpretation of a signal's complexity. One major limitation, however, is that the calculation of all choices of r values is often impractical because of the computational burden. Our new method, based on a heuristic stochastic model, overcomes this computational burden and leads to the automatic selection of the maximum ApEn value for any given signal. On the basis of Monte Carlo simulations, we derive general equations that can be used to estimate the maximum ApEn with high accuracy for a given value of m. Application to both synthetic and experimental data confirmed the advantages claimed with the proposed approach.
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
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
Multiscale Entropy Analysis of Complex Physiologic Time Series
Costa, M., Goldberger, A. L., & Peng, C.-K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.068102 · Cited by 3,207
Ho, K. K. L., Moody, G. B., Peng, C.-K., Mietus, J. E., Larson, M. G., Levy, D., & Goldberger, A. L. (1997) · Circulation · doi:10.1161/01.cir.96.3.842 · Cited by 489 · cited 2×
“This recommendation was largely based on its application to relatively slow dynamic signals such as heart rate [2], [3] and hormonal release data [5].”
Background
Cited by
The Appropriate Use of Approximate Entropy and Sample Entropy with Short Data Sets
Yentes, J. M., Hunt, N., Schmid, K. K., Kaipust, J. P., McGrath, D., & Stergiou, N. (2013) · Annals of Biomedical Engineering · doi:10.1007/s10439-012-0668-3 · Cited by 893
Castaldo, R., Melillo, P., Bracale, U., Caserta, M., Triassi, M., & Pecchia, L. (2015) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2015.02.012 · Cited by 535
Fadlallah, B., Chen, B., Keil, A., & Príncipe, J. (2013) · Physical Review E · doi:10.1103/physreve.87.022911 · Cited by 450
Melillo, P., Bracale, M., & Pecchia, L. (2011) · BioMedical Engineering OnLine · doi:10.1186/1475-925x-10-96 · Cited by 328
Epileptic EEG classification based on extreme learning machine and nonlinear features
Yuan, Q., Zhou, W., Li, S., & Cai, D. (2011) · Epilepsy Research · doi:10.1016/j.eplepsyres.2011.04.013 · Cited by 286
Metadata
- Authors
- Chon, K. H., Scully, C. G., & Lu, S.
- Venue
- IEEE Engineering in Medicine and Biology Magazine
- Published
- 2009-11
- Volume
- 28
- Issue
- 6
- Pages
- 18-23
- ISSN
- 0739-5175 (ISSN-L)
- OpenAlex
- W2049571914
- Cited by
- 173
- References
- 3
- FWCI
- 3.76
- Type
- journal article
- Language
- en
- Open access
- closed
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 for all signals. https://app.cochat.ai/papers/10.1109/memb.2009.934629
- The paper
- Chon, K. H., Scully, C. G., & Lu, S. (2009). Approximate entropy for all signals. IEEE Engineering in Medicine and Biology Magazine. https://doi.org/10.1109/memb.2009.934629
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.