返回
Chaotic binary Group Search Optimizer for feature selection
DOI:10.1016/j.eswa.2021.116368.png)
摘要
En 中文
Feature selection (FS) is recognized as one of the majority public and challenging problems in the Machine Learning domain. FS can be examined as an optimization problem that needs an effective optimizer to determine its optimal subset of more informative features. This paper proposes a wrapper FS method that combines chaotic maps (CMs) and binary Group Search Optimizer (GSO) called CGSO, which is used to solve the FS problem. In this method, five chaotic maps are incorporated with the GSO algorithm's main procedures, namely, Logistic, Piecewise, Singer, Sinusoidal, and Tent. The GSO algorithm is used as a search strategy, while k-NN is employed as an induction algorithm. The objective function is to integrate three main objectives: maximizing the classification accuracy value, minimizing the number of selected features, and minimizing the complexity of generated k-NN models. To evaluate the proposed methods' performance, twenty well-known UCI datasets are used and compared with other well-known published methods in the literature. The obtained results reveal the superiority of the proposed methods in outperforming other well-known methods, especially when using binary GSO with Tent CM. Finally, it is a beneficial method to be utilized in systems that require FS pre-processing.
Keyword:
Group Search Optimizer (GSO)
Chaotic maps
Feature selection (FS)
Optimization problem
Meta-heuristic algorithm
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
Resistance of the insulin crystal to lysosomal proteases: implications for pancreatic B-cell crinophagy
Diabetologia
IF0
PL02: Probiotic regimen for outpatient gastroenteritis utility of treatment (PROGUT) study: a multicenter randomized controlled trial
CJEM
IF0
Hybrid binary ant lion optimizer with rough set and approximate entropy reducts for feature selection具有粗糙集和近似熵约简的混合二进制蚂蚁狮子优化器,用于特征选择
SOFT COMPUTING
IF2.5

