Permutation Entropy: Enhancing Discriminating Power by Using Relative Frequencies Vector of Ordinal Patterns Instead of Their Shannon Entropy

被引:7
作者
Cuesta-Frau, David [1 ,2 ]
Molina-Pico, Antonio [1 ,2 ]
Vargas, Borja [3 ]
Gonzalez, Paula [3 ]
机构
[1] Univ Politecn Valencia, Technol Inst Informat, 03801 Alcoi Campus, Alcoy, Spain
[2] Innovatec Sensorizac & Comunicac SL, Avda Elx 3, Alcoy 03801, Spain
[3] Mostoles Teaching Hosp, Dept Internal Med, Madrid 28935, Spain
关键词
permutation entropy; hidden Markov models; k-means clustering; signal classification; relative frequency estimation; feature selection; body temperature; K-MEANS; CLASSIFICATION; PERFORMANCE; STABILITY; FEATURES; SIGNALS;
D O I
10.3390/e21101013
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Many measures to quantify the nonlinear dynamics of a time series are based on estimating the probability of certain features from their relative frequencies. Once a normalised histogram of events is computed, a single result is usually derived. This process can be broadly viewed as a nonlinear mapping into where n is the number of bins in the histogram. However, this mapping might entail a loss of information that could be critical for time series classification purposes. In this respect, the present study assessed such impact using permutation entropy (PE) and a diverse set of time series. We first devised a method of generating synthetic sequences of ordinal patterns using hidden Markov models. This way, it was possible to control the histogram distribution and quantify its influence on classification results. Next, real body temperature records are also used to illustrate the same phenomenon. The experiments results confirmed the improved classification accuracy achieved using raw histogram data instead of the PE final values. Thus, this study can provide a very valuable guidance for the improvement of the discriminating capability not only of PE, but of many similar histogram-based measures.
引用
收藏
页数:19
相关论文
共 66 条
[1]  
Amigo JM, 2010, SPRINGER SER SYNERG, P1, DOI 10.1007/978-3-642-04084-9
[2]  
[Anonymous], 2011, JK MEISNER FAZ 0415, V15, P10
[3]  
[Anonymous], 2018, ENTROPY SWITZ, DOI [DOI 10.3390/E20110853, DOI 10.3390/e20110853]
[4]   A survey of cross-validation procedures for model selection [J].
Arlot, Sylvain ;
Celisse, Alain .
STATISTICS SURVEYS, 2010, 4 :40-79
[5]   Amplitude-aware permutation entropy: Illustration in spike detection and signal segmentation [J].
Azami, Hamed ;
Escudero, Javier .
COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, 2016, 128 :40-51
[6]   The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances [J].
Bagnall, Anthony ;
Lines, Jason ;
Bostrom, Aaron ;
Large, James ;
Keogh, Eamonn .
DATA MINING AND KNOWLEDGE DISCOVERY, 2017, 31 (03) :606-660
[7]   Scalable K-Means++ [J].
Bahmani, Bahman ;
Moseley, Benjamin ;
Vattani, Andrea ;
Kumar, Ravi ;
Vassilvitskii, Sergei .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (07) :622-633
[8]   Permutation entropy: A natural complexity measure for time series [J].
Bandt, C ;
Pompe, B .
PHYSICAL REVIEW LETTERS, 2002, 88 (17) :4
[9]   A comparative study of efficient initialization methods for the k-means clustering algorithm [J].
Celebi, M. Emre ;
Kingravi, Hassan A. ;
Vela, Patricio A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (01) :200-210
[10]   Improved Permutation Entropy for Measuring Complexity of Time Series under Noisy Condition [J].
Chen, Zhe ;
Li, Yaan ;
Liang, Hongtao ;
Yu, Jing .
COMPLEXITY, 2019, 2019