UADIIndicator-package: Fast calculating the delay permutation entropy ~~ package...

In uq-eresearch/UQUADIIndicator: UADI Population Mobility Indicators

Description

Implementation horizontal visiblity graph needs to iterate three variables (i, j and k), which means that the worst computing time to construct a HVG from a time series with n data points is $O(n^3)$.
This algorithm excutes the HVG with $O(n)$ and also include the weighted information.
The limitation, the input length of FWHVA is less than 4098, if the input length is large than it, the stack may be overflow.

Usage

  FastDPE(data,  m, delay)  

Arguments

data	input data, one dimension
m	embedded dimension, should be >=2
delay	delay factor, default=1

Details

Package:	MDPE
Type:	Package
Version:	1.0
Date:	2013-08-28
License:	GPL (version 2 or later)

Value

mean degree
mean strength
repeat time

Author(s)

Guohun Zhu
Maintainer: Guohun Zhu <[e-mail]> or <[e-mail]>

References

Guohun Zhu, Yan Li, Peng (Paul) Wen, Shuaifang Wang and Min Xi. (2012). Epileptogenic Focus Detection in Single Intracranial EEG Channel based on Delay Permutation Entropy. Accepted by CMLS 2013

See Also

HVG ~~ <PEbyR> ~~

Examples

a=c(10,8,6,4,2,1,3,5,7,9,11)
FastDPE(a, 3, 1)

uq-eresearch/UQUADIIndicator documentation built on May 14, 2019, 2:39 p.m.