Improved Slime Mould Algorithm based on Firefly Algorithm for feature selection: A case study on QSAR model

被引:0
|
作者
Ahmed A. Ewees
Laith Abualigah
Dalia Yousri
Zakariya Yahya Algamal
Mohammed A. A. Al-qaness
Rehab Ali Ibrahim
Mohamed Abd Elaziz
机构
[1] Damietta University,Department of Computer
[2] Amman Arab University,Faculty of Computer Sciences and Informatics
[3] Fayoum University,Department of Electrical Engineering, Faculty of Engineering
[4] University of Mosul,Department of Statistics and Informatics
[5] Wuhan University,State Key Laboratory for Information Engineering in Surveying, Mapping and Remote Sensing
[6] Zagazig University,Department of Mathematics, Faculty of Science
[7] Nahda University,Faculty of Computer Science
[8] Academy of Scientific Research and Technology (ASRT),undefined
来源
Engineering with Computers | 2022年 / 38卷
关键词
Feature selection; Slime mould algorithm; Firefly algorithm; QSAR;
D O I
暂无
中图分类号
学科分类号
摘要
Feature selection (FS) methods are necessary to develop intelligent analysis tools that require data preprocessing and enhancing the performance of the machine learning algorithms. FS aims to maximize the classification accuracy by minimizing the number of selected features. This paper presents a new FS method using a modified Slime mould algorithm (SMA) based on the firefly algorithm (FA). In the developed SMAFA, FA is adopted to improve the exploration of SMA, since it has high ability to discover the feasible regions which have optima solution. This will lead to enhance the convergence by increasing the quality of the final output. SMAFA is evaluated using twenty UCI datasets and also with comprehensive comparisons to a number of the existing MH algorithms. To further assess the applicability of SMAFA, two high-dimensional datasets related to the QSAR modeling are used. Experimental results verified the promising performance of SMAFA using different performance measures.
引用
收藏
页码:2407 / 2421
页数:14
相关论文
共 50 条
  • [21] An efficient binary slime mould algorithm integrated with a novel attacking-feeding strategy for feature selection
    Abdel-Basset, Mohamed
    Mohamed, Reda
    Chakrabortty, Ripon K.
    Ryan, Michael J.
    Mirjalili, Seyedali
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 153 (153)
  • [22] Improving firefly algorithm-based logistic regression for feature selection
    Kahya, Mohammed Abdulrazaq
    Altamir, Suhaib Abduljabbar
    Algamal, Zakariya Yahya
    JOURNAL OF INTERDISCIPLINARY MATHEMATICS, 2019, 22 (08) : 1577 - 1581
  • [23] A return-cost-based binary firefly algorithm for feature selection
    Zhang, Yong
    Song, Xian-fang
    Gong, Dun-wei
    INFORMATION SCIENCES, 2017, 418 : 561 - 574
  • [24] A novel improved slime mould algorithm for engineering design
    Jingsen Liu
    Yiwen Fu
    Yu Li
    Huan Zhou
    Soft Computing, 2023, 27 : 12181 - 12210
  • [25] A novel improved slime mould algorithm for engineering design
    Liu, Jingsen
    Fu, Yiwen
    Li, Yu
    Zhou, Huan
    SOFT COMPUTING, 2023, 27 (17) : 12181 - 12210
  • [26] Firefly Algorithm based Feature Selection for Arabic Text Classification
    Marie-Sainte, Souad Larabi
    Alalyani, Nada
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2020, 32 (03) : 320 - 328
  • [27] Path Planning of Autonomous Mobile Robots Based on an Improved Slime Mould Algorithm
    Zheng, Ling
    Tian, Yan
    Wang, Hu
    Hong, Chengzhi
    Li, Bijun
    DRONES, 2023, 7 (04)
  • [28] Firefly Algorithm Based Feature Selection for EEG Signal Classification
    Ergun, Ebru
    Aydemir, Onder
    2020 MEDICAL TECHNOLOGIES CONGRESS (TIPTEKNO), 2020,
  • [29] A Novel firefly algorithm of solving feature selection of infrared spectrum
    Xi, Zhonghong
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING FOR MECHANICS AND MATERIALS, 2016, 97 : 643 - 648
  • [30] Feature subset selection in structural health monitoring data using an advanced binary slime mould algorithm
    Ghiasi, Ramin
    Malekjafarian, Abdollah
    JOURNAL OF STRUCTURAL INTEGRITY AND MAINTENANCE, 2023, 8 (04) : 209 - 225