Borderline-DEMNET: A Workflow for Detecting Alzheimer’s and Dementia Stage by Solving Class Imbalance Problem
Bibliographic record
Abstract
Alzheimer’s Disease (AD) is the leading cause of dementia, a broad term encompassing memory loss and other cognitive impairments. Although there is no known cure for dementia, managing specific symptoms associated with it can be effective. Mild dementia stages, including AD, can be treated, and computer-based techniques have been developed to aid in early diagnosis. This paper presents a new workflow called Borderline-DEMNET, designed to classify various stages of Alzheimer’s/dementia with more than three classes. Borderline-SMOTE is employed to address the issue of imbalanced datasets. A comparison is made between the proposed Borderline-DEMNET workflow and the existing DEMNET model, which focuses on classifying different dementia and AD stages. The evaluation metrics specified in the paper are used to assess the results. The framework is trained, tested, and validated using the Kaggle dataset, while the robustness of the work is checked using the ADNI dataset. The proposed workflow achieves an accuracy of 99.17% for the Kaggle dataset and 99.14% for the ADNI dataset. In conclusion, the proposed workflow outperforms previously identified models, particularly in terms of accuracy. It also proves that selecting a proper class balancing technique will increase 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.003 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".