Chaotic dragonfly algorithm: an improved metaheuristic algorithm for feature selection

被引:199
作者
Sayed, Gehad Ismail [1 ]
Tharwat, Alaa [2 ,3 ]
Hassanien, Aboul Ella [1 ,4 ]
机构
[1] Cairo Univ, Fac Comp & Informat, Giza, Egypt
[2] Frankfurt Univ Appl Sci, Fac Comp Sci & Engn, Frankfurt, Germany
[3] Suez Canal Univ, Fac Engn, Ismailia, Egypt
[4] SRGE, Cairo, Egypt
关键词
Toxic effects; Dragonfly algorithm; Feature selection; Optimization algorithm; Chaos theory; PARTICLE SWARM OPTIMIZATION; ARTIFICIAL BEE COLONY; PARAMETER OPTIMIZATION; DISCRIMINANT-ANALYSIS; CLASSIFICATION; SYSTEM; MODEL;
D O I
10.1007/s10489-018-1261-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Selecting the most discriminative features is a challenging problem in many applications. Bio-inspired optimization algorithms have been widely applied to solve many optimization problems including the feature selection problem. In this paper, the most discriminating features were selected by a new Chaotic Dragonfly Algorithm (CDA) where chaotic maps embedded with searching iterations of the Dragonfly Algorithm (DA). Ten chaotic maps were employed to adjust the main parameters of dragonflies' movements through the optimization process to accelerate the convergence rate and improve the efficiency of DA. The proposed algorithm is employed for selecting features from the dataset that were extracted from the Drug bank database, which contained 6712 drugs. In this paper, 553 drugs that were bio-transformed into liver are used. This data have four toxic effects, namely, irritant, mutagenic, reproductive, and tumorigenic effect, where each drug is represented by 31 chemical descriptors. The proposed model is mainly comprised of three phases; data pre-processing, features selection, and the classification phase. In the data pre-processing phase, Synthetic Minority Over-sampling Technique (SMOTE) was used to solve the problem of the imbalanced dataset. At the features selection phase, the most discriminating features were selected using CDA. Finally, the selected features from CDA were used to feed Support Vector Machine (SVM) classifier at the classification phase. Experimental results proved the capability of CDA to find the optimal feature subset, which maximizing the classification performance and minimizing the number of selected features compared with DA and the other meta-heuristic optimization algorithms. Moreover, the experiments showed that Gauss chaotic map was the appropriate map to significantly boost the performance of DA. Additionally, the high obtained value of accuracy (81.82-96.08%), recall (80.84-96.11%), precision (81.45-96.08%) and F-Score (81.14-96.1%) for all toxic effects proved the robustness of the proposed model.
引用
收藏
页码:188 / 205
页数:18
相关论文
共 57 条
[1]  
[Anonymous], 2018, KNOWLEDGE BASED SYST
[2]  
[Anonymous], 2012, FEATURE SELECTION KN
[3]  
[Anonymous], 1995, 1995 IEEE INT C
[4]   A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm [J].
Askarzadeh, Alireza .
COMPUTERS & STRUCTURES, 2016, 169 :1-12
[5]   SMOTE: Synthetic minority over-sampling technique [J].
Chawla, Nitesh V. ;
Bowyer, Kevin W. ;
Hall, Lawrence O. ;
Kegelmeyer, W. Philip .
2002, American Association for Artificial Intelligence (16)
[6]   A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms [J].
Derrac, Joaquin ;
Garcia, Salvador ;
Molina, Daniel ;
Herrera, Francisco .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :3-18
[7]  
Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
[8]   Research on collaborative negotiation for e-commerce. [J].
Feng, YQ ;
Lei, Y ;
Li, Y ;
Cao, RZ .
2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, :2085-2088
[9]   Chaotic bat algorithm [J].
Gandomi, Amir H. ;
Yang, Xin-She .
JOURNAL OF COMPUTATIONAL SCIENCE, 2014, 5 (02) :224-232
[10]  
Hafez AI, 2016, PROCEEDINGS OF THE 2016 INTERNATIONAL SYMPOSIUM ON INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (INISTA)