Entropy Algorithms

Tuan D. Pham ()
Additional contact information
Tuan D. Pham: Prince Mohammad Bin Fahd University, The Center for Artificial Intelligence

Chapter Chapter 6 in Fuzzy Recurrence Plots and Networks with Applications in Biomedicine, 2020, pp 81-97 from Springer

Abstract: Abstract Although the purpose of entropy algorithms is not for studying chaosChaos, their mathematical formulations for quantifying fluctuations in time seriesTime series bear a resemblance to the recurrence analysis with respect to the definition of similaritySimilarity between sub-vectors of time seriesTime series. This chapter presents several algorithms for measuring the irregularityIrregularity or predictabilityPredictability of time seriesTime series, which can also be considered as measures of complexity of the data. These methods include the approximate entropyApproximate entropy, sample entropySample entropy, multiscale entropyMultiscale entropy, and time-shift multiscaleTime-shift multiscale entropy entropyMultiscale entropy. These selected methods are addressed herein to provide the reader with sufficient background for the presentation of an application described in Chap. 7 . Most content of this chapter was from the author’s work reported in Pham (Entropy 19:257, 2017).

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-37530-0_6

Ordering information: This item can be ordered from
http://www.springer.com/9783030375300

DOI: 10.1007/978-3-030-37530-0_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().