Refined scale-dependent permutation entropy to analyze systems complexity

Shuen De Wu, Chiu Wen Wu, Anne Humeau-Heurtier

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Multiscale entropy (MSE) has become a prevailing method to quantify the complexity of systems. Unfortunately, MSE has a temporal complexity in O(N2), which is unrealistic for long time series. Moreover, MSE relies on the sample entropy computation which is length-dependent and which leads to large variance and possible undefined entropy values for short time series. Here, we propose and introduce a new multiscale complexity measure, the refined scale-dependent permutation entropy (RSDPE). Through the processing of different kinds of synthetic data and real signals, we show that RSDPE has a behavior close to the one of MSE. Furthermore, RSDPE has a temporal complexity in O(N). Finally, RSDPE has the advantage of being much less length-dependent than MSE. From all this, we conclude that RSDPE over-performs MSE in terms of computational cost and computational accuracy.

Original languageEnglish
Pages (from-to)454-461
Number of pages8
JournalPhysica A: Statistical Mechanics and its Applications
Volume450
DOIs
Publication statusPublished - 2016 May 15

Fingerprint

permutations
Permutation
Entropy
entropy
Dependent
Time series
Complexity Measure
Synthetic Data
Computational Cost
Quantify

Keywords

  • Complexity
  • Entropy
  • Multiscale entropy
  • Nonlinear dynamics
  • Permutation entropy
  • Sample entropy

ASJC Scopus subject areas

  • Statistics and Probability
  • Condensed Matter Physics

Cite this

Refined scale-dependent permutation entropy to analyze systems complexity. / Wu, Shuen De; Wu, Chiu Wen; Humeau-Heurtier, Anne.

In: Physica A: Statistical Mechanics and its Applications, Vol. 450, 15.05.2016, p. 454-461.

Research output: Contribution to journalArticle

@article{cf8f8797f84041efbff86625e5c2c457,
title = "Refined scale-dependent permutation entropy to analyze systems complexity",
abstract = "Multiscale entropy (MSE) has become a prevailing method to quantify the complexity of systems. Unfortunately, MSE has a temporal complexity in O(N2), which is unrealistic for long time series. Moreover, MSE relies on the sample entropy computation which is length-dependent and which leads to large variance and possible undefined entropy values for short time series. Here, we propose and introduce a new multiscale complexity measure, the refined scale-dependent permutation entropy (RSDPE). Through the processing of different kinds of synthetic data and real signals, we show that RSDPE has a behavior close to the one of MSE. Furthermore, RSDPE has a temporal complexity in O(N). Finally, RSDPE has the advantage of being much less length-dependent than MSE. From all this, we conclude that RSDPE over-performs MSE in terms of computational cost and computational accuracy.",
keywords = "Complexity, Entropy, Multiscale entropy, Nonlinear dynamics, Permutation entropy, Sample entropy",
author = "Wu, {Shuen De} and Wu, {Chiu Wen} and Anne Humeau-Heurtier",
year = "2016",
month = "5",
day = "15",
doi = "10.1016/j.physa.2016.01.044",
language = "English",
volume = "450",
pages = "454--461",
journal = "Physica A: Statistical Mechanics and its Applications",
issn = "0378-4371",
publisher = "Elsevier",

}

TY - JOUR

T1 - Refined scale-dependent permutation entropy to analyze systems complexity

AU - Wu, Shuen De

AU - Wu, Chiu Wen

AU - Humeau-Heurtier, Anne

PY - 2016/5/15

Y1 - 2016/5/15

N2 - Multiscale entropy (MSE) has become a prevailing method to quantify the complexity of systems. Unfortunately, MSE has a temporal complexity in O(N2), which is unrealistic for long time series. Moreover, MSE relies on the sample entropy computation which is length-dependent and which leads to large variance and possible undefined entropy values for short time series. Here, we propose and introduce a new multiscale complexity measure, the refined scale-dependent permutation entropy (RSDPE). Through the processing of different kinds of synthetic data and real signals, we show that RSDPE has a behavior close to the one of MSE. Furthermore, RSDPE has a temporal complexity in O(N). Finally, RSDPE has the advantage of being much less length-dependent than MSE. From all this, we conclude that RSDPE over-performs MSE in terms of computational cost and computational accuracy.

AB - Multiscale entropy (MSE) has become a prevailing method to quantify the complexity of systems. Unfortunately, MSE has a temporal complexity in O(N2), which is unrealistic for long time series. Moreover, MSE relies on the sample entropy computation which is length-dependent and which leads to large variance and possible undefined entropy values for short time series. Here, we propose and introduce a new multiscale complexity measure, the refined scale-dependent permutation entropy (RSDPE). Through the processing of different kinds of synthetic data and real signals, we show that RSDPE has a behavior close to the one of MSE. Furthermore, RSDPE has a temporal complexity in O(N). Finally, RSDPE has the advantage of being much less length-dependent than MSE. From all this, we conclude that RSDPE over-performs MSE in terms of computational cost and computational accuracy.

KW - Complexity

KW - Entropy

KW - Multiscale entropy

KW - Nonlinear dynamics

KW - Permutation entropy

KW - Sample entropy

UR - http://www.scopus.com/inward/record.url?scp=84957019068&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957019068&partnerID=8YFLogxK

U2 - 10.1016/j.physa.2016.01.044

DO - 10.1016/j.physa.2016.01.044

M3 - Article

AN - SCOPUS:84957019068

VL - 450

SP - 454

EP - 461

JO - Physica A: Statistical Mechanics and its Applications

JF - Physica A: Statistical Mechanics and its Applications

SN - 0378-4371

ER -