Approximate entropy

A comprehensive step-by-step tutorial with an explanation of the theoretical foundations of Approximate Entropy is available.^[8] The algorithm is:

Step 1

Assume a time series of data ${\displaystyle u(1),u(2),\ldots ,u(N)}$ . These are ${\displaystyle N}$  raw data values from measurements equally spaced in time.

Step 2

Let ${\displaystyle m\in \mathbb {Z} ^{+}}$  be a positive integer, with ${\displaystyle m\leq N}$ , which represents the length of a run of data (essentially a window).
Let ${\displaystyle r\in \mathbb {R} ^{+}}$  be a positive real number, which specifies a filtering level.
Let ${\displaystyle n=N-m+1}$ .

Step 3

Define ${\displaystyle \mathbf {x} (i)={\big [}u(i),u(i+1),\ldots ,u(i+m-1){\big ]}}$  for each ${\displaystyle i}$  where ${\displaystyle 1\leq i\leq n}$ . In other words, ${\displaystyle \mathbf {x} (i)}$  is an ${\displaystyle m}$ -dimensional vector that contains the run of data starting with ${\displaystyle u(i)}$ .
Define the distance between two vectors ${\displaystyle \mathbf {x} (i)}$  and ${\displaystyle \mathbf {x} (j)}$  as the maximum of the distances between their respective components, given by

${\displaystyle {\begin{aligned}d[\mathbf {x} (i),\mathbf {x} (j)]&=\max _{k}{\big (}|\mathbf {x} (i)_{k}-\mathbf {x} (j)_{k}|{\big )}\\&=\max _{k}{\big (}|u(i+k-1)-u(j+k-1)|{\big )}\\\end{aligned}}}$ 

for ${\displaystyle 1\leq k\leq m}$ .

Step 4

Define a count ${\displaystyle C_{i}^{m}}$  as

${\displaystyle C_{i}^{m}(r)={({\text{number of }}j{\text{ such that }}d[\mathbf {x} (i),\mathbf {x} (j)]\leq r) \over n}}$ 

for each ${\displaystyle i}$  where ${\displaystyle 1\leq i,j\leq n}$ . Note that since ${\displaystyle j}$  takes on all values between 1 and ${\displaystyle n}$ , the match will be counted when ${\displaystyle j=i}$  (i.e. when the test subsequence, ${\displaystyle \mathbf {x} (j)}$ , is matched against itself, ${\displaystyle \mathbf {x} (i)}$ ).

Step 5

Define

${\displaystyle \phi ^{m}(r)={1 \over n}\sum _{i=1}^{n}\log(C_{i}^{m}(r))}$ 

where ${\displaystyle \log }$  is the natural logarithm, and for a fixed ${\displaystyle m}$ , ${\displaystyle r}$ , and ${\displaystyle n}$  as set in Step 2.

Step 6

Define approximate entropy (${\displaystyle \mathrm {ApEn} }$ ) as

${\displaystyle \mathrm {ApEn} (m,r,N)(u)=\phi ^{m}(r)-\phi ^{m+1}(r)}$ 

Parameter selection

Typically, choose ${\displaystyle m=2}$  or ${\displaystyle m=3}$ , whereas ${\displaystyle r}$  depends greatly on the application.

An implementation on Physionet,^[9] which is based on Pincus,^[2] use ${\displaystyle d[\mathbf {x} (i),\mathbf {x} (j)]<r}$  instead of ${\displaystyle d[\mathbf {x} (i),\mathbf {x} (j)]\leq r}$  in Step 4. While a concern for artificially constructed examples, it is usually not a concern in practice.

Consider a sequence of ${\displaystyle N=51}$  samples of heart rate equally spaced in time:

${\displaystyle \ S_{N}=\{85,80,89,85,80,89,\ldots \}}$ 

Note the sequence is periodic with a period of 3. Let's choose ${\displaystyle m=2}$  and ${\displaystyle r=3}$  (the values of ${\displaystyle m}$  and ${\displaystyle r}$  can be varied without affecting the result).

Form a sequence of vectors:

${\displaystyle {\begin{aligned}\mathbf {x} (1)&=[u(1)\ u(2)]=[85\ 80]\\\mathbf {x} (2)&=[u(2)\ u(3)]=[80\ 89]\\\mathbf {x} (3)&=[u(3)\ u(4)]=[89\ 85]\\\mathbf {x} (4)&=[u(4)\ u(5)]=[85\ 80]\\&\ \ \vdots \end{aligned}}}$ 

Distance is calculated repeatedly as follows. In the first calculation,

${\displaystyle \ d[\mathbf {x} (1),\mathbf {x} (1)]=\max _{k}|\mathbf {x} (1)_{k}-\mathbf {x} (1)_{k}|=0}$  which is less than ${\displaystyle r}$ .

In the second calculation, note that ${\displaystyle |u(2)-u(3)|>|u(1)-u(2)|}$ , so

${\displaystyle \ d[\mathbf {x} (1),\mathbf {x} (2)]=\max _{k}|\mathbf {x} (1)_{k}-\mathbf {x} (2)_{k}|=|u(2)-u(3)|=9}$  which is greater than ${\displaystyle r}$ .

Similarly,

${\displaystyle {\begin{aligned}d[\mathbf {x} (1)&,\mathbf {x} (3)]=|u(2)-u(4)|=5>r\\d[\mathbf {x} (1)&,\mathbf {x} (4)]=|u(1)-u(4)|=|u(2)-u(5)|=0<r\\&\vdots \\d[\mathbf {x} (1)&,\mathbf {x} (j)]=\cdots \\&\vdots \\\end{aligned}}}$ 

The result is a total of 17 terms ${\displaystyle \mathbf {x} (j)}$  such that ${\displaystyle d[\mathbf {x} (1),\mathbf {x} (j)]\leq r}$ . These include ${\displaystyle \mathbf {x} (1),\mathbf {x} (4),\mathbf {x} (7),\ldots ,\mathbf {x} (49)}$ . In these cases, ${\displaystyle C_{i}^{m}(r)}$  is

${\displaystyle \ C_{1}^{2}(3)={\frac {17}{50}}}$ 

${\displaystyle \ C_{2}^{2}(3)={\frac {17}{50}}}$ 

${\displaystyle \ C_{3}^{2}(3)={\frac {16}{50}}}$ 

${\displaystyle \ C_{4}^{2}(3)={\frac {17}{50}}\ \cdots }$ 

Note in Step 4, ${\displaystyle 1\leq i\leq n}$  for ${\displaystyle \mathbf {x} (i)}$ . So the terms ${\displaystyle \mathbf {x} (j)}$  such that ${\displaystyle d[\mathbf {x} (3),\mathbf {x} (j)]\leq r}$  include ${\displaystyle \mathbf {x} (3),\mathbf {x} (6),\mathbf {x} (9),\ldots ,\mathbf {x} (48)}$ , and the total number is 16.

At the end of these calculations, we have

${\displaystyle \phi ^{2}(3)={1 \over 50}\sum _{i=1}^{50}\log(C_{i}^{2}(3))\approx -1.0982}$ 

Then we repeat the above steps for ${\displaystyle m=3}$ . First form a sequence of vectors:

${\displaystyle {\begin{aligned}\mathbf {x} (1)&=[u(1)\ u(2)\ u(3)]=[85\ 80\ 89]\\\mathbf {x} (2)&=[u(2)\ u(3)\ u(4)]=[80\ 89\ 85]\\\mathbf {x} (3)&=[u(3)\ u(4)\ u(5)]=[89\ 85\ 80]\\\mathbf {x} (4)&=[u(4)\ u(5)\ u(6)]=[85\ 80\ 89]\\&\ \ \vdots \end{aligned}}}$ 

By calculating distances between vector ${\displaystyle \mathbf {x} (i),\mathbf {x} (j),1\leq i\leq 49}$ , we find the vectors satisfying the filtering level have the following characteristic:

${\displaystyle d[\mathbf {x} (i),\mathbf {x} (i+3)]=0<r}$ 

Therefore,

${\displaystyle \ C_{1}^{3}(3)={\frac {17}{49}}}$ 

${\displaystyle \ C_{2}^{3}(3)={\frac {16}{49}}}$ 

${\displaystyle \ C_{3}^{3}(3)={\frac {16}{49}}}$ 

${\displaystyle \ C_{4}^{3}(3)={\frac {17}{49}}\ \cdots }$ 

At the end of these calculations, we have

${\displaystyle \phi ^{3}(3)={1 \over 49}\sum _{i=1}^{49}\log(C_{i}^{3}(3))\approx -1.0982}$ 

Finally,

${\displaystyle \mathrm {ApEn} =\phi ^{2}(3)-\phi ^{3}(3)\approx 0.000010997}$ 

The value is very small, so it implies the sequence is regular and predictable, which is consistent with the observation.

• Fast Approximate Entropy from MatLab Central
• approximateEntropy

The presence of repetitive patterns of fluctuation in a time series renders it more predictable than a time series in which such patterns are absent. ApEn reflects the likelihood that similar patterns of observations will not be followed by additional similar observations.^[10] A time series containing many repetitive patterns has a relatively small ApEn; a less predictable process has a higher ApEn.

The advantages of ApEn include:^[2]

• Lower computational demand. ApEn can be designed to work for small data samples (${\displaystyle N<50}$  points) and can be applied in real time.
• Less effect from noise. If data is noisy, the ApEn measure can be compared to the noise level in the data to determine what quality of true information may be present in the data.

The ApEn algorithm counts each sequence as matching itself to avoid the occurrence of ${\displaystyle \log(0)}$  in the calculations. This step might introduce bias in ApEn, which causes ApEn to have two poor properties in practice:^[11]

1. ApEn is heavily dependent on the record length and is uniformly lower than expected for short records.
2. It lacks relative consistency. That is, if ApEn of one data set is higher than that of another, it should, but does not, remain higher for all conditions tested.

ApEn has been applied to classify electroencephalography (EEG) in psychiatric diseases, such as schizophrenia,^[12] epilepsy,^[13] and addiction.^[14]

• Recurrence quantification analysis
• Sample entropy