Xue 2019 Self-adaptive particle swarm optimization for large-scale.pdf (2.52 MB)
Download file

Self-Adaptive particle swarm optimization for large-scale feature selection in classification

Download (2.52 MB)
journal contribution
posted on 24.03.2021, 01:47 by Y Xue, Bing XueBing Xue, M Zl
© 2019 Association for Computing Machinery. Many evolutionary computation (EC) methods have been used to solve feature selection problems and they perform well on most small-scale feature selection problems. However, as the dimensionality of feature selection problems increases, the solution space increases exponentially. Meanwhile, there are more irrelevant features than relevant features in datasets, which leads to many local optima in the huge solution space. Therefore, the existing EC methods still suffer from the problem of stagnation in local optima on large-scale feature selection problems. Furthermore, large-scale feature selection problems with different datasets may have different properties. Thus, it may be of low performance to solve different large-scale feature selection problems with an existing EC method that has only one candidate solution generation strategy (CSGS). In addition, it is time-consuming to fnd a suitable EC method and corresponding suitable parameter values for a given largescale feature selection problem if we want to solve it effectively and efciently. In this article, we propose a self-adaptive particle swarm optimization (SaPSO) algorithm for feature selection, particularly for largescale feature selection. First, an encoding scheme for the feature selection problem is employed in the SaPSO. Second, three important issues related to self-adaptive algorithms are investigated. After that, the SaPSO algorithm with a typical self-adaptive mechanism is proposed. The experimental results on 12 datasets show that the solution size obtained by the SaPSO algorithm is smaller than its EC counterparts on all datasets. The SaPSO algorithm performs better than its non-EC and EC counterparts in terms of classifcation accuracy not only on most training sets but also on most test sets. Furthermore, as the dimensionality of the feature selection problem increases, the advantages of SaPSO become more prominent. This highlights that the SaPSO algorithm is suitable for solving feature selection problems, particularly large-scale feature selection problems. © Xue 2019. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in 'ACM Transactions on Knowledge Discovery from Data', https://dx.doi.org/10.1145/3340848.

History

Preferred citation

Xue, Y., Xue, B. & Zl, M. (2019). Self-Adaptive particle swarm optimization for large-scale feature selection in classification. ACM Transactions on Knowledge Discovery from Data, 13(5), 1-27. https://doi.org/10.1145/3340848

Journal title

ACM Transactions on Knowledge Discovery from Data

Volume

13

Issue

5

Publication date

01/09/2019

Pagination

1-27

Publisher

Association for Computing Machinery (ACM)

Publication status

Published

Contribution type

Article

ISSN

1556-4681

eISSN

1556-472X

Language

en