A Machine Learning Algorithm to Discriminating Between Bipolar and Major Depressive Disorders Based on Resting EEG Data
Bibliographic record
Abstract
Distinguishing major depressive disorder (MDD) from bipolar disorder (BD) is a crucial clinical challenge due to the lack of known biomarkers. Conventional methods of diagnosis rest exclusively on symptomatic presentation, and personal and family history. As a result, BD-depressed episode (BD-DE) is often misdiagnosed as MDD, and inappropriate therapy is given. Electroencephalography (EEG) has been widely studied as a potential source of biomarkers to differentiate these disorders. Previous attempts using machine learning (ML) methods have delivered insufficient sensitivity and specificity for clinical use, likely as a consequence of the small training set size, and inadequate ML methodology. We hope to overcome these limitations by employing a training dataset of resting-state EEG from 71 MDD and 71 BD patients. We introduce a robust 3 steps ML technique: 1) a multi-step preprocessing method is used to improve the quality of the EEG signal 2) symbolic transfer entropy (STE), which is an effective connectivity measure, is applied to the resultant EEG signals 3) the ML algorithm uses the extracted STE features to distinguish MDD from BD patients. Clinical Relevance--- The accuracy of our algorithm, derived from a large sample of patients, suggests that this method may hold significant promise as a clinical tool. The proposed method delivered total accuracy, sensitivity, and specificity of 84.9%, 83.4%, and 87.1%, respectively.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".