An artificial bee bare-bone hunger games search for global optimization and high-dimensional feature selection

The domains of contemporary medicine and biology have generated substantial high-dimensional genetic data. Identifying representative genes and decreasing the dimensionality of the data can be challenging. The goal of gene selection is to minimize computing costs and enhance classification precision. Therefore, this article designs a new wrapper gene selection algorithm named artificial bee bare-bone hunger games search (ABHGS), which is the hunger games search (HGS) integrated with an artificial bee strategy and a Gaussian bare-bone structure to address this issue. To evaluate and validate the performance of our proposed method, ABHGS is compared to HGS and a single strategy embedded in HGS, six classic algorithms, and ten advanced algorithms on the CEC 2017 functions. The experimental results demonstrate that the bABHGS outperforms the original HGS. Compared to peers, it increases classification accuracy and decreases the number of selected features, indicating its actual engineering utility in spatial search and feature selection.

• Autores: Chen, Zhiqing; Xuan, Ping; Asghar Heidari, Ali; Liu, Lei; Wu, Chengwen; Chen, Huiling; Escorcia-Gutierrez, José; Mansour, Romany F.
• Tipo de recurso: Article of investigation
• Fecha de publicación: 2023
• Institución: Corporación Universidad de la Costa
• Repositorio: REDICUC - Repositorio CUC
• Idioma: eng
• OAI Identifier: oai:repositorio.cuc.edu.co:11323/10499
• Acceso en línea: https://hdl.handle.net/11323/10499; https://repositorio.cuc.edu.co/
• Palabra clave: Genetics; Computational bioinformatics; Algorithms
• Rights: openAccess
• License: Atribución 4.0 Internacional (CC BY 4.0)