Bandt-Pompe和Lempel-Ziv方法的混合:分析连续状态序列复杂性的另一种方法
Mixing Bandt-Pompe and Lempel-Ziv approaches: another way to analyze the complexity of continuous-states sequences
摘要:
在本文中,我们建议将Bandt-Pompe置换熵与Lempel-Ziv复杂度相结合,以设计我们所谓的Lempel-Ziv置换复杂度。该原理由两个步骤组成:(i)变换一个连续状态序列,该序列本质上是多变量的,或者是从嵌入到置换向量序列中产生的,其中的分量是重新排列时初始向量的分量的位置;(ii)对这一系列“符号”执行Lempel-Ziv复杂性,作为离散有限大小字母表的一部分。一方面,Bandt-Pompe的置换熵旨在研究这样的序列的熵;即,序列中模式的熵(例如,增加或减少)。另一方面,离散状态序列的Lempel-Ziv复杂度旨在研究符号的时间组织(即,序列的压缩率)。因此,Lempel-Ziv置换复杂度旨在利用这两种方法。从这样一个组合的方法-置换过程和复杂性分析-的潜力进行评估,通过一些模拟数据和一些真实的数据的说明。在这两种情况下,我们比较了单独的方法和组合的方法。
英文摘要:
In this paper, we propose to mix the approach underlying Bandt-Pompe permutation entropy with Lempel-Ziv complexity, to design what we call Lempel-Ziv permutation complexity. The principle consists of two steps: (i) transformation of a continuous-state series that is intrinsically multivariate or arises from embedding into a sequence of permutation vectors, where the components are the positions of the components of the initial vector when re-arranged; (ii) performing the Lempel-Ziv complexity for this series of `symbols', as part of a discrete finite-size alphabet. On the one hand, the permutation entropy of Bandt-Pompe aims at the study of the entropy of such a sequence; i.e., the entropy of patterns in a sequence (e.g., local increases or decreases). On the other hand, the Lempel-Ziv complexity of a discrete-state sequence aims at the study of the temporal organization of the symbols (i.e., the rate of compressibility of the sequence). Thus, the Lempel-Ziv permutation complexity aims to take advantage of both of these methods. The potential from such a combined approach - of a permutation procedure and a complexity analysis - is evaluated through the illustration of some simulated data and some real data. In both cases, we compare the individual approaches and the combined approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。