Binary Grey Wolf Optimizer with Mutation and Adaptive K-nearest Neighbour for Feature Selection in Parkinson’s Disease Diagnosis

A novel feature extraction method based on dynamic handwriting for Parkinson's disease detection

Parkinson's disease (PD) is a common disease of the elderly. Given the easy accessibility of handwriting samples, many researchers have proposed handwriting-based detection methods for Parkinson's disease. Extracting more discriminative features from handwriting is an important step. Although many features have been proposed in previous researches, the insight analysis of the combination of handwriting's kinematic, pressure, and angle dynamic features is lacking. Moreover, most existing feature is incompletely represented, with feature information lost. Therefore, to solve the above problems, a new feature extraction approach for PD detection is proposed using handwriting. First, built on the kinematic, pressure, and angle dynamic features, we propose a moment feature by composed these three types of features, an overall representation of these three types of features information. Then, we proposed a feature extraction method to extract time-frequency-based statistical (TF-ST) features from dynamic handwriting features in terms of their temporal and frequency characteristics. Finally, we proposed an escape Coati Optimization Algorithm (eCOA) for global optimization to enhance classification performance. Self-constructed and public datasets are used to verify the proposed method's effectiveness respectively. The experimental results showed an accuracy of 97.95% and 98.67%, a sensitivity of 98.15% (average) and 97.78%, a specificity of 99.17% (average) and 100%, and an AUC of 98.66% (average) and 98.89%. The code is available at https://github.com/dreamhcy/MLforPD.

A Comparative Study of Metaheuristic Feature Selection Algorithms for Respiratory Disease Classification

The correct diagnosis and early treatment of respiratory diseases can significantly improve the health status of patients, reduce healthcare expenses, and enhance quality of life. Therefore, there has been extensive interest in developing automatic respiratory disease detection systems. Most recent methods for detecting respiratory disease use machine and deep learning algorithms. The success of these machine learning methods depends heavily on the selection of proper features to be used in the classifier. Although metaheuristic-based feature selection methods have been successful in addressing difficulties presented by high-dimensional medical data in various biomedical classification tasks, there is not much research on the utilization of metaheuristic methods in respiratory disease classification. This paper aims to conduct a detailed and comparative analysis of six widely used metaheuristic optimization methods using eight different transfer functions in respiratory disease classification. For this purpose, two different classification cases were examined: binary and multi-class. The findings demonstrate that metaheuristic algorithms using correct transfer functions could effectively reduce data dimensionality while enhancing classification accuracy.

Social coevolution and Sine chaotic opposition learning Chimp Optimization Algorithm for feature selection

Feature selection is a hot problem in machine learning. Swarm intelligence algorithms play an essential role in feature selection due to their excellent optimisation ability. The Chimp Optimisation Algorithm (CHoA) is a new type of swarm intelligence algorithm. It has quickly won widespread attention in the academic community due to its fast convergence speed and easy implementation. However, CHoA has specific challenges in balancing local and global search, limiting its optimisation accuracy and leading to premature convergence, thus affecting the algorithm's performance on feature selection tasks. This study proposes Social coevolution and Sine chaotic opposition learning Chimp Optimization Algorithm (SOSCHoA). SOSCHoA enhances inter-population interaction through social coevolution, improving local search. Additionally, it introduces sine chaotic opposition learning to increase population diversity and prevent local optima. Extensive experiments on 12 high-dimensional classification datasets demonstrate that SOSCHoA outperforms existing algorithms in classification accuracy, convergence, and stability. Although SOSCHoA shows advantages in handling high-dimensional datasets, there is room for future research and optimization, particularly concerning feature dimensionality reduction.

BGOA-TVG: Binary Grasshopper Optimization Algorithm with Time-Varying Gaussian Transfer Functions for Feature Selection

Feature selection aims to select crucial features to improve classification accuracy in machine learning and data mining. In this paper, a new binary grasshopper optimization algorithm using time-varying Gaussian transfer functions (BGOA-TVG) is proposed for feature selection. Compared with the traditional S-shaped and V-shaped transfer functions, the proposed Gaussian time-varying transfer functions have the characteristics of a fast convergence speed and a strong global search capability to convert a continuous search space to a binary one. The BGOA-TVG is tested and compared to S-shaped and V-shaped binary grasshopper optimization algorithms and five state-of-the-art swarm intelligence algorithms for feature selection. The experimental results show that the BGOA-TVG has better performance in UCI, DEAP, and EPILEPSY datasets for feature selection.

Enhancing Diagnosis of Rotating Elements in Roll-to-Roll Manufacturing Systems through Feature Selection Approach Considering Overlapping Data Density and Distance Analysis

Roll-to-roll manufacturing systems have been widely adopted for their cost-effectiveness, eco-friendliness, and mass-production capabilities, utilizing thin and flexible substrates. However, in these systems, defects in the rotating components such as the rollers and bearings can result in severe defects in the functional layers. Therefore, the development of an intelligent diagnostic model is crucial for effectively identifying these rotating component defects. In this study, a quantitative feature-selection method, feature partial density, to develop high-efficiency diagnostic models was proposed. The feature combinations extracted from the measured signals were evaluated based on the partial density, which is the density of the remaining data excluding the highest class in overlapping regions and the Mahalanobis distance by class to assess the classification performance of the models. The validity of the proposed algorithm was verified through the construction of ranked model groups and comparison with existing feature-selection methods. The high-ranking group selected by the algorithm outperformed the other groups in terms of training time, accuracy, and positive predictive value. Moreover, the top feature combination demonstrated superior performance across all indicators compared to existing methods.

Binary Sand Cat Swarm Optimization Algorithm for Wrapper Feature Selection on Biological Data

In large datasets, irrelevant, redundant, and noisy attributes are often present. These attributes can have a negative impact on the classification model accuracy. Therefore, feature selection is an effective pre-processing step intended to enhance the classification performance by choosing a small number of relevant or significant features. It is important to note that due to the NP-hard characteristics of feature selection, the search agent can become trapped in the local optima, which is extremely costly in terms of time and complexity. To solve these problems, an efficient and effective global search method is needed. Sand cat swarm optimization (SCSO) is a newly introduced metaheuristic algorithm that solves global optimization algorithms. Nevertheless, the SCSO algorithm is recommended for continuous problems. bSCSO is a binary version of the SCSO algorithm proposed here for the analysis and solution of discrete problems such as wrapper feature selection in biological data. It was evaluated on ten well-known biological datasets to determine the effectiveness of the bSCSO algorithm. Moreover, the proposed algorithm was compared to four recent binary optimization algorithms to determine which algorithm had better efficiency. A number of findings demonstrated the superiority of the proposed approach both in terms of high prediction accuracy and small feature sizes.

A new parallel multi-objective Harris hawk algorithm for predicting the mortality of COVID-19 patients

Harris' Hawk Optimization (HHO) is a novel metaheuristic inspired by the collective hunting behaviors of hawks. This technique employs the flight patterns of hawks to produce (near)-optimal solutions, enhanced with feature selection, for challenging classification problems. In this study, we propose a new parallel multi-objective HHO algorithm for predicting the mortality risk of COVID-19 patients based on their symptoms. There are two objectives in this optimization problem: to reduce the number of features while increasing the accuracy of the predictions. We conduct comprehensive experiments on a recent real-world COVID-19 dataset from Kaggle. An augmented version of the COVID-19 dataset is also generated and experimentally shown to improve the quality of the solutions. Significant improvements are observed compared to existing state-of-the-art metaheuristic wrapper algorithms. We report better classification results with feature selection than when using the entire set of features. During experiments, a 98.15% prediction accuracy with a 45% reduction is achieved in the number of features. We successfully obtained new best solutions for this COVID-19 dataset.

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.

Low-Carbon and Low-Energy-Consumption Gear Processing Route Optimization Based on Gray Wolf Algorithm

The process of gear machining consumes a large amount of energy and causes serious pollution to the environment. Developing a proper process route of gear machining is the key to conserving energy and reducing emissions. Nowadays, the proper process route of gear machining is based on experience and is difficult to keep up with the development of modern times. In this article, a calculation model of low-carbon and low-energy consumption in gear machining processes was established based on an analysis of the machining process. With processing parameters as independent variables, the grey wolf algorithm was used to solve the problem. The effectiveness of the method was proven by an example of the machining process of an automobile transmission shaft.

The Applications of Metaheuristics for Human Activity Recognition and Fall Detection Using Wearable Sensors: A Comprehensive Analysis

In this paper, we study the applications of metaheuristics (MH) optimization algorithms in human activity recognition (HAR) and fall detection based on sensor data. It is known that MH algorithms have been utilized in complex engineering and optimization problems, including feature selection (FS). Thus, in this regard, this paper used nine MH algorithms as FS methods to boost the classification accuracy of the HAR and fall detection applications. The applied MH were the Aquila optimizer (AO), arithmetic optimization algorithm (AOA), marine predators algorithm (MPA), artificial bee colony (ABC) algorithm, genetic algorithm (GA), slime mold algorithm (SMA), grey wolf optimizer (GWO), whale optimization algorithm (WOA), and particle swarm optimization algorithm (PSO). First, we applied efficient prepossessing and segmentation methods to reveal the motion patterns and reduce the time complexities. Second, we developed a light feature extraction technique using advanced deep learning approaches. The developed model was ResRNN and was composed of several building blocks from deep learning networks including convolution neural networks (CNN), residual networks, and bidirectional recurrent neural networks (BiRNN). Third, we applied the mentioned MH algorithms to select the optimal features and boost classification accuracy. Finally, the support vector machine and random forest classifiers were employed to classify each activity in the case of multi-classification and to detect fall and non-fall actions in the case of binary classification. We used seven different and complex datasets for the multi-classification case: the PAMMP2, Sis-Fall, UniMiB SHAR, OPPORTUNITY, WISDM, UCI-HAR, and KU-HAR datasets. In addition, we used the Sis-Fall dataset for the binary classification (fall detection). We compared the results of the nine MH optimization methods using different performance indicators. We concluded that MH optimization algorithms had promising performance in HAR and fall detection applications.