IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i4p554-d1337725.html
   My bibliography  Save this article

A Hybrid Initialization and Effective Reproduction-Based Evolutionary Algorithm for Tackling Bi-Objective Large-Scale Feature Selection in Classification

Author

Listed:
  • Hang Xu

    (School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China)

  • Chaohui Huang

    (School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China)

  • Hui Wen

    (New Engineering Industry College, Putian University, Putian 351100, China)

  • Tao Yan

    (School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China)

  • Yuanmo Lin

    (School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China)

  • Ying Xie

    (School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China)

Abstract

Evolutionary algorithms have been widely used for tackling multi-objective optimization problems, while feature selection in classification can also be seen as a discrete bi-objective optimization problem that pursues minimizing both the classification error and the number of selected features. However, traditional multi-objective evolutionary algorithms (MOEAs) can encounter setbacks when the dimensionality of features explodes to a large scale, i.e., the curse of dimensionality. Thus, in this paper, we focus on designing an adaptive MOEA framework for solving bi-objective feature selection, especially on large-scale datasets, by adopting hybrid initialization and effective reproduction (called HIER). The former attempts to improve the starting state of evolution by composing a hybrid initial population, while the latter tries to generate more effective offspring by modifying the whole reproduction process. Moreover, the statistical experiment results suggest that HIER generally performs the best on most of the 20 test datasets, compared with six state-of-the-art MOEAs, in terms of multiple metrics covering both optimization and classification performances. Then, the component contribution of HIER is also studied, suggesting that each of its essential components has a positive effect. Finally, the computational time complexity of HIER is also analyzed, suggesting that HIER is not time-consuming at all and shows promising computational efficiency.

Suggested Citation

  • Hang Xu & Chaohui Huang & Hui Wen & Tao Yan & Yuanmo Lin & Ying Xie, 2024. "A Hybrid Initialization and Effective Reproduction-Based Evolutionary Algorithm for Tackling Bi-Objective Large-Scale Feature Selection in Classification," Mathematics, MDPI, vol. 12(4), pages 1-24, February.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:4:p:554-:d:1337725
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/4/554/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/4/554/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nahar F. Alshammari & Mohamed Mahmoud Samy & Shimaa Barakat, 2023. "Comprehensive Analysis of Multi-Objective Optimization Algorithms for Sustainable Hybrid Electric Vehicle Charging Systems," Mathematics, MDPI, vol. 11(7), pages 1-31, April.
    2. Fan Cao & Zhili Tang & Caicheng Zhu & Xin Zhao, 2023. "An Efficient Hybrid Multi-Objective Optimization Method Coupling Global Evolutionary and Local Gradient Searches for Solving Aerodynamic Optimization Problems," Mathematics, MDPI, vol. 11(18), pages 1-31, September.
    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. Hang Xu, 2024. "A Dynamic Tasking-Based Evolutionary Algorithm for Bi-Objective Feature Selection," Mathematics, MDPI, vol. 12(10), pages 1-23, May.
    2. Judson Estes & Vijitashwa Pandey, 2023. "Investigating the Effect of Organization Structure and Cognitive Profiles on Engineering Team Performance Using Agent-Based Models and Graph Theory," Mathematics, MDPI, vol. 11(21), pages 1-13, November.
    3. Hang Xu, 2024. "An Interpolation-Based Evolutionary Algorithm for Bi-Objective Feature Selection in Classification," Mathematics, MDPI, vol. 12(16), pages 1-17, August.
    4. Hang Xu & Chaohui Huang & Jianbing Lin & Min Lin & Huahui Zhang & Rongbin Xu, 2024. "A Multi-Task Decomposition-Based Evolutionary Algorithm for Tackling High-Dimensional Bi-Objective Feature Selection," Mathematics, MDPI, vol. 12(8), pages 1-23, April.

    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:jmathe:v:12:y:2024:i:4:p:554-:d:1337725. 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: 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.