TY - JOUR
T1 - Boosted binary Harris hawks optimizer and feature selection
AU - Zhang, Yanan
AU - Liu, Renjing
AU - Wang, Xin
AU - Chen, Huiling
AU - Li, Chengye
N1 - Publisher Copyright:
© 2020, Springer-Verlag London Ltd., part of Springer Nature.
PY - 2021/10
Y1 - 2021/10
N2 - Feature selection is a required preprocess stage in most of the data mining tasks. This paper presents an improved Harris hawks optimization (HHO) to find high-quality solutions for global optimization and feature selection tasks. This method is an efficient optimizer inspired by the behaviors of Harris' hawks, which try to catch the rabbits. In some cases, the original version tends to stagnate to the local optimum solutions. Hence, a novel HHO called IHHO is proposed by embedding the salp swarm algorithm (SSA) into the original HHO to improve the search ability of the optimizer and expand the application fields. The update stage in the HHO optimizer, which is performed to update each hawk, is divided into three phases: adjusting population based on SSA to generate SSA-based population, generating hybrid individuals according to SSA-based individual and HHO-based individual, and updating search agent in the light of greedy selection and HHO’s mechanisms. A large group of experiments on many functions is carried out to investigate the efficacy of the proposed optimizer. Based on the overall results, the proposed IHHO can provide a faster convergence speed and maintain a better balance between exploration and exploitation. Moreover, according to the proposed continuous IHHO, a more stable binary IHHO is also constructed as a wrapper-based feature selection (FS) approach. We compare the resulting binary IHHO with other FS methods using well-known benchmark datasets provided by UCI. The experimental results reveal that the proposed IHHO has better accuracy rates over other compared wrapper FS methods. Overall research and analysis confirm the improvement in IHHO because of the suitable exploration capability of SSA.
AB - Feature selection is a required preprocess stage in most of the data mining tasks. This paper presents an improved Harris hawks optimization (HHO) to find high-quality solutions for global optimization and feature selection tasks. This method is an efficient optimizer inspired by the behaviors of Harris' hawks, which try to catch the rabbits. In some cases, the original version tends to stagnate to the local optimum solutions. Hence, a novel HHO called IHHO is proposed by embedding the salp swarm algorithm (SSA) into the original HHO to improve the search ability of the optimizer and expand the application fields. The update stage in the HHO optimizer, which is performed to update each hawk, is divided into three phases: adjusting population based on SSA to generate SSA-based population, generating hybrid individuals according to SSA-based individual and HHO-based individual, and updating search agent in the light of greedy selection and HHO’s mechanisms. A large group of experiments on many functions is carried out to investigate the efficacy of the proposed optimizer. Based on the overall results, the proposed IHHO can provide a faster convergence speed and maintain a better balance between exploration and exploitation. Moreover, according to the proposed continuous IHHO, a more stable binary IHHO is also constructed as a wrapper-based feature selection (FS) approach. We compare the resulting binary IHHO with other FS methods using well-known benchmark datasets provided by UCI. The experimental results reveal that the proposed IHHO has better accuracy rates over other compared wrapper FS methods. Overall research and analysis confirm the improvement in IHHO because of the suitable exploration capability of SSA.
KW - Feature selection
KW - Global optimization
KW - Harris hawks optimization
KW - Salp swarm algorithm
UR - https://www.scopus.com/pages/publications/85084614250
U2 - 10.1007/s00366-020-01028-5
DO - 10.1007/s00366-020-01028-5
M3 - 文章
AN - SCOPUS:85084614250
SN - 0177-0667
VL - 37
SP - 3741
EP - 3770
JO - Engineering with Computers
JF - Engineering with Computers
IS - 4
ER -