Improved salp swarm algorithm based on Newton interpolation and cosine opposition-based learning for feature selection

被引:3
|
作者
Zhang, Hongbo [1 ,2 ]
Qin, Xiwen [1 ]
Gao, Xueliang [2 ]
Zhang, Siqi [1 ]
Tian, Yunsheng [2 ]
Zhang, Wei [2 ]
机构
[1] Changchun Univ Technol, Sch Math & Stat, Changchun 130012, Peoples R China
[2] Changchun Univ Technol, Sch Mechatron Engn, Changchun 130012, Peoples R China
关键词
Salp swarm algorithm; MRMR; ReliefF; Newton interpolation; Cosine opposition-based learning; OPTIMIZATION;
D O I
10.1016/j.matcom.2023.12.037
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Feature selection (FS) is one of the most critical tasks in data mining, which aims to reduce the dimensionality of the data and maximize classification accuracy. The FS problem can be treated as an NP-hard problem. Recently, various swarm intelligent (SI) algorithms have been employed to deal with the FS problem to solve the expensive computation of the exact method. However, the performance of the SI algorithms is limited because these algorithms do not comprehensively take the characteristics of the FS problem into consideration. Therefore, a promising salp swarm algorithm called NCSSA is presented to solve this problem. In NCSSA, multi-perspective initialization strategy, Newton interpolation inertia weight, improved followers' update model and cosine opposition-based learning (COBL) are proposed. In the majority of the SI algorithm-based FS method, the initial search agents are randomly generated or using a single filter method. However, a single filter method has different performance on various datasets. Therefore, a multi-perspective initialization strategy based on minimal redundancy maximal relevance (MRMR) and ReliefF is proposed, which can select the optimal subsets from different perspectives. Furthermore, Newton interpolation inertia weight is presented to balance the algorithm's exploration and exploitation. Compare with the existing inertia weights, the adjustment flexibility of the proposed inertia weight is enhanced. Additionally, the followers update their positions according to the values of ReliefF and MRMR, which can make full use of the relationship between data and labels. Finally, the COBL is introduced to accelerate the convergence rate and helps the algorithm jump out of the local best solutions. The COBL is better than opposition-based learning (OBL) in terms of randomness, and considers the characteristics of the FS problem. The proposed NCSSA is compared to a series of non-SI-based methods and SI-based methods employing the standard datasets from the UCI Machine Learning Repository. Experimental results show that the NCSSA is a promising algorithm for the FS problem. The contribution analysis of each strategy indicates that the COBL is the most effective strategy in improving the SSA.
引用
收藏
页码:544 / 558
页数:15
相关论文
共 50 条
  • [1] Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection
    Tubishat, Mohammad
    Idris, Norisma
    Shuib, Liyana
    Abushariah, Mohammad A. M.
    Mirjalili, Seyedali
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 145
  • [2] Salp swarm algorithm based on orthogonal refracted opposition-based learning
    Wang Z.
    Ding H.
    Wang J.
    Li B.
    Hou P.
    Yang Z.
    [J]. Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2022, 54 (11): : 122 - 136
  • [3] Boosting salp swarm algorithm by opposition-based learning concept and sine cosine algorithm for engineering design problems
    Chauhan, Sumika
    Vashishtha, Govind
    Abualigah, Laith
    Kumar, Anil
    [J]. SOFT COMPUTING, 2023, 27 (24) : 18775 - 18802
  • [4] Boosting salp swarm algorithm by opposition-based learning concept and sine cosine algorithm for engineering design problems
    Sumika Chauhan
    Govind Vashishtha
    Laith Abualigah
    Anil Kumar
    [J]. Soft Computing, 2023, 27 : 18775 - 18802
  • [5] An Opposition-Based Chaotic Salp Swarm Algorithm for Global Optimization
    Zhao, Xiaoqiang
    Yang, Fan
    Han, Yazhou
    Cui, Yanpeng
    [J]. IEEE ACCESS, 2020, 8 : 36485 - 36501
  • [6] Improved salp swarm algorithm based on particle swarm optimization for feature selection
    Ibrahim, Rehab Ali
    Ewees, Ahmed A.
    Oliva, Diego
    Abd Elaziz, Mohamed
    Lu, Songfeng
    [J]. JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2019, 10 (08) : 3155 - 3169
  • [7] Improved salp swarm algorithm based on particle swarm optimization for feature selection
    Rehab Ali Ibrahim
    Ahmed A. Ewees
    Diego Oliva
    Mohamed Abd Elaziz
    Songfeng Lu
    [J]. Journal of Ambient Intelligence and Humanized Computing, 2019, 10 : 3155 - 3169
  • [8] Coke price prediction approach based on dense GRU and opposition-based learning salp swarm algorithm
    Zhu, Xuhui
    Xia, Pingfan
    He, Qizhi
    Ni, Zhiwei
    Ni, Liping
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2023, 21 (02) : 106 - 121
  • [9] A modified salp swarm algorithm based on refracted opposition-based learning mechanism and adaptive control factor
    Fan Q.
    Chen Z.
    Xia Z.
    [J]. Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2020, 52 (10): : 183 - 191
  • [10] Improved salp swarm algorithm based on the levy flight for feature selection
    K. Balakrishnan
    R. Dhanalakshmi
    Utkarsh Mahadeo Khaire
    [J]. The Journal of Supercomputing, 2021, 77 : 12399 - 12419