A conditional opposition-based particle swarm optimization for feature selection
Abstract
Because of the existence of irrelevant, redundant, and noisy attributes in large datasets, the accuracy of a classification model has degraded. Hence, feature selection is a necessary pre-processing stage to select the important features that may considerably increase the efficiency of underlying classification algorithms. As a popular metaheuristic algorithm, particle swarm optimization has successfully applied to various feature selection approaches. Nevertheless, particle swarm optimization tends to suffer from immature convergence and low convergence rate. Besides, the imbalance between exploration and exploitation is another key issue that can significantly affect the performance of particle swarm optimization. In this paper, a conditional opposition-based particle swarm optimization is proposed and used to develop a wrapper feature selection. Two schemes, namely opposition-based learning and conditional strategy are introduced to enhance the performance of the particle swarm optimization. Twenty-four benchmark datasets are used to validate the performance of the proposed approach. Furthermore, nine metaheuristics are chosen for performance verification. The findings show the supremacy of the proposed approach not only in obtaining high prediction accuracy but also in small feature sizes.Citation
Too, J., Sadiq, A. S. & Mirjalili, S. M. (2021) A conditional opposition-based particle swarm optimisation for feature selection, Connection Science, 34(1), pp. 339-361. DOI: 10.1080/09540091.2021.2002266Publisher
Taylor & FrancisJournal
Connection ScienceAdditional Links
https://www.tandfonline.com/doi/full/10.1080/09540091.2021.2002266Type
Journal articleLanguage
enDescription
© 2021 The Authors. Published by Taylor & Francis. This is an open access article available under a Creative Commons licence. The published version can be accessed at the following link on the publisher’s website: https://doi.org/10.1080/09540091.2021.2002266ISSN
0954-0091EISSN
1360-0494ae974a485f413a2113503eed53cd6c53
10.1080/09540091.2021.2002266
Scopus Count
Collections
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by/4.0/