Feature Selection Approach based on Moth-Flame Optimization Algorithm

被引:0
|
作者
Zawbaa, Hossam M. [1 ,2 ]
Emary, E. [3 ,4 ]
Parv, B. [1 ]
Sharawi, Marwa [4 ]
机构
[1] Univ Babes Bolyai, Fac Math & Comp Sci, R-3400 Cluj Napoca, Romania
[2] Beni Suef Univ, Fac Comp & Informat, Bani Suwayf, Egypt
[3] Cairo Univ, Fac Comp & Informat, Cairo, Egypt
[4] Arab Open Univ, Fac Comp Studies, Cairo, Egypt
关键词
Bio-inspired Optimization; Moth-Flame Optimization; Feature Selection; Swarm Optimization; PARTICLE SWARM OPTIMIZATION; CLASSIFICATION; PSO;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this work, a feature selection algorithm based on moth-flame optimization (MFO) is proposed. Moth-flame optimization (MFO) is a recently proposed swarm intelligent optimization algorithm that mimics the motion of moths. The proposed algorithm is applied in the domain of machine learning for feature selection to find the optimal feature combination using wrapper-based feature selection mode. In wrapper-based feature selection, a machine learning technique is used in the evaluation step. Despite it is very costly in time, this technique proved to have a good performance in classification accuracy. MFO is exploited in this study as a searching method to find optimal feature set, maximizing classification performance. The proposed algorithm is compared against particle swarm optimization (PSO) and genetic algorithms (GA). A set of UCI data sets is used for comparison using different assessment indicators. Results prove the efficiency of the proposed algorithm in comparison to other algorithms.
引用
收藏
页码:4612 / 4617
页数:6
相关论文
共 50 条
  • [1] Feature Selection of Parallel Binary Moth-flame Optimization Algorithm Based on Spark
    Chen, Hongwei
    Fu, Heng
    Cao, Qianqian
    Han, Lin
    Yan, Lingyu
    [J]. PROCEEDINGS OF 2019 IEEE 3RD INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC 2019), 2019, : 408 - 412
  • [2] Improved Moth-Flame Optimization Based on Opposition-Based Learning for Feature Selection
    Abd Elazig, Mohamed
    Lu, Songfeng
    Oliva, Diego
    El-Abd, Mohammed
    [J]. 2019 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2019), 2019, : 3017 - 3024
  • [3] An Ameliorated Moth-flame Optimization Algorithm
    Zhao, Xiao-dong
    Fang, Yi-ming
    Ma, Zhuang
    Xu, Miao
    [J]. 2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 2372 - 2377
  • [4] Migration-Based Moth-Flame Optimization Algorithm
    Nadimi-Shahraki, Mohammad H.
    Fatahi, Ali
    Zamani, Hoda
    Mirjalili, Seyedali
    Abualigah, Laith
    Abd Elaziz, Mohamed
    [J]. PROCESSES, 2021, 9 (12)
  • [5] Opposition-based moth-flame optimization improved by differential evolution for feature selection
    Abd Elaziz, Mohamed
    Ewees, Ahmed A.
    Ibrahim, Rehab Ali
    Lu, Songfeng
    [J]. MATHEMATICS AND COMPUTERS IN SIMULATION, 2020, 168 (168) : 48 - 75
  • [6] Optimization Improvement and Clustering Application Based on Moth-Flame Algorithm
    Ye, Lvyang
    Huang, Huajuan
    Wei, Xiuxi
    [J]. INTELLIGENT COMPUTING METHODOLOGIES, PT III, 2022, 13395 : 769 - 784
  • [7] Moth-flame optimization algorithm based on diversity and mutation strategy
    Lei Ma
    Chao Wang
    Neng-gang Xie
    Miao Shi
    Ye Ye
    Lu Wang
    [J]. Applied Intelligence, 2021, 51 : 5836 - 5872
  • [8] Moth-flame optimization algorithm based on diversity and mutation strategy
    Ma, Lei
    Wang, Chao
    Xie, Neng-gang
    Shi, Miao
    Ye, Ye
    Wang, Lu
    [J]. APPLIED INTELLIGENCE, 2021, 51 (08) : 5836 - 5872
  • [9] An improved moth-flame optimization algorithm based on fusion mechanism
    Jiang, Luchao
    Hao, Kuangrong
    Tang, Xue-song
    Wang, Tong
    Liu, Xiaoyan
    [J]. IECON 2021 - 47TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, 2021,
  • [10] Moth-flame optimization algorithm: variants and applications
    Shehab, Mohammad
    Abualigah, Laith
    Al Hamad, Husam
    Alabool, Hamzeh
    Alshinwan, Mohammad
    Khasawneh, Ahmad M.
    [J]. NEURAL COMPUTING & APPLICATIONS, 2020, 32 (14): : 9859 - 9884