Easily adaptable complexity measure for finite time series

A Novel Detection Tool for Mild Cognitive Impairment Patients Based on Eye Movement and Electroencephalogram

BACKGROUND

Detecting subtle changes in visual attention from electroencephalography (EEG) and the perspective of eye movement in mild cognitive impairment (MCI) patients can be of great significance in screening early Alzheimer's disease (AD) in a large population at primary care.

OBJECTIVE

We proposed an automatic, non-invasive, and quick MCI detection approach based on multimodal physiological signals for clinical decision-marking.

METHODS

The proposed model recruited 152 patients with MCI and 184 healthy elderly controls (HC) who underwent EEG and eye movement signal recording under a visual stimuli task, as well as other neuropsychological assessments. Forty features were extracted from EEG and eye movement signals by linear and nonlinear analysis. The features related to MCI were selected by logistic regression analysis. To evaluate the efficacy of this MCI detection approach, we applied the same procedures to achieve the Clinical model, EEG model, Eye movement model, EEG+ Clinical model, Eye movement+ Clinical model, and Combined model, and compared the classification accuracy between the MCI and HC groups with the above six models.

RESULTS

After the penalization of logistic regression analysis, five features from EEG and eye movement features exhibited significant differences (p < 0.05). In the classification experiment, the combined model resulted in the best accuracy. The average accuracy for the Clinical/EEG/Eye movement/EEG+ Clinical/Eye movement+ Clinical/Combined model was 68.69%, 61.79%, 73.13%, 69.46%, 75.61%, and 81.51%, respectively.

CONCLUSION

These results suggest that the proposed MCI detection tool has the potential to screen MCI patients from HCs and may be a powerful tool for personalized precision MCI screening in the large-scale population under primary care condition.

A Method for Detecting Dynamic Mutation of Complex Systems Using Improved Information Entropy

In this study, a nonlinear analysis method called improved information entropy (IIE) is proposed on the basis of constructing a special probability mass function for the normalized analysis of Shannon entropy for a time series. The definition is directly applied to several typical time series, and the characteristic of IIE is analyzed. This method can distinguish different kinds of signals and reflects the complexity of one-dimensional time series of high sensitivity to the changes in signal. Thus, the method is applied to the fault diagnosis of a rolling bearing. Experimental results show that the method can effectively extract the sensitive characteristics of the bearing running state and has fast operation time and minimal parameter requirements.

Unifying complexity and information

Complex systems, arising in many contexts in the computer, life, social, and physical sciences, have not shared a generally-accepted complexity measure playing a fundamental role as the Shannon entropy H in statistical mechanics. Superficially-conflicting criteria of complexity measurement, i.e. complexity-randomness (C-R) relations, have given rise to a special measure intrinsically adaptable to more than one criterion. However, deep causes of the conflict and the adaptability are not much clear. Here I trace the root of each representative or adaptable measure to its particular universal data-generating or -regenerating model (UDGM or UDRM). A representative measure for deterministic dynamical systems is found as a counterpart of the H for random process, clearly redefining the boundary of different criteria. And a specific UDRM achieving the intrinsic adaptability enables a general information measure that ultimately solves all major disputes. This work encourages a single framework coving deterministic systems, statistical mechanics and real-world living organisms.

Quantifying the complexity of the delayed logistic map

Statistical complexity measures are used to quantify the degree of complexity of the delayed logistic map, with linear and nonlinear feedback. We employ two methods for calculating the complexity measures, one with the 'histogram-based' probability distribution function and the other one with ordinal patterns. We show that these methods provide complementary information about the complexity of the delay-induced dynamics: there are parameter regions where the histogram-based complexity is zero while the ordinal pattern complexity is not, and vice versa. We also show that the time series generated from the nonlinear delayed logistic map can present zero missing or forbidden patterns, i.e. all possible ordinal patterns are realized into orbits.