期刊
ENTROPY
卷 15, 期 10, 页码 4392-4415出版社
MDPI
DOI: 10.3390/e15104392
关键词
permutation entropy; ordinal patterns; efficient computing; complexity
资金
- Graduate School for Computing in Medicine and Life Sciences
- Germany's Excellence Initiative [DFG GSC 235/1]
Permutation entropy, introduced by Bandt and Pompe, is a conceptually simple and well-interpretable measure of time series complexity. In this paper, we propose efficient methods for computing it and related ordinal-patterns-based characteristics. The methods are based on precomputing values of successive ordinal patterns of order d, considering the fact that they are overlapped in d points, and on precomputing successive values of the permutation entropy related to overlapping successive time-windows. The proposed methods allow for measurement of the complexity of very large datasets in real-time.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据