A fast algorithm for computing sample entropy

DOI10.1142/S1793536911000775zbMATH Open1226.92003MaRDI QIDQ3101552FDOQ3101552

Authors: Ying Jiang, Dong Mao, Yuesheng Xu 

Publication date: 29 November 2011

Published in: Advances in Adaptive Data Analysis (Search for Journal in Brave)

Recommendations

• Permuted sample entropy
• Efficiently measuring complexity on the basis of real-world data
• Spatial-dependence recurrence sample entropy
• Influence of noise on the sample entropy algorithm
• Measuring time series regularity using nonlinear similarity-based sample entropy

zbMATH Keywords

k-d tree

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Probabilistic models, generic numerical methods in probability and statistics (65C20) General biology and biomathematics (92B05)

Cites Work

• Introduction to algorithms
• Multidimensional divide-and-conquer
• Approximate entropy as a measure of system complexity.
• Ergodic theory of chaos and strange attractors
• Multidimensional binary search trees used for associative searching

Cited In (5)

• The effect of time delay on approximate \& sample entropy calculations
• Hierarchical entropy analysis for biological signals
• Measuring time series regularity using nonlinear similarity-based sample entropy
• Title not available (Why is that?)
• Permuted sample entropy

This page was built for publication: A fast algorithm for computing sample entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101552)