scholarly journals A New Competitive Binary Grey Wolf Optimizer to Solve the Feature Selection Problem in EMG Signals Classification

Computers ◽  
2018 ◽  
Vol 7 (4) ◽  
pp. 58 ◽  
Author(s):  
Jingwei Too ◽  
Abdul Abdullah ◽  
Norhashimah Mohd Saad ◽  
Nursabillilah Mohd Ali ◽  
Weihown Tee
Keyword(s):  
Feature Selection ◽  
Feature Reduction ◽  
Selection Problem ◽  
Grey Wolf Optimizer ◽  
Binary Particle Swarm Optimization ◽  
Feature Subset ◽  
Grey Wolf ◽  
Feature Selection Problem ◽  
Time Frequency ◽  
Emg Signal

Features extracted from the electromyography (EMG) signal normally consist of irrelevant and redundant features. Conventionally, feature selection is an effective way to evaluate the most informative features, which contributes to performance enhancement and feature reduction. Therefore, this article proposes a new competitive binary grey wolf optimizer (CBGWO) to solve the feature selection problem in EMG signals classification. Initially, short-time Fourier transform (STFT) transforms the EMG signal into time-frequency representation. Ten time-frequency features are extracted from the STFT coefficient. Then, the proposed method is used to evaluate the optimal feature subset from the original feature set. To evaluate the effectiveness of proposed method, CBGWO is compared with binary grey wolf optimization (BGWO1 and BGWO2), binary particle swarm optimization (BPSO), and genetic algorithm (GA). The experimental results show the superiority of CBGWO not only in classification performance, but also feature reduction. In addition, CBGWO has a very low computational cost, which is more suitable for real world application.

scholarly journals EMG Feature Selection and Classification Using a Pbest-Guide Binary Particle Swarm Optimization

Computation ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 12 ◽  
Author(s):  
Jingwei Too ◽  
Abdul Abdullah ◽  
Norhashimah Mohd Saad ◽  
Weihown Tee
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Performance Comparison ◽  
Feature Reduction ◽  
Binary Particle Swarm Optimization ◽  
Discrete Wavelet ◽  
Feature Selection Problem ◽  
Swarm Optimization ◽  
Emg Signal

Due to the increment in hand motion types, electromyography (EMG) features are increasingly required for accurate EMG signals classification. However, increasing in the number of EMG features not only degrades classification performance, but also increases the complexity of the classifier. Feature selection is an effective process for eliminating redundant and irrelevant features. In this paper, we propose a new personal best (Pbest) guide binary particle swarm optimization (PBPSO) to solve the feature selection problem for EMG signal classification. First, the discrete wavelet transform (DWT) decomposes the signal into multiresolution coefficients. The features are then extracted from each coefficient to form the feature vector. After which pbest-guide binary particle swarm optimization (PBPSO) is used to evaluate the most informative features from the original feature set. In order to measure the effectiveness of PBPSO, binary particle swarm optimization (BPSO), genetic algorithm (GA), modified binary tree growth algorithm (MBTGA), and binary differential evolution (BDE) were used for performance comparison. Our experimental results show the superiority of PBPSO over other methods, especially in feature reduction; where it can reduce more than 90% of features while keeping a very high classification accuracy. Hence, PBPSO is more appropriate for application in clinical and rehabilitation applications.

scholarly journals Feature Selection Based on Binary Tree Growth Algorithm for the Classification of Myoelectric Signals

Machines ◽  
2018 ◽  
Vol 6 (4) ◽  
pp. 65 ◽  
Author(s):  
Jingwei Too ◽  
Abdul Abdullah ◽  
Norhashimah Mohd Saad ◽  
Nursabillilah Mohd Ali
Keyword(s):  
Feature Selection ◽  
Tree Growth ◽  
Binary Tree ◽  
Feature Vector ◽  
Classification Performance ◽  
Feature Reduction ◽  
Feature Subset ◽  
Selection Methods ◽  
Time Frequency ◽  
Mutation Operators

Electromyography (EMG) has been widely used in rehabilitation and myoelectric prosthetic applications. However, a recent increment in the number of EMG features has led to a high dimensional feature vector. This in turn will degrade the classification performance and increase the complexity of the recognition system. In this paper, we have proposed two new feature selection methods based on a tree growth algorithm (TGA) for EMG signals classification. In the first approach, two transfer functions are implemented to convert the continuous TGA into a binary version. For the second approach, the swap, crossover, and mutation operators are introduced in a modified binary tree growth algorithm for enhancing the exploitation and exploration behaviors. In this study, short time Fourier transform (STFT) is employed to transform the EMG signals into time-frequency representation. The features are then extracted from the STFT coefficient and form a feature vector. Afterward, the proposed feature selection methods are applied to evaluate the best feature subset from a large available feature set. The experimental results show the superiority of MBTGA not only in terms of feature reduction, but also the classification performance.

scholarly journals A Grey Wolf Optimizer Feature Selection method and its Effect on the Performance of Document Classification Problem

2021 ◽  
Vol 4 (2) ◽  
pp. 116-122
Author(s):  
Ibraheem Al-Jadir ◽  
Waleed A. Mahmoud
Keyword(s):  
Feature Selection ◽  
Feature Selection Method ◽  
Optimization Methods ◽  
Classification Problem ◽  
Performance Outcomes ◽  
Grey Wolf Optimizer ◽  
Great Success ◽  
Grey Wolf ◽  
Feature Selection Problem ◽  
Krill Herd

Optimization methods are considered as one of the highly developed areas in Artificial Intelligence (AI). The success of the Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) has encouraged researchers to develop other methods that can obtain better performance outcomes and to be more responding to the modern needs. The Grey Wolf Optimization (GWO), and the Krill Herd (KH) are some of those methods that showed a great success in different applications in the last few years. In this paper, we propose a comparative study of using different optimization methods including KH and GWO in order to solve the problem of document feature selection for the classification problem. These methods are used to model the feature selection problem as a typical optimization method. Due to the complexity and the non-linearity of this kind of problems, it becomes necessary to use some advanced techniques to make the judgement of which features subset that is optimal to enhance the performance of classification of text documents. The test results showed the superiority of GWO over the other counterparts using the specified evaluation measures.

scholarly journals An Innovative Excited-ACS-IDGWO Algorithm for Optimal Biomedical Data Feature Selection

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Davies Segera ◽  
Mwangi Mbuthia ◽  
Abraham Nyete
Keyword(s):  
Feature Selection ◽  
Cuckoo Search ◽  
Small Sample ◽  
The Other ◽  
Selection Problem ◽  
Biomedical Science ◽  
Feature Subset ◽  
Biomedical Data ◽  
Feature Selection Problem ◽  
Other Hand

Finding an optimal set of discriminative features is still a crucial but challenging task in biomedical science. The complexity of the task is intensified when any of the two scenarios arise: a highly dimensioned dataset and a small sample-sized dataset. The first scenario poses a big challenge to existing machine learning approaches since the search space for identifying the most relevant feature subset is so diverse to be explored quickly while utilizing minimal computational resources. On the other hand, the second aspect poses a challenge of too few samples to learn from. Though many hybrid metaheuristic approaches (i.e., combining multiple search algorithms) have been proposed in the literature to address these challenges with very attractive performance compared to their counterpart standard standalone metaheuristics, more superior hybrid approaches can be achieved if the individual metaheuristics within the proposed hybrid algorithms are improved prior to the hybridization. Motivated by this, we propose a new hybrid Excited- (E-) Adaptive Cuckoo Search- (ACS-) Intensification Dedicated Grey Wolf Optimization (IDGWO), i.e., EACSIDGWO. EACSIDGWO is an algorithm where the step size of ACS and the nonlinear control strategy of parameter a→ of the IDGWO are innovatively made adaptive via the concept of the complete voltage and current responses of a direct current (DC) excited resistor-capacitor (RC) circuit. Since the population has a higher diversity at early stages of the proposed EACSIDGWO algorithm, both the ACS and IDGWO are jointly involved in local exploitation. On the other hand, to enhance mature convergence at latter stages of the proposed algorithm, the role of ACS is switched to global exploration while the IDGWO is still left conducting the local exploitation. To prove that the proposed algorithm is superior in providing a good learning from fewer instances and an optimal feature selection from information-rich biomedical data, all these while maintaining a high classification accuracy of the data, the EACSIDGWO is employed to solve the feature selection problem. The EACSIDGWO as a feature selector is tested on six standard biomedical datasets from the University of California at Irvine (UCI) repository. The experimental results are compared with the state-of-the-art feature selection techniques, including binary ant-colony optimization (BACO), binary genetic algorithm (BGA), binary particle swarm optimization (BPSO), and extended binary cuckoo search algorithm (EBCSA). These results reveal that the EACSIDGWO has comprehensive superiority in tackling the feature selection problem, which proves the capability of the proposed algorithm in solving real-world complex problems. Furthermore, the superiority of the proposed algorithm is proved via various numerical techniques like ranking methods and statistical analysis.

scholarly journals Efficient Binary Symbiotic Organisms Search Algorithm Approaches for Feature Selection Problems

2020 ◽  
Author(s):  
Hekmat Mohmmadzadeh ◽  
Farhad Soleimanian Gharehchopogh
Keyword(s):  
Feature Selection ◽  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Feature Reduction ◽  
Selection Problem ◽  
Particle Swarm Algorithm ◽  
Feature Selection Problem ◽  
Symbiotic Organisms Search ◽  
The Third ◽  
Symbiotic Organisms

Feature selection is one of the main data preprocessing steps in machine learning. Its goal is to reduce the number of features by removing extra and noisy features. Feature selection methods must consider the accuracy of classification algorithms while performing feature reduction on a dataset. Meta-heuristic algorithms are the most successful and promising methods for solving this issue. The symbiotic organisms search algorithm is one of the successful meta-heuristic algorithms which is inspired by the interaction of organisms in the nature called Parasitism Commensalism Mutualism. In this paper, three engulfing binary methods based on the symbiotic organisms search algorithm are presented for solving the feature selection problem. In the first and second methods, several S-shaped and V-shaped transfer functions are used for binarizing the symbiotic organisms search algorithm, respectively. These methods are called BSOSS and BSOSV. In the third method, two new operators called BMP and BCP are presented for binarizing the symbiotic organisms search algorithm. This method is called EBSOS. The third approach presents an advanced binary version of the coexistence search algorithm with two new operators, BMP and BCP, to solve the feature selection problem, named EBSOS. The proposed methods are run on 18 standard UCI datasets and compared to base and important meta-heuristic algorithms. The test results show that the EBSOS method has the best performance among the three proposed approaches for binarization of the coexistence search algorithm. Finally, the proposed EBSOS approach was compared to other meta-heuristic methods including the genetic algorithm, binary bat algorithm, binary particle swarm algorithm, binary flower pollination algorithm, binary grey wolf algorithm, binary dragonfly algorithm, and binary chaotic crow search algorithm. The results of different experiments showed that the proposed EBSOS approach has better performance compared to other methods in terms of feature count and accuracy criteria. Furthermore, the proposed EBSOS approach was practically evaluated on spam email detection in particular. The results of this experiment also verified the performance of the proposed EBSOS approach. In addition, the proposed EBSOS approach is particularly combined with the classifiers including SVM, KNN, NB and MLP to evaluate this method performance in the detection of spam emails. The obtained results showed that the proposed EBSOS approach has significantly improved the accuracy and speed of all the classifiers in spam email detection.

scholarly journals Enhancing Electronic Nose Performance by Feature Selection Using an Improved Grey Wolf Optimization Based Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4065 ◽  
Author(s):  
Chao Zhang ◽  
Wen Wang ◽  
Yong Pan
Keyword(s):  
Feature Selection ◽  
Electronic Nose ◽  
Grey Wolf Optimizer ◽  
Data Sets ◽  
Feature Subset ◽  
Grey Wolf ◽  
Electronic Noses ◽  
Selection Algorithms ◽  
Multiple Assessment ◽  
Performance Of Algorithm

Electronic nose is a kind of widely-used artificial olfactory system for the detection and classification of volatile organic compounds. The high dimensionality of data collected by electronic noses can hinder the process of pattern recognition. Thus, the feature selection is an essential stage in building a robust and accurate model for gas recognition. This paper proposed an improved grey wolf optimizer (GWO) based algorithm for feature selection and applied it on electronic nose data for the first time. Two mechanisms are employed for the proposed algorithm. The first mechanism contains two novel binary transform approaches, which are used for searching feature subset from electronic nose data that maximizing the classification accuracy while minimizing the number of features. The second mechanism is based on the adaptive restart approach, which attempts to further enhance the search capability and stability of the algorithm. The proposed algorithm is compared with five efficient feature selection algorithms on three electronic nose data sets. Three classifiers and multiple assessment indicators are used to evaluate the performance of algorithm. The experimental results show that the proposed algorithm can effectively select the feature subsets that are conducive to gas recognition, which can improve the performance of the electronic nose.

scholarly journals A New Co-Evolution Binary Particle Swarm Optimization with Multiple Inertia Weight Strategy for Feature Selection

Informatics ◽  
2019 ◽  
Vol 6 (2) ◽  
pp. 21 ◽  
Author(s):  
Jingwei Too ◽  
Abdul Rahim Abdullah ◽  
Norhashimah Mohd Saad
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Particle Swarm ◽  
Grey Wolf Optimizer ◽  
Binary Particle Swarm Optimization ◽  
Feature Selection Problem ◽  
Swarm Optimization ◽  
Inertia Weight

Feature selection is a task of choosing the best combination of potential features that best describes the target concept during a classification process. However, selecting such relevant features becomes a difficult matter when large number of features are involved. Therefore, this study aims to solve the feature selection problem using binary particle swarm optimization (BPSO). Nevertheless, BPSO has limitations of premature convergence and the setting of inertia weight. Hence, a new co-evolution binary particle swarm optimization with a multiple inertia weight strategy (CBPSO-MIWS) is proposed in this work. The proposed method is validated with ten benchmark datasets from UCI machine learning repository. To examine the effectiveness of proposed method, four recent and popular feature selection methods namely BPSO, genetic algorithm (GA), binary gravitational search algorithm (BGSA) and competitive binary grey wolf optimizer (CBGWO) are used in a performance comparison. Our results show that CBPSO-MIWS can achieve competitive performance in feature selection, which is appropriate for application in engineering, rehabilitation and clinical areas.

scholarly journals A Master-Slave Binary Grey Wolf Optimizer for Optimal Feature Selection in Biomedical Data Classification

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Enock Momanyi ◽  
Davies Segera
Keyword(s):  
Feature Selection ◽  
Search Space ◽  
Grey Wolf Optimizer ◽  
Binary Particle Swarm Optimization ◽  
Biomedical Data ◽  
Grey Wolf ◽  
De Algorithm ◽  
Binary Genetic Algorithm ◽  
Sine Cosine Algorithm ◽  
Optimal Feature

A new master-slave binary grey wolf optimizer (MSBGWO) is introduced. A master-slave learning scheme is introduced to the grey wolf optimizer (GWO) to improve its ability to explore and get better solutions in a search space. Five high-dimensional biomedical datasets are used to test the ability of MSBGWO in feature selection. The experimental results of MSBGWO are superior in terms of classification accuracy, precision, recall, F -measure, and number of features selected when compared to those of the binary grey wolf optimizer version 2 (BGWO2), binary genetic algorithm (BGA), binary particle swarm optimization (BPSO), differential evolution (DE) algorithm, and sine-cosine algorithm (SCA).

scholarly journals The GRA-two algorithm for massive-scale feature selection problem in power system scenario classification and prediction

2021 ◽  
Vol 7 ◽  
pp. 293-303
Author(s):  
Yang Wang ◽  
Xinxiong Jiang ◽  
Faqi Yan ◽  
Yu Cai ◽  
Siyang Liao
Keyword(s):  
Feature Selection ◽  
Power System ◽  
Selection Problem ◽  
Feature Selection Problem ◽  
Scale Feature ◽  
Massive Scale
Sign in / Sign up

Export Citation Format

Share Document