2018
DOI: 10.1007/s11227-018-2657-2
|View full text |Cite
|
Sign up to set email alerts
|

Acceleration of time series entropy algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 10 publications
0
10
0
Order By: Relevance
“…To accomplish this, a model of three degrees of freedom was built and then simulated in MATLAB [23] using the Runge-Kutta method as an in-function ode45 adaptive solver, and a final evaluation was performed in R [20] applying the Chaos01 [21] and TSEntropies [22] packages.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…To accomplish this, a model of three degrees of freedom was built and then simulated in MATLAB [23] using the Runge-Kutta method as an in-function ode45 adaptive solver, and a final evaluation was performed in R [20] applying the Chaos01 [21] and TSEntropies [22] packages.…”
Section: Discussionmentioning
confidence: 99%
“…The evaluation of the movement character was performed in the free software environment R [20] using the packages Chaos01 [21] and TSEntropies [22]. This dynamics mining process was applied on simulation outputs that were obtained by the Runge-Kutta method of the fourth order using MATLAB [23] (solver ode45).…”
Section: Three Parameters' Dynamics Depictionmentioning
confidence: 99%
“…As can be seen from this image, the values of the new accelerated algorithms are at different levels than their original versions. This fact is discussed in detail in [ 6 ], where it is also shown that their ability to detect an increase or decrease in complexity of the time series is roughly the same as in their original versions. A more detailed analysis of this phenomenon goes beyond the scope of this article.…”
Section: Supercomputer Power Consumption Time Seriesmentioning
confidence: 98%
“…Quadratic time complexity of the Approximate and Sample Entropy algorithms was the main reason why their accelerated modifications Fast Approximate Entropy and Fast Sample Entropy have been proposed in [ 6 ]. The original Approximate Entropy algorithm looks for mutually similar sub-sequences by comparing all possible sub-sequences with each other.…”
Section: New Fast Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation