Journal
ISCIENCE
Volume 26, Issue 5, Pages -Publisher
CELL PRESS
DOI: 10.1016/j.isci.2023.106679
Keywords
-
Categories
Ask authors/readers for more resources
This article presents a new wrapper gene selection algorithm called artificial bee bare-bone hunger games search (ABHGS), which combines hunger games search (HGS) with an artificial bee strategy and a Gaussian bare-bone structure to address the challenges of identifying representative genes and reducing data dimensionality.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available