Towards automated EEG-Based Alzheimer's disease diagnosis using relevance vector machines
Bibliographic record
Abstract
Existing electroencephalography (EEG) based Alzheimer's disease (AD) diagnostic systems typically rely on experts to visually inspect and segment the collected signals into artefact-free epochs and on support vector machine (SVM) based classifiers. The manual selection process, however, introduces biases and errors into the diagnostic procedure, renders it “semi-automated,” and makes the procedure costly and labour-intensive. In this paper, we overcome these limitations by proposing the use of an automated artefact removal (AAR) algorithm to remove artefacts from the EEG signal without the need for human intervention. We investigate the effects of the so-called wavelet-enhanced independent component analysis (wICA) AAR on three classes of EEG features, namely spectral power, coherence, and amplitude modulation, and ultimately, on diagnostic accuracy, specificity and sensitivity. Furthermore, we propose to replace the binary SVM classifier with a soft-decision relevance vector machine (RVM) classifier. Experimental results show the proposed RVM-based system outperforming the SVM trained on features extracted from both manually-selected and wICA-processed epochs. Moreover, the class membership information output by the RVM is shown to provide clinicians with a richer pool of information to assist with AD assessment.
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.003 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.002 |
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".