TY - JOUR
T1 - Multi-objective Harris Hawk metaheuristic algorithms for the diagnosis of Parkinson's disease
AU - Dokeroglu, Tansel
AU - Kucukyilmaz, Tayfun
N1 - Publisher Copyright:
© 2025 The Authors
PY - 2025/4/25
Y1 - 2025/4/25
N2 - Parkinson's disease, an idiopathic neurological illness, affects over 1% of the global elderly population. Feature-based methods are frequently used to diagnose Parkinson's disease, and selecting the best feature set remains an ongoing and difficult challenge. In this study, we introduce a new binary Multi-objective Harris Hawk Optimization (MHHO) algorithm that combines an adaptive K-Nearest Neighbor (KNN) classifier with novel exploration and exploitation operators for this challenging task. In larger problem instances, where fitness evaluation is a bottleneck, this study proposes a parallel version of the technique that uses Message Passing Interfaces (MPI) to reduce computational complexity. Comprehensive comparisons with state-of-the-art algorithms, including Genetic Algorithm, Particle Swarm Optimization, Binary Bat, Cuckoo Search, and Grey Wolf Optimization, are performed. The results indicate that our proposed algorithms are consistently the most successful in the literature. Furthermore, our analysis provides new optimal solutions that have not previously been reported in the literature. For three of the four well-known datasets, our algorithm outperforms recent studies. Furthermore, the suggested approaches achieve more than 30% reduction in the total number of features across all datasets, thereby significantly lowering computational costs.
AB - Parkinson's disease, an idiopathic neurological illness, affects over 1% of the global elderly population. Feature-based methods are frequently used to diagnose Parkinson's disease, and selecting the best feature set remains an ongoing and difficult challenge. In this study, we introduce a new binary Multi-objective Harris Hawk Optimization (MHHO) algorithm that combines an adaptive K-Nearest Neighbor (KNN) classifier with novel exploration and exploitation operators for this challenging task. In larger problem instances, where fitness evaluation is a bottleneck, this study proposes a parallel version of the technique that uses Message Passing Interfaces (MPI) to reduce computational complexity. Comprehensive comparisons with state-of-the-art algorithms, including Genetic Algorithm, Particle Swarm Optimization, Binary Bat, Cuckoo Search, and Grey Wolf Optimization, are performed. The results indicate that our proposed algorithms are consistently the most successful in the literature. Furthermore, our analysis provides new optimal solutions that have not previously been reported in the literature. For three of the four well-known datasets, our algorithm outperforms recent studies. Furthermore, the suggested approaches achieve more than 30% reduction in the total number of features across all datasets, thereby significantly lowering computational costs.
UR - http://www.scopus.com/inward/record.url?scp=85215383201&partnerID=8YFLogxK
U2 - 10.1016/j.eswa.2025.126503
DO - 10.1016/j.eswa.2025.126503
M3 - Article
AN - SCOPUS:85215383201
SN - 0957-4174
VL - 270
JO - Expert Systems with Applications
JF - Expert Systems with Applications
M1 - 126503
ER -