Cargando…

Hybrid black widow optimization with iterated greedy algorithm for gene selection problems

Gene Selection (GS) is a strategy method targeted at reducing redundancy, limited expressiveness, and low informativeness in gene expression datasets obtained by DNA Microarray technology. These datasets contain a plethora of diverse and high-dimensional samples and genes, with a significant discrep...

Descripción completa

Detalles Bibliográficos
Autores principales: Alweshah, Mohammed, Aldabbas, Yasmeen, Abu-Salih, Bilal, Oqeil, Saleh, Hasan, Hazem S., Alkhalaileh, Saleh, Kassaymeh, Sofian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10559925/
https://www.ncbi.nlm.nih.gov/pubmed/37809602
http://dx.doi.org/10.1016/j.heliyon.2023.e20133
_version_ 1785117613708279808
author Alweshah, Mohammed
Aldabbas, Yasmeen
Abu-Salih, Bilal
Oqeil, Saleh
Hasan, Hazem S.
Alkhalaileh, Saleh
Kassaymeh, Sofian
author_facet Alweshah, Mohammed
Aldabbas, Yasmeen
Abu-Salih, Bilal
Oqeil, Saleh
Hasan, Hazem S.
Alkhalaileh, Saleh
Kassaymeh, Sofian
author_sort Alweshah, Mohammed
collection PubMed
description Gene Selection (GS) is a strategy method targeted at reducing redundancy, limited expressiveness, and low informativeness in gene expression datasets obtained by DNA Microarray technology. These datasets contain a plethora of diverse and high-dimensional samples and genes, with a significant discrepancy in the number of samples and genes present. The complexities of GS are especially noticeable in the context of microarray expression data analysis, owing to the inherent data imbalance. The main goal of this study is to offer a simplified and computationally effective approach to dealing with the conundrum of attribute selection in microarray gene expression data. We use the Black Widow Optimization algorithm (BWO) in the context of GS to achieve this, using two unique methodologies: the unaltered BWO variation and the hybridized BWO variant combined with the Iterated Greedy algorithm (BWO-IG). By improving the local search capabilities of BWO, this hybridization attempts to promote more efficient gene selection. A series of tests was carried out using nine benchmark datasets that were obtained from the gene expression data repository in the pursuit of empirical validation. The results of these tests conclusively show that the BWO-IG technique performs better than the traditional BWO algorithm. Notably, the hybridized BWO-IG technique excels in the efficiency of local searches, making it easier to identify relevant genes and producing findings with higher levels of reliability in terms of accuracy and the degree of gene pruning. Additionally, a comparison analysis is done against five modern wrapper Feature Selection (FS) methodologies, namely BIMFOHHO, BMFO, BHHO, BCS, and BBA, in order to put the suggested BWO-IG method's effectiveness into context. The comparison that follows highlights BWO-IG's obvious superiority in reducing the number of selected genes while also obtaining remarkably high classification accuracy. The key findings were an average classification accuracy of 94.426, average fitness values of 0.061, and an average number of selected genes of 2933.767.
format Online
Article
Text
id pubmed-10559925
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher Elsevier
record_format MEDLINE/PubMed
spelling pubmed-105599252023-10-08 Hybrid black widow optimization with iterated greedy algorithm for gene selection problems Alweshah, Mohammed Aldabbas, Yasmeen Abu-Salih, Bilal Oqeil, Saleh Hasan, Hazem S. Alkhalaileh, Saleh Kassaymeh, Sofian Heliyon Research Article Gene Selection (GS) is a strategy method targeted at reducing redundancy, limited expressiveness, and low informativeness in gene expression datasets obtained by DNA Microarray technology. These datasets contain a plethora of diverse and high-dimensional samples and genes, with a significant discrepancy in the number of samples and genes present. The complexities of GS are especially noticeable in the context of microarray expression data analysis, owing to the inherent data imbalance. The main goal of this study is to offer a simplified and computationally effective approach to dealing with the conundrum of attribute selection in microarray gene expression data. We use the Black Widow Optimization algorithm (BWO) in the context of GS to achieve this, using two unique methodologies: the unaltered BWO variation and the hybridized BWO variant combined with the Iterated Greedy algorithm (BWO-IG). By improving the local search capabilities of BWO, this hybridization attempts to promote more efficient gene selection. A series of tests was carried out using nine benchmark datasets that were obtained from the gene expression data repository in the pursuit of empirical validation. The results of these tests conclusively show that the BWO-IG technique performs better than the traditional BWO algorithm. Notably, the hybridized BWO-IG technique excels in the efficiency of local searches, making it easier to identify relevant genes and producing findings with higher levels of reliability in terms of accuracy and the degree of gene pruning. Additionally, a comparison analysis is done against five modern wrapper Feature Selection (FS) methodologies, namely BIMFOHHO, BMFO, BHHO, BCS, and BBA, in order to put the suggested BWO-IG method's effectiveness into context. The comparison that follows highlights BWO-IG's obvious superiority in reducing the number of selected genes while also obtaining remarkably high classification accuracy. The key findings were an average classification accuracy of 94.426, average fitness values of 0.061, and an average number of selected genes of 2933.767. Elsevier 2023-09-14 /pmc/articles/PMC10559925/ /pubmed/37809602 http://dx.doi.org/10.1016/j.heliyon.2023.e20133 Text en © 2023 The Authors https://creativecommons.org/licenses/by/4.0/This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Research Article
Alweshah, Mohammed
Aldabbas, Yasmeen
Abu-Salih, Bilal
Oqeil, Saleh
Hasan, Hazem S.
Alkhalaileh, Saleh
Kassaymeh, Sofian
Hybrid black widow optimization with iterated greedy algorithm for gene selection problems
title Hybrid black widow optimization with iterated greedy algorithm for gene selection problems
title_full Hybrid black widow optimization with iterated greedy algorithm for gene selection problems
title_fullStr Hybrid black widow optimization with iterated greedy algorithm for gene selection problems
title_full_unstemmed Hybrid black widow optimization with iterated greedy algorithm for gene selection problems
title_short Hybrid black widow optimization with iterated greedy algorithm for gene selection problems
title_sort hybrid black widow optimization with iterated greedy algorithm for gene selection problems
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10559925/
https://www.ncbi.nlm.nih.gov/pubmed/37809602
http://dx.doi.org/10.1016/j.heliyon.2023.e20133
work_keys_str_mv AT alweshahmohammed hybridblackwidowoptimizationwithiteratedgreedyalgorithmforgeneselectionproblems
AT aldabbasyasmeen hybridblackwidowoptimizationwithiteratedgreedyalgorithmforgeneselectionproblems
AT abusalihbilal hybridblackwidowoptimizationwithiteratedgreedyalgorithmforgeneselectionproblems
AT oqeilsaleh hybridblackwidowoptimizationwithiteratedgreedyalgorithmforgeneselectionproblems
AT hasanhazems hybridblackwidowoptimizationwithiteratedgreedyalgorithmforgeneselectionproblems
AT alkhalailehsaleh hybridblackwidowoptimizationwithiteratedgreedyalgorithmforgeneselectionproblems
AT kassaymehsofian hybridblackwidowoptimizationwithiteratedgreedyalgorithmforgeneselectionproblems