Binary Dragonfly Algorithm for Feature Selection
File version
Accepted Manuscript (AM)
Author(s)
Eleyan, Derar
Jaber, Iyad
Mirjalili, Seyedali
Hammouri, Abdelaziz
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Awajan, A
Shaout, A
Date
Size
File type(s)
Location
Amman, JORDAN
License
Abstract
Wrapper feature selection methods aim to reduce the number of features from the original feature set to and improve the classification accuracy simultaneously. In this paper, a wrapper-feature selection algorithm based on the binary dragonfly algorithm is proposed. Dragonfly algorithm is a recent swarm intelligence algorithm that mimics the behavior of the dragonflies. Eighteen UCI datasets are used to evaluate the performance of the proposed approach. The results of the proposed method are compared with those of Particle Swarm Optimization (PSO), Genetic Algorithms (GAs) in terms of classification accuracy and number of selected attributes. The results show the ability of Binary Dragonfly Algorithm (BDA) in searching the feature space and selecting the most informative features for classification tasks.
Journal Title
Conference Title
2017 INTERNATIONAL CONFERENCE ON NEW TRENDS IN COMPUTING SCIENCES (ICTCS)
Book Title
Edition
Volume
2018-January
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Item Access Status
Note
Access the data
Related item(s)
Subject
Evolutionary computation