Improved salp swarm algorithm based on particle swarm optimization for feature selection

Feature selection (FS) is a machine learning process commonly used to reduce the high dimensionality problems of datasets. This task permits to extract the most representative information of high sized pools of data, reducing the computational effort in other tasks as classification. This article pr...

Full description

Saved in:
Bibliographic Details
Published inJournal of ambient intelligence and humanized computing Vol. 10; no. 8; pp. 3155 - 3169
Main Authors Ibrahim, Rehab Ali, Ewees, Ahmed A., Oliva, Diego, Abd Elaziz, Mohamed, Lu, Songfeng
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2019
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1868-5137
1868-5145
DOI10.1007/s12652-018-1031-9

Cover

More Information
Summary:Feature selection (FS) is a machine learning process commonly used to reduce the high dimensionality problems of datasets. This task permits to extract the most representative information of high sized pools of data, reducing the computational effort in other tasks as classification. This article presents a hybrid optimization method for the FS problem; it combines the slap swarm algorithm (SSA) with the particle swarm optimization. The hybridization between both approaches creates an algorithm called SSAPSO, in which the efficacy of the exploration and the exploitation steps is improved. To verify the performance of the proposed algorithm, it is tested over two experimental series, in the first one, it is compared with other similar approaches using benchmark functions. Meanwhile, in the second set of experiments, the SSAPSO is used to determine the best set of features using different UCI datasets. Where the redundant or the confusing features are removed from the original dataset while keeping or yielding a better accuracy. The experimental results provide the evidence of the enhancement in the SSAPSO regarding the performance and the accuracy without affecting the computational effort.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1868-5137
1868-5145
DOI:10.1007/s12652-018-1031-9