Complexity Analysis of Electroencephalogram Dynamics in Patients with Parkinson’s Disease
Bibliographic record
Abstract
In this study, a new combination scheme has been proposed for detecting Parkinson's disease (PD) from electroencephalogram (EEG) signal recorded from normal subjects and PD patients. The scheme is based on discrete wavelet transform (DWT), sample entropy (SampEn), and the three-way decision model in analysis of EEG signal. The EEG signal is noisy and nonstationary, and, as a consequence, it becomes difficult to distinguish it visually. However, the scheme is a well-established methodology in analysis of EEG signal in three stages. In the first stage, the DWT was applied to acquire the split frequency information; here, we use three-level DWT to decompose EEG signal into approximation and detail coefficients; in this stage, we aim to remove the useless and noise information and acquire the effective information. In the second stage, as the SampEn has advantage in analyzing the EEG signal, we use the approximation coefficient to compute the SampEn values. Finally, we detect the PD patients using three-way decision based on optimal center constructive covering algorithm (O_CCA) with the accuracy about 92.86%. Without DWT as preprocessing step, the detection rate reduces to 88.10%. Overall, the combination scheme we proposed is suitable and efficient in analyzing the EEG signal with higher accuracy.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".