IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v16y2025i1p1-23.html

Metaheuristic Algorithms for Feature Selection (2014-2024)

Author

Listed:
  • Muhammad Faizan

    (Universiti Malaysia Pahang Al-Sultan Abdullah, Malaysia)

  • Muhammad Arif Mohammad

    (Universiti Malaysia Pahang Al-Sultan Abdullah, Malaysia)

Abstract

Feature selection is a process used during machine learning and data analysis, aimed at selecting the best features to increase model efficiency, decrease complexity, and increase readability. Metaheuristic algorithms are suited to provide solutions to feature selection problems because these problems are combinatorial and require an effective and efficient search through large solution spaces. Over the last decade (2014–2024), numerous approaches have been explored, each with its own optimization strengths and constraints. Swarm intelligence and evolutionary algorithms—including genetic algorithms, particle swarm optimization, and the zebra optimization algorithm—have operated effectively in this area. This study seeks to discuss the metaheuristic algorithms for feature selection and responds to questions in the process. In this study, a case study is provided using datasets from the University of California, Irvine repository, where various metaheuristic algorithms are applied to identify optimal feature subsets.

Suggested Citation

  • Muhammad Faizan & Muhammad Arif Mohammad, 2025. "Metaheuristic Algorithms for Feature Selection (2014-2024)," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global Scientific Publishing, vol. 16(1), pages 1-23, January.
  • Handle: RePEc:igg:jamc00:v:16:y:2025:i:1:p:1-23
    as

    Download full text from publisher

    File URL: https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.397402
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:16:y:2025:i:1:p:1-23. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.