IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v14y2022i6p178-d834621.html
   My bibliography  Save this article

EBBA: An Enhanced Binary Bat Algorithm Integrated with Chaos Theory and Lévy Flight for Feature Selection

Author

Listed:
  • Jinghui Feng

    (Academy for Engineering & Technology, Fudan University, Shanghai 200433, China
    Academy for Electromechanical, Changchun Polytechnic, Changchun 130033, China)

  • Haopeng Kuang

    (Academy for Engineering & Technology, Fudan University, Shanghai 200433, China)

  • Lihua Zhang

    (Academy for Engineering & Technology, Fudan University, Shanghai 200433, China)

Abstract

Feature selection can efficiently improve classification accuracy and reduce the dimension of datasets. However, feature selection is a challenging and complex task that requires a high-performance optimization algorithm. In this paper, we propose an enhanced binary bat algorithm (EBBA) which is originated from the conventional binary bat algorithm (BBA) as the learning algorithm in a wrapper-based feature selection model. First, we model the feature selection problem and then transfer it as a fitness function. Then, we propose an EBBA for solving the feature selection problem. In EBBA, we introduce the Lévy flight-based global search method, population diversity boosting method and chaos-based loudness method to improve the BA and make it more applicable to feature selection problems. Finally, the simulations are conducted to evaluate the proposed EBBA and the simulation results demonstrate that the proposed EBBA outmatches other comparison benchmarks. Moreover, we also illustrate the effectiveness of the proposed improved factors by tests.

Suggested Citation

  • Jinghui Feng & Haopeng Kuang & Lihua Zhang, 2022. "EBBA: An Enhanced Binary Bat Algorithm Integrated with Chaos Theory and Lévy Flight for Feature Selection," Future Internet, MDPI, vol. 14(6), pages 1-16, June.
    • Handle: RePEc:gam:jftint:v:14:y:2022:i:6:p:178-:d:834621
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/14/6/178/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/14/6/178/
    Download Restriction: no
    ---><---

    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:gam:jftint:v:14:y:2022:i:6:p:178-:d:834621. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.