Dragonfly algorithm: Theory, literature review, and application in feature selection

Majdi Mafarja, Ali Asghar Heidari, Hossam Faris, Seyedali Mirjalili, Ibrahim Aljarah

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)

Abstract

In this chapter, a wrapper-based feature selection algorithm is designed and substantiated based on the binary variant of Dragonfly Algorithm (BDA). DA is a successful, well-established metaheuristic that revealed superior efficacy in dealing with various optimization problems including feature selection. In this chapter we are going first present the inspirations and methamatical modeds of DA in details. Then, the performance of this algorithm is tested on a special type of datasets that contain a huge number of features with low number of samples. This type of datasets makes the optimization process harder, because of the large search space, and the lack of adequate samples to train the model. The experimental results showed the ability of DA to deal with this type of datasets better than other optimizers in the literature. Moreover, an extensive literature review for the DA is provided in this chapter.

Original languageEnglish
Title of host publicationStudies in Computational Intelligence
PublisherSpringer Verlag
Pages47-67
Number of pages21
DOIs
Publication statusPublished - 1 Jan 2020
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume811
ISSN (Print)1860-949X

    Fingerprint

Cite this

Mafarja, M., Heidari, A. A., Faris, H., Mirjalili, S., & Aljarah, I. (2020). Dragonfly algorithm: Theory, literature review, and application in feature selection. In Studies in Computational Intelligence (pp. 47-67). (Studies in Computational Intelligence; Vol. 811). Springer Verlag. https://doi.org/10.1007/978-3-030-12127-3_4