Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Improved Binary Grey Wolf Optimization Approaches for Feature Selection Optimization

View through CrossRef
Feature selection is a preprocessing step for various classification tasks. Its objective is to identify the most optimal features in a dataset by eliminating redundant data while preserving the highest possible classification accuracy. Three improved binary Grey Wolf Optimization (GWO) approaches are proposed in this paper to optimize the feature selection process by enhancing the feature selection accuracy while selecting the least possible number of features. Each approach combines GWO with Particle Swarm Optimization (PSO) by implementing GWO followed by PSO. Afterwards, each approach manipulates the solutions obtained by both algorithms in a different way. The objective of this combination is to overcome the GWO stuck-in-local-optima problem that might occur by leveraging the PSO-wide search space exploration ability on the solutions obtained by GWO. Both S-shaped and V-shaped binary transfer functions were used to convert the continuous solutions obtained from each proposed approach to their corresponding binary versions. The three proposed approaches were evaluated using nine small-instance, high-dimensional, cancer-related human gene expression datasets. A set of comparisons were made against the original binary versions of both GWO and PSO algorithms and against eight state-of-the-art feature selection binary optimizers in addition to one of the recent binary optimizers that combines PSO with GWO. The evaluation results showed that one of the proposed S-shaped and V-shaped approaches achieved 0.9 and 0.95 average classification accuracy, respectively, while selecting the fewest number of features. The results also confirmed the superiority of one of the proposed V-shaped approaches when compared with the original binary GWO and PSO approaches. Moreover, the results confirmed the superiority, in most of the datasets, of one of the three approaches over the state-of-the-art approaches. Finally, the results revealed that the best approach in terms of classification accuracy, fitness value, and number of selected features had the highest computational complexity.
Title: Improved Binary Grey Wolf Optimization Approaches for Feature Selection Optimization
Description:
Feature selection is a preprocessing step for various classification tasks.
Its objective is to identify the most optimal features in a dataset by eliminating redundant data while preserving the highest possible classification accuracy.
Three improved binary Grey Wolf Optimization (GWO) approaches are proposed in this paper to optimize the feature selection process by enhancing the feature selection accuracy while selecting the least possible number of features.
Each approach combines GWO with Particle Swarm Optimization (PSO) by implementing GWO followed by PSO.
Afterwards, each approach manipulates the solutions obtained by both algorithms in a different way.
The objective of this combination is to overcome the GWO stuck-in-local-optima problem that might occur by leveraging the PSO-wide search space exploration ability on the solutions obtained by GWO.
Both S-shaped and V-shaped binary transfer functions were used to convert the continuous solutions obtained from each proposed approach to their corresponding binary versions.
The three proposed approaches were evaluated using nine small-instance, high-dimensional, cancer-related human gene expression datasets.
A set of comparisons were made against the original binary versions of both GWO and PSO algorithms and against eight state-of-the-art feature selection binary optimizers in addition to one of the recent binary optimizers that combines PSO with GWO.
The evaluation results showed that one of the proposed S-shaped and V-shaped approaches achieved 0.
9 and 0.
95 average classification accuracy, respectively, while selecting the fewest number of features.
The results also confirmed the superiority of one of the proposed V-shaped approaches when compared with the original binary GWO and PSO approaches.
Moreover, the results confirmed the superiority, in most of the datasets, of one of the three approaches over the state-of-the-art approaches.
Finally, the results revealed that the best approach in terms of classification accuracy, fitness value, and number of selected features had the highest computational complexity.

Related Results

Everyday Life in the "Tourist Zone"
Everyday Life in the "Tourist Zone"
This article makes a case for the everyday while on tour and argues that the ability to continue with everyday routines and social relationships, while at the same time moving thro...
Grey relations
Grey relations
PurposeThe goal of this article is to introduce the notion of a grey relation between grey sets using grey numbers.Design/methodology/approachThis study uses the grey number to cre...
Explanations about grey information and framework of grey system modeling
Explanations about grey information and framework of grey system modeling
Purpose The purpose of this paper is to summarize the different types of grey information, explain the mechanism of grey system modeling and reconstruct the framework of grey syste...
General grey number decision-making model and its application based on intuitionistic grey number set
General grey number decision-making model and its application based on intuitionistic grey number set
PurposeThe purpose of this paper is to study the grey decision model and distance measuring method of general grey number.Design/methodology/approachFirst, intuitionistic grey numb...
General grey numbers and their operations
General grey numbers and their operations
PurposeThe purpose of this paper is to advance new rules about operations of grey numbers.Design/methodology/approachThe paper first puts forward the definitions of basic element o...
Covered solution for a grey linear program based on a general formula for the inverse of a grey matrix
Covered solution for a grey linear program based on a general formula for the inverse of a grey matrix
Purpose – This paper attempts to establish the general formula for computing the inverse of grey matrix, and the results are applied to solve grey linear programmin...
Grey clustering and grey ranking of bank branches based on grey efficiency
Grey clustering and grey ranking of bank branches based on grey efficiency
PurposeCompetition in the banking sector is more complex than in the past, and survival has become more difficult than before. The purpose of this paper is to propose a grey method...
Hybrid Gradient Descent Grey Wolf Optimizer for Optimal Feature Selection
Hybrid Gradient Descent Grey Wolf Optimizer for Optimal Feature Selection
Feature selection is the process of decreasing the number of features in a dataset by removing redundant, irrelevant, and randomly class‐corrected data features. By applying featur...

Back to Top