PDD-ET: Parkinson’s Disease Detection Using ML Ensemble Techniques and Customized Big Dataset
Bibliographic record
Abstract
Parkinson’s disease (PD) is a neurological disorder affecting the nerve cells. PD gives rise to various neurological conditions, including gradual reduction in movement speed, tremors, limb stiffness, and alterations in walking patterns. Identifying Parkinson’s disease in its initial phases is crucial to preserving the well-being of those afflicted. However, accurately identifying PD in its early phases is intricate due to the aging population. Therefore, in this paper, we harnessed machine learning-based ensemble methodologies and focused on the premotor stage of PD to create a precise and reliable early-stage PD detection model named PDD-ET. We compiled a tailored, extensive dataset encompassing patient mobility, medication habits, prior medical history, rigidity, gender, and age group. The PDD-ET model amalgamates the outcomes of various ML techniques, resulting in an impressive 97.52% accuracy in early-stage PD detection. Furthermore, the PDD-ET model effectively distinguishes between multiple stages of PD and accurately categorizes the severity levels of patients affected by PD. The evaluation findings demonstrate that the PDD-ET model outperforms the SVR, CNN, Stacked LSTM, LSTM, GRU, Alex Net, [Decision Tree, RF, and SVR], Deep Neural Network, HOG, Quantum ReLU Activator, Improved KNN, Adaptive Boosting, RF, and Deep Learning Model techniques by the approximate margins of 37%, 30%, 20%, 27%, 25%, 18%, 19%, 27%, 25%, 23%, 45%, 40%, 42%, and 16%, respectively.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| 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".