Multi-objective Harris Hawk Algorithms for the Diagnosis of Parkinson's Disease
preprint
OA: closed
CC-BY-4.0
Abstract
This study proposes new binary Harris Hawk Optimization algorithms for diagnosing Parkinson's disease. New exploration and exploitation operators are developed, and a K-Nearest Neighbour classifier that adapts to the given dataset is employed. A parallel version of the algorithm implemented using Message Passing Interfaces is proposed for large problem instances where the fitness evaluation is time-consuming. Comparisons with state-of-the-art genetic, particle swarm, binary bat, cuckoo search, and grey wolf algorithms verified that our proposed algorithms are the best methods in the literature on average in terms of prediction accuracy values. In total, a 32.5% reduction is achieved in the number of features of all datasets. We report new best solutions for the first time in literature. For three datasets out of four, we outperformed state-of-the-art algorithms.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-06-04T02:00:05.705006+00:00
License: CC-BY-4.0