Automatic Alzheimer’s Disease Recognition from MRI Data Using Deep Learning Method
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Alzheimer’s Disease (AD), the most common form of dementia, is an incurable neurological condition that results in a progressive mental deterioration. Although definitive diagnosis of AD is difficult, in practice, AD diagnosis is largely based on clinical history and neuropsychological data including magnetic resource imaging (MRI). Increasing research has been reported on applying machine learning to AD recognition in recent years. This paper presents our latest contribution to the advance. It describes an automatic AD recognition algorithm that is based on deep learning on 3D brain MRI. The algorithm uses a convolutional neural network (CNN) to fulfil AD recognition. It is unique in that the three dimensional topology of brain is considered as a whole in AD recognition, resulting in an accurate recognition. The CNN used in this study consists of three consecutive groups of processing layers, two fully connected layers and a classification layer. In the structure, every one of the three groups is made up of three layers, including a convolutional layer, a pooling layer and a normalization layer. The algorithm was trained and tested using the MRI data from Alzheimer’s Disease Neuroimaging Initiative. The data used include the MRI scanning of about 47 AD patients and 34 normal controls. The experiment had shown that the proposed algorithm delivered a high AD recognition accuracy with a sensitivity of 1 and a specificity of 0.93.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it