2019
DOI: 10.1109/access.2019.2935833
|View full text |Cite
|
Sign up to set email alerts
|

Feature Selection Using an Improved Gravitational Search Algorithm

Abstract: Feature selection is an important issue in the field of machine learning, which can reduce misleading computations and improve classification performance. Generally, feature selection can be considered as a binary optimization problem. Gravitational Search Algorithm (GSA) is a population-based heuristic algorithm inspired by Newton's laws of gravity and motion. Although GSA shows good performance in solving optimization problems, it has a shortcoming of premature convergence. In this paper, the concept of glob… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(13 citation statements)
references
References 30 publications
0
13
0
Order By: Relevance
“…Furthermore, Zhu et al [ 290 ] proposed an improved GSA known as IGSA, which adopted the concept of global memory and the definition of exponential Kbest to improve the baseline GSA. In this approach, the authors improved the exploitation ability of the IGSA by memorizing the optimal solution obtained, thereby preventing the particles from premature convergence and slow movement, maintaining an equilibrium between the exploration and exploitation.…”
Section: Metaheuristic Algorithms For Multiclass Feature Selectionmentioning
confidence: 99%
“…Furthermore, Zhu et al [ 290 ] proposed an improved GSA known as IGSA, which adopted the concept of global memory and the definition of exponential Kbest to improve the baseline GSA. In this approach, the authors improved the exploitation ability of the IGSA by memorizing the optimal solution obtained, thereby preventing the particles from premature convergence and slow movement, maintaining an equilibrium between the exploration and exploitation.…”
Section: Metaheuristic Algorithms For Multiclass Feature Selectionmentioning
confidence: 99%
“…Here, G(t) is the gravitational constant, and its formulation is defined as follows where T is the total number of iterations, G 0 represents the initial value for the gravitational constant and α is a coefficient. 24…”
Section: The Proposed Methodsmentioning
confidence: 99%
“…where T is the total number of iterations, G 0 represents the initial value for the gravitational constant and is a coefficient. 24 The resultant force for agent X i in the dth dimension is the randomly weighted sum of forces from Kbest agents. The Kbest denotes the set of the first K agents with the best fitness values.…”
Section: Gravitational Search Algorithmmentioning
confidence: 99%
“…Mistry et al [25] propose a micro-GA embedded PSO feature selection method for the intelligent facial emotion recognition problems. Zhu et al [26] propose an improved gravitational search algorithm to solve the feature selection problems, and the effectiveness of the proposed method are evaluated on several widely used datasets. Taradeh et al [27] propose another gravitational search-based algorithm for feature selection.…”
Section: Related Workmentioning
confidence: 99%