IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0282812.html
   My bibliography  Save this article

Evolutionary binary feature selection using adaptive ebola optimization search algorithm for high-dimensional datasets

Author

Listed:
  • Olaide N Oyelade
  • Jeffrey O Agushaka
  • Absalom E Ezugwu

Abstract

Feature selection problem represents the field of study that requires approximate algorithms to identify discriminative and optimally combined features. The evaluation and suitability of these selected features are often analyzed using classifiers. These features are locked with data increasingly being generated from different sources such as social media, surveillance systems, network applications, and medical records. The high dimensionality of these datasets often impairs the quality of the optimal combination of these features selected. The use of the binary optimization method has been proposed in the literature to address this challenge. However, the underlying deficiency of the single binary optimizer is transferred to the quality of the features selected. Though hybrid methods have been proposed, most still suffer from the inherited design limitation of the single combined methods. To address this, we proposed a novel hybrid binary optimization capable of effectively selecting features from increasingly high-dimensional datasets. The approach used in this study designed a sub-population selective mechanism that dynamically assigns individuals to a 2-level optimization process. The level-1 method first mutates items in the population and then reassigns them to a level-2 optimizer. The selective mechanism determines what sub-population is assigned for the level-2 optimizer based on the exploration and exploitation phase of the level-1 optimizer. In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. The outcome of these are the HBEOSA-SA and HBEOSA-FFA, which are then investigated on the NT, and their corresponding variants HBEOSA-SA-NT and HBEOSA-FFA-NT with no NT applied. The hybrid methods were experimentally tested over high-dimensional datasets to address the challenge of feature selection. A comparative analysis was done on the methods to obtain performance variability with the low-dimensional datasets. Results obtained for classification accuracy for large, medium, and small-scale datasets are 0.995 using HBEOSA-FFA, 0.967 using HBEOSA-FFA-NT, and 0.953 using HBEOSA-FFA, respectively. Fitness and cost values relative to large, medium, and small-scale datasets are 0.066 and 0.934 using HBEOSA-FFA, 0.068 and 0.932 using HBEOSA-FFA, with 0.222 and 0.970 using HBEOSA-SA-NT, respectively. Findings from the study indicate that the HBEOSA-SA, HBEOSA-FFA, HBEOSA-SA-NT and HBEOSA-FFA-NT outperformed the BEOSA.

Suggested Citation

  • Olaide N Oyelade & Jeffrey O Agushaka & Absalom E Ezugwu, 2023. "Evolutionary binary feature selection using adaptive ebola optimization search algorithm for high-dimensional datasets," PLOS ONE, Public Library of Science, vol. 18(3), pages 1-36, March.
  • Handle: RePEc:plo:pone00:0282812
    DOI: 10.1371/journal.pone.0282812
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0282812
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0282812&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0282812?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Olatunji A Akinola & Jeffrey O Agushaka & Absalom E Ezugwu, 2022. "Binary dwarf mongoose optimizer for solving high-dimensional feature selection problems," PLOS ONE, Public Library of Science, vol. 17(10), pages 1-26, October.
    2. Jeffrey O Agushaka & Absalom E Ezugwu, 2021. "Advanced arithmetic optimization algorithm for solving mechanical engineering design problems," PLOS ONE, Public Library of Science, vol. 16(8), pages 1-29, August.
    3. J. Maruthupandi & K. Vimala Devi, 2017. "Multi-label text classification using optimised feature sets," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 9(3), pages 237-248.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Heping Fang & Xiaopeng Fu & Zhiyong Zeng & Kunhua Zhong & Shuguang Liu, 2022. "An Improved Arithmetic Optimization Algorithm and Its Application to Determine the Parameters of Support Vector Machine," Mathematics, MDPI, vol. 10(16), pages 1-20, August.
    2. Jaikumar Shanmuganathan & Aruldoss Albert Victoire & Gobu Balraj & Amalraj Victoire, 2022. "Deep Learning LSTM Recurrent Neural Network Model for Prediction of Electric Vehicle Charging Demand," Sustainability, MDPI, vol. 14(16), pages 1-28, August.
    3. Mahmoud Elsisi & Minh-Quang Tran & Hany M. Hasanien & Rania A. Turky & Fahad Albalawi & Sherif S. M. Ghoneim, 2021. "Robust Model Predictive Control Paradigm for Automatic Voltage Regulators against Uncertainty Based on Optimization Algorithms," Mathematics, MDPI, vol. 9(22), pages 1-19, November.
    4. Ahmed. H. A. Elkasem & Salah Kamel & Mohamed H. Hassan & Mohamed Khamies & Emad M. Ahmed, 2022. "An Eagle Strategy Arithmetic Optimization Algorithm for Frequency Stability Enhancement Considering High Renewable Power Penetration and Time-Varying Load," Mathematics, MDPI, vol. 10(6), pages 1-38, March.
    5. Qingxin Liu & Ni Li & Heming Jia & Qi Qi & Laith Abualigah & Yuxiang Liu, 2022. "A Hybrid Arithmetic Optimization and Golden Sine Algorithm for Solving Industrial Engineering Design Problems," Mathematics, MDPI, vol. 10(9), pages 1-30, May.
    6. Li, Yi-Xuan & Wang, Jie-Sheng & Guan, Xin-Yi & Wang, Xiao-Tian & Liu, Xun & Zhang, Song-Bo, 2025. "Arithmetic optimization algorithm with three-dimensional chaotic mapping in spherical coordinate system for combined economic emission dispatch problem," Applied Energy, Elsevier, vol. 380(C).
    7. Mengnan Chen & Yongquan Zhou & Qifang Luo, 2022. "An Improved Arithmetic Optimization Algorithm for Numerical Optimization Problems," Mathematics, MDPI, vol. 10(12), pages 1-27, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0282812. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.