Novel interpretable meta-learning approach for Alzheimer's disease diagnosis and fixed-horizon progression prediction using variable-length longitudinal sequences


Abstract

The early diagnosis and successful treatment of Alzheimer's Disease (AD) depend on the accurate prediction of its stages. Men 65 years old in the US have a 19.5% lifetime risk of Alzheimer's disease, while women have a 21.1% risk. In 2020, over 6.1 million persons aged 65 years and older in the United States suffered from Alzheimer's disease, with this number predicted to rise to 8.5 million by the year 2030. This research addresses the multi-class classification challenge of categorizing Alzheimer's disease into three categories: Cognitively Normal (CN), Mild Cognitive Impairment (MCI), and Dementia, utilizing clinical and imaging data from the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset. We propose a novel stacking ensemble model, TriBoost-StackNet, that incorporates Random Forest(RF), XGBoost, and LightGBM as foundational learners, with Logistic Regression (LR) functioning as the meta-classifier. The model attained a classification accuracy of 97.61%, markedly surpassing current methodologies in recent research. Our critical disease prediction study provides joint MMSE + DX forecasting and also supports interpretability via SHAP. Longitudinal forecasting of Mini-Mental State Examination (MMSE) scores and clinical diagnoses (DX) at 12, 18, 24, and 36 months was performed by modeling patient trajectories as variable-length longitudinal sequences. The XGBoost model was assessed using 5-fold cross-validation and demonstrated strong MMSE prediction, with an R² of 0.87 at 24 months and effective DX classification, achieving 83.79% accuracy at 12 months. This study illustrates that interpretable, tree-based ensemble models can achieve superior performance in predicting AD stages with minimal preprocessing, presenting a viable approach for clinical use.
Ask to review this manuscript

Notes for potential reviewers

  • Volunteering is not a guarantee that you will be asked to review. There are many reasons: reviewers must be qualified, there should be no conflicts of interest, a minimum of two reviewers have already accepted an invitation, etc.
  • This is NOT OPEN peer review. The review is single-blind, and all recommendations are sent privately to the Academic Editor handling the manuscript. All reviews are published and reviewers can choose to sign their reviews.
  • What happens after volunteering? It may be a few days before you receive an invitation to review with further instructions. You will need to accept the invitation to then become an official referee for the manuscript. If you do not receive an invitation it is for one of many possible reasons as noted above.

  • PeerJ Computer Science does not judge submissions based on subjective measures such as novelty, impact or degree of advance. Effectively, reviewers are asked to comment on whether or not the submission is scientifically and technically sound and therefore deserves to join the scientific literature. Our Peer Review criteria can be found on the "Editorial Criteria" page - reviewers are specifically asked to comment on 3 broad areas: "Basic Reporting", "Experimental Design" and "Validity of the Findings".
  • Reviewers are expected to comment in a timely, professional, and constructive manner.
  • Until the article is published, reviewers must regard all information relating to the submission as strictly confidential.
  • When submitting a review, reviewers are given the option to "sign" their review (i.e. to associate their name with their comments). Otherwise, all review comments remain anonymous.
  • All reviews of published articles are published. This includes manuscript files, peer review comments, author rebuttals and revised materials.
  • Each time a decision is made by the Academic Editor, each reviewer will receive a copy of the Decision Letter (which will include the comments of all reviewers).

If you have any questions about submitting your review, please email us at [email protected].