A new binary particle swarm optimisation algorithm for feature selection

14Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Feature selection aims to select a small number of features from a large feature set to achieve similar or better classification performance than using all features. This paper develops a new binary particle swarm optimisation (PSO) algorithm (named PBPSO) based on which a new feature selection approach (PBPSOfs) is developed to reduce the number of features and increase the classification accuracy. The performance of PBPSOfs is compared with a standard binary PSO based feature selection algorithm (BPSOfs) and two traditional feature selection algorithms on 14 benchmark problems of varying difficulty. The results show that PBPSOfs can be successfully used for feature selection to select a small number of features and improve the classification performance over using all features. PBPSOfs further reduces the number of features selected by BPSOfs and simultaneously increases the classification accuracy, especially on datasets with a large number of features. Meanwhile, PBPSOfs achieves better performance than the two traditional feature selection algorithms. In addition, the results also show that PBPSO as a general binary optimisation technique can achieve better performance than standard binary PSO and uses less computational time.

Cite

CITATION STYLE

APA

Xue, B., Nguyen, S., & Zhang, M. (2014). A new binary particle swarm optimisation algorithm for feature selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8602, pp. 501–513). Springer Verlag. https://doi.org/10.1007/978-3-662-45523-4_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free