Time-Frequency Complexity Maps for EEG-Based Diagnosis of Alzheimer’s Disease Using a Lightweight Deep Neural Network
Bibliographic record
Abstract
Alzheimer’s disease (AD) is a neurodegenerative disorder with an unknown etiology and a significant prevalence. Rapid and accurate detection of AD is crucial to assist in a more effective and tailored treatment plan to delay the progression of the disease. This paper introduces a novel approach based on a time-frequency complexity map (complextrogram) for the automated AD diagnosis. The complextrogram is the topographic complexity level of an EEG signal, plotted as a function of time and frequency. The complextrogram representations were fed into a well-known lightweight deep neural network called MobileNet for robust performance on resource and accuracy tradeoffs. The experiments were performed using a five-fold cross-validation technique on a publicly available database containing clinical EEG recordings from 24 patients with AD and 24 healthy, age-matched controls. The proposed pipeline provided competitive performance with just 2.2 M parameters and achieved the best overall accuracy for some locations in the frontal lobes (Fp2 and F8 channels). For both channels, the classification accuracy was 100%. Also, the violin plot was used to get further details of the distribution of complexity values for specific frequency rhythms. After statistical evaluation, it was observed that neurodegenerative conditions caused changes in chaotic behaviors, including increased delta complexity and decreased alpha complexity. Results demonstrated that the complextrogram representation proved its potency for the input quality required by the deep learning architectures. Furthermore, the complextrogram method is a promising pathway to discriminate and reflect the fundamental characteristics of AD abnormalities.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".