Author
Listed:
- Zhang, Hongbo
- Qin, Xiwen
- Gao, Xueliang
- Zhang, Siqi
- Tian, Yunsheng
- Zhang, Wei
Abstract
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.
Suggested Citation
Zhang, Hongbo & Qin, Xiwen & Gao, Xueliang & Zhang, Siqi & Tian, Yunsheng & Zhang, Wei, 2024.
"Improved salp swarm algorithm based on Newton interpolation and cosine opposition-based learning for feature selection,"
Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 219(C), pages 544-558.
Handle:
RePEc:eee:matcom:v:219:y:2024:i:c:p:544-558
DOI: 10.1016/j.matcom.2023.12.037
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:219:y:2024:i:c:p:544-558. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.