.png){kind=icon}
Return
Dispersed foraging slime mould algorithm: Continuous and binary variants for global optimization and wrapper-based feature selection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2021.107761.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The slime mould algorithm (SMA) is a logical swarm-based stochastic optimizer that is easy to understand and has a strong optimization capability. However, the SMA is not suitable for solving multimodal and hybrid functions. Therefore, in the present study, to enhance the SMA and maintain population diversity, a dispersed foraging SMA (DFSMA) with a dispersed foraging strategy is proposed. We conducted extensive experiments based on several functions in IEEE CEC2017. The DFSMA were compared with 11 other meta-heuristic algorithms (MAs), 10 advanced algorithms, and 3 recently proposed algorithms. Moreover, to conduct more systematic data analyses, the experimental results were further evaluated using the Wilcoxon signed-rank test. The DFSMA was shown to outperform other optimizers in terms of convergence speed and accuracy. In addition, the binary DFSMA (BDFSMA) was obtained using the transform function. The performance of the BDFSMA was evaluated on 12 datasets in the UCI repository. The experimental results reveal that the BDFSMA performs better than the original SMA, and that, compared with other optimization algorithms, it improves classification accuracy and reduces the number of selected features, demonstrating its practical engineering value in spatial search and feature selection. (c) 2021 Published by Elsevier B.V.
Keywords:
Slime mould algorithm
Swarm intelligence
Global optimization
Feature selection
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSave
ShareSave View more