Header menu link for other important links
The monarch butterfly optimization algorithm for solving feature selection problems
M. Alweshah, S.A. Khalaileh, B.B. Gupta, A. Almomani, A.I. Hammouri,
Published in Springer
Feature selection (FS) is considered to be a hard optimization problem in data mining and some artificial intelligence fields. It is a process where rather than studying all of the features of a whole dataset, some associated features of a problem are selected, the aim of which is to increase classification accuracy and reduce computational time. In this paper, a recent optimization algorithm, the monarch butterfly optimization (MBO) algorithm, is implemented with a wrapper FS method that uses the k-nearest neighbor (KNN) classifier. Experiments were implemented on 18 benchmark datasets. The results showed that, in comparison with four metaheuristic algorithms (WOASAT, ALO, GA and PSO), MBO was superior, giving a high rate of classification accuracy of, on average, 93% for all datasets as well as reducing the selection size significantly. Therefore, the use of the MBO to solve the FS problems has been proven through the results obtained to be effective and highly efficient in this field, and the results have also proven the strength of the balance between global and local search of MBO. © 2020, Springer-Verlag London Ltd., part of Springer Nature.
About the journal
JournalData powered by TypesetNeural Computing and Applications
PublisherData powered by TypesetSpringer