JOURNAL ARTICLE

Feature subset selection using improved binary gravitational search algorithm

Esmat RashediHossein Nezamabadi–pour

Year: 2014 Journal:   Journal of Intelligent & Fuzzy Systems Vol: 26 (3)Pages: 1211-1221   Publisher: IOS Press

Abstract

Feature selection is one of the important activities in various fields such as computer vision and pattern recognition. In this paper, an improved version of the binary gravitational search algorithm (BGSA) is proposed and used as a tool to select the best subset of features with the goal of improving classification accuracy. By enhancing the transfer function, we give BGSA the ability to overcome the stagnation situation. This allows the search algorithm to explore a larger group of possibilities and avoid stagnation. To evaluate the proposed improved BGSA (IBGSA), classification of some well known datasets and improving the accuracy of CBIR systems are experienced. Results are compared with those of original BGSA, genetic algorithm (GA), binary particle swarm optimization (BPSO), and electromagnetic-like mechanism. Comparative results confirm the effectiveness of the proposed IBGSA in feature selection.

Keywords:
Computer science Feature selection Binary number Feature (linguistics) Selection (genetic algorithm) Algorithm Pattern recognition (psychology) Binary search algorithm Artificial intelligence Search algorithm Mathematics

Metrics

80
Cited By
12.56
FWCI (Field Weighted Citation Impact)
46
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence
Evolutionary Algorithms and Applications
Physical Sciences →  Computer Science →  Artificial Intelligence
Advanced Image and Video Retrieval Techniques
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
© 2026 ScienceGate Book Chapters — All rights reserved.