A Robust Distributed Deep Learning Approach to Detect Alzheimer’s Disease from MRI Images
Bibliographic record
Abstract
Alzheimer’s disease has become a major concern in the healthcare domain as it is growing rapidly. Much research has been conducted to detect it from MRI images through various deep learning approaches.However, the problems of the availability of medical data and preserving the privacy of patients still exists. To mitigate this issue in Alzheimer’s disease detection, we implement the federated approach, which is found to be more efficient, robust, and consistent compared with the conventional approach. For this, we need deep excavation on various orientations of MRI images and transfer learning architectures. Then, we utilize two publicly available datasets (OASIS and ADNI) and design various cases to evaluate the performance of the federated approach. The federated approach achieves better accuracy and sensitivity compared with the conventional approaches in most of the cases. Moreover, the robustness of the proposed approach is also found to be better than the conventional approach. In our federated approach, MobileNet, a low-cost transfer learning architecture, achieves the highest 95.24%, 81.94%, and 83.97% accuracy in the OASIS, ADNI, and merged (ADNI + OASIS) test sets, which is much higher than the achieved performance in the conventional approach. Furthermore, in the proposed approach, only the weights of the model are shared, which keeps the original MRI images in their respective hospital or institutions, preserving privacy in the healthcare domain.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".