Abstract
In machine learning and data mining, feature selection (FS) is one of the most important tasks required to select the most relevant instances from a dataset. In other words, FS is used to reduce the amount of information, creating a subset that represents the entire pool of data. The accuracy of the FS is reflected in a good classification of the information. This article presents an improved version of the social spider optimization (SSO) algorithm. The SSO tends to fail in local optima during the iterative process and is not possible to avoid this situation in the standard form. The proposed version avoids selecting the irrelevant features that demerit the performance of the FS. To achieve this goal, the opposition-based learning is used, in which there is a rule used to increase the exploration of the search space and the prominent zones in a determined neighborhood. The proposed algorithm is called opposition-based social spider optimization (OBSSO), and it has been tested over different mathematical problems. Moreover, the OBSSO, also, has been tested and compared with similar approaches using different datasets with specific information selected from UCI repository. The experimental results provide the evidence of the capabilities of the OBSSO for solving complex optimization problems.
Original language | English |
---|---|
Pages (from-to) | 13547-13567 |
Number of pages | 21 |
Journal | Soft Computing |
Volume | 23 |
Issue number | 24 |
DOIs | |
Publication status | Published - 1 Dec 2019 |
Externally published | Yes |
Keywords
- Feature selection (FS)
- Meta-heuristic (MH)
- Opposition-based learning (OBL)
- Social spider optimization (SSO)
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Geometry and Topology