Related Experiment Video
Updated: Sep 6, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
Published on: October 11, 2018
Improved Binary Grasshopper Optimization Algorithm for Feature Selection Problem
Gui-Ling Wang1, Shu-Chuan Chu1,2, Ai-Qing Tian1
1College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.
This study enhances the binary grasshopper optimization algorithm (BGOA) by modifying its step size and introducing new transfer functions. The improved BGOA demonstrates superior performance in optimization tasks and feature selection compared to existing methods.
Area of Science:
- Computational Intelligence
- Metaheuristic Optimization
- Swarm Intelligence
Background:
- The grasshopper optimization algorithm (GOA) is a nature-inspired metaheuristic algorithm simulating grasshopper behavior.
- The binary grasshopper optimization algorithm (BGOA) adapts GOA for binary optimization problems.
- Existing BGOA methods may have limitations in exploration capability and solution quality.
Purpose of the Study:
- To enhance the exploration capability and solution quality of the binary grasshopper optimization algorithm (BGOA).
- To introduce novel modifications to the BGOA's step size and propose new transfer functions.
- To validate the effectiveness of the improved BGOA through comparative experiments and real-world applications.
Main Methods:
- Modification of the step size parameter within the BGOA framework.
- Development and integration of three new transfer functions to improve solution space exploration.
- Comparative analysis against BGOA, particle swarm optimization (PSO), and binary gray wolf optimizer (BGWO) on 23 benchmark functions.
- Application of the improved algorithm for feature selection on 23 UCI datasets.
- Statistical validation using Wilcoxon rank-sum and Friedman tests.
Main Results:
- The improved BGOA demonstrated significantly superior performance across most benchmark test functions compared to BGOA, PSO, and BGWO.
- The optimized algorithm achieved higher accuracy and selected fewer features in the feature selection task on UCI datasets.
- The proposed modifications effectively enhanced the algorithm's exploration capability and the quality of the obtained solutions.
Conclusions:
- The enhanced BGOA with modified step size and new transfer functions represents a significant improvement over existing binary optimization algorithms.
- The improved algorithm is highly effective for both general optimization problems and practical applications like feature selection.
- The study validates the proposed enhancements through rigorous testing and statistical analysis, confirming its superior performance and efficiency.
More Related Videos
11:53Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
08:52Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
Published on: December 22, 2023
Related Concept Videos
Quantifying and Rejecting Outliers: The Grubbs Test
Frequency-dependent Selection
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Expected Frequencies in Goodness-of-Fit Tests
What is Natural Selection?
Woodward–Hoffmann Selection Rules and Microscopic Reversibility