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 条
  • [21] Excogitating marine predators algorithm based on random opposition-based learning for feature selection
    Balakrishnan, Kulanthaivel
    Dhanalakshmi, Ramasamy
    Khaire, Utkarsh Mahadeo
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (04):
  • [22] Enhancing sine cosine algorithm based on social learning and elite opposition-based learning
    Lei Chen
    Linyun Ma
    Lvjie Li
    Computing, 2024, 106 : 1475 - 1517
  • [23] Opposition-based moth swarm algorithm
    Oliva, Diego
    Esquivel-Torres, Sara
    Hinojosa, Salvador
    Perez-Cisneros, Marco
    Osuna-Enciso, Valentin
    Ortega-Sanchez, Noe
    Dhiman, Gaurav
    Heidari, Ali Asghar
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 184
  • [24] Enhancing sine cosine algorithm based on social learning and elite opposition-based learning
    Chen, Lei
    Ma, Linyun
    Li, Lvjie
    COMPUTING, 2024, 106 (05) : 1475 - 1517
  • [25] Feature Selection Based on Improved Runner-Root Algorithm Using Chaotic Singer Map and Opposition-Based Learning
    Ibrahim, Rehab Ali
    Oliva, Diego
    Ewees, Ahmed A.
    Lu, Songfeng
    NEURAL INFORMATION PROCESSING, ICONIP 2017, PT V, 2017, 10638 : 156 - 166
  • [26] Improved Clustering Algorithm with Adaptive Opposition-based Learning
    Meng, Qianqian
    Zhou, Lijuan
    2017 IEEE 2ND INTERNATIONAL CONFERENCE ON BIG DATA ANALYSIS (ICBDA), 2017, : 296 - 300
  • [27] Crop Yield Estimation using Improved Salp Swarm Algorithm based Feature Selection
    Reddy, Jayanarayana
    Kumar, M. Rudra
    JOURNAL OF ELECTRICAL SYSTEMS, 2024, 20 (05) : 2808 - 2816
  • [28] Advanced orthogonal opposition-based learning-driven dynamic salp swarm algorithm: Framework and case studies
    Wang, Zongshan
    Ding, Hongwei
    Yang, Jingjing
    Wang, Jie
    Li, Bo
    Yang, Zhijun
    Hou, Peng
    IET CONTROL THEORY AND APPLICATIONS, 2022, 16 (10): : 945 - 971
  • [29] A Novel Feature Selection Method Based on Salp Swarm Algorithm
    Yan, Chaokun
    Suo, Zhihao
    Guan, Xinyu
    Luo, Huimin
    2021 IEEE INTERNATIONAL CONFERENCE ON INFORMATION COMMUNICATION AND SOFTWARE ENGINEERING (ICICSE 2021), 2021, : 126 - 130
  • [30] Opposition-based sine cosine optimizer utilizing refraction learning and variable neighborhood search for feature selection
    Bilal H. Abed-alguni
    Noor Aldeen Alawad
    Mohammed Azmi Al-Betar
    David Paul
    Applied Intelligence, 2023, 53 : 13224 - 13260