A New Two-Stage Algorithm for Solving Optimization Problems.

Optimization seeks to find inputs for an objective function that result in a maximum or minimum. Optimization methods are divided into exact and approximate (algorithms). Several optimization algorithms imitate natural phenomena, laws of physics, and behavior of living organisms. Optimization based on algorithms is the challenge that underlies machine learning, from logistic regression to training neural networks for artificial intelligence. In this paper, a new algorithm called two-stage optimization (TSO) is proposed. The TSO algorithm updates population members in two steps at each iteration. For this purpose, a group of good population members is selected and then two members of this group are randomly used to update the position of each of them. This update is based on the first selected good member at the first stage, and on the second selected good member at the second stage. We describe the stages of the TSO algorithm and model them mathematically. Performance of the TSO algorithm is evaluated for twenty-three standard objective functions. In order to compare the optimization results of the TSO algorithm, eight other competing algorithms are considered, including genetic, gravitational search, grey wolf, marine predators, particle swarm, teaching-learning-based, tunicate swarm, and whale approaches. The numerical results show that the new algorithm is superior and more competitive in solving optimization problems when compared with other algorithms.

Early and High-Accuracy Diagnosis of Parkinson's Disease: Outcomes of a New Model.

Parkinson's disease (PD) is one of the significant common neurological disorders of the current age that causes uncontrollable movements like shaking, stiffness, and difficulty. The early clinical diagnosis of this disease is essential for preventing the progression of PD. Hence, an innovative method is proposed here based on combining the crow search algorithm and decision tree (CSADT) for the early PD diagnosis. This approach is used on four crucial Parkinson's datasets, including meander, spiral, voice, and speech-Sakar. Using the presented method, PD is effectively diagnosed by evaluating each dataset's critical features and extracting the primary practical outcomes. The used algorithm was compared with other machine learning algorithms of k-nearest neighbor (KNN), support vector machine (SVM), naive Baye (NB), multilayer perceptron (MLP), decision tree (DT), random tree, logistic regression, support vector machine of radial base functions (SVM of RBFs), and combined classifier in terms of accuracy, recall, and combination measure F1. The analytical results emphasize the used algorithm's superiority over the other selected ones. The proposed model yields nearly 100% accuracy through various trials on the datasets. Notably, a high detection speed achieved the lowest detection time of 2.6 seconds. The main novelty of this paper is attributed to the accuracy of the presented PD diagnosis method, which is much higher than its counterparts.