Is the Random Forest Algorithm Suitable for Predicting Parkinson’s Disease with Mild Cognitive Impairment out of Parkinson’s Disease with Normal Cognition?
Bibliographic record
Abstract
Because it is possible to delay the progression of dementia if it is detected and treated in an early stage, identifying mild cognitive impairment (MCI) is an important primary goal of dementia treatment. The objectives of this study were to develop a random forest-based Parkinson's disease with mild cognitive impairment (PD-MCI) prediction model considering health behaviors, environmental factors, medical history, physical functions, depression, and cognitive functions using the Parkinson's Dementia Clinical Epidemiology Data (a national survey conducted by the Korea Centers for Disease Control and Prevention) and to compare the prediction accuracy of our model with those of decision tree and multiple logistic regression models. We analyzed 96 subjects (PD-MCI = 45; Parkinson's disease with normal cognition (PD-NC) = 51 subjects). The prediction accuracy of the model was calculated using the overall accuracy, sensitivity, and specificity. Based on the random forest analysis, the major risk factors of PD-MCI were, in descending order of magnitude, Clinical Dementia Rating (CDR) sum of boxes, Untitled Parkinson's Disease Rating (UPDRS) motor score, the Korean Mini Mental State Examination (K-MMSE) total score, and the K- Korean Montreal Cognitive Assessment (K-MoCA) total score. The random forest method achieved a higher sensitivity than the decision tree model. Thus, it is advisable to develop a protocol to easily identify early stage PDD based on the PD-MCI prediction model developed in this study, in order to establish individualized monitoring to track high-risk groups.
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.013 | 0.025 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 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.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".