A modified multivariable complexity measure algorithm and its application for identifying mental arithmetic task

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Properly measuring the complexity of time series is an important issue. The permutation entropy (PE) is a widely used as an effective complexity measurement algorithm, but it is not suitable for the complexity description of multi-dimensional data. In this paper, in order to better measure the complexity of multi-dimensional time series, we proposed a modified multivariable PE (MMPE) algorithm with principal component analysis (PCA) dimensionality reduction, which is a new multi-dimensional time series complexity measurement algorithm. The analysis results of different chaotic systems verify that MMPE is effective. Moreover, we applied it to the comlexity analysis of EEG data. It shows that the person during mental arithmetic task has higher complexity comparing with the state before mental arithmetic task. In addition, we also discussed the necessity of the PCA dimensionality reduction.

Cite

CITATION STYLE

APA

Ma, D., He, S., & Sun, K. (2021). A modified multivariable complexity measure algorithm and its application for identifying mental arithmetic task. Entropy, 23(8). https://doi.org/10.3390/e23080931

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free