Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Binary Puma Optimizer: A Metaheuristic Approach for Gene Selection in Bioinformatics with Machine Learning Classification

View through CrossRef
Abstract Gene expression data is a matrix derived from DNA microarray analysis; a single chip can contain a thousand genetic instructions via DNA microarray technology. Each microarray experiment can simultaneously evaluate thousands of genes. Algorithms for pattern recognition are commonly employed to differentiate between samples of healthy and malignant patients using gene expression data. Gene expression data is categorized as high-dimensional data and typically includes irrelevant, noisy, and redundant genes. Such datasets confront the challenge of the application of machine learning algorithms. This is due to their requirement for extensive computational resources, which negatively impacts classification performance and obstructs the training and testing processes. Gene selection is necessary to avoid these risks. This work proposes a unique binary puma optimizer (BPo) to choose the top-ranked genes. The modified Bpo uses a U-shaped transfer function to transform the algorithm from continuous to discrete. Nine widely utilized microarray datasets are employed to evaluate the performance of the proposed technique. The Support Vector Machine (SVM) is employed to evaluate the efficacy of the selected gene subset for the classification task and as a fitness function. The effectiveness of BPo is evaluated by achieving the least number of genes and the least time. Furthermore, utilizing the identical datasets, the results of BPo are compared with ten state-of-the-art gene selection methods based on classification accuracy and the number of genes selected. The results indicate that the proposed method provides the optimal results for the nine datasets. The experiment's results demonstrated the efficacy of the proposed method in exploring the gene search space while determining the optimal gene pairs. To statistically support the data, we performed a statistical analysis employing the Friedman and Wilcoxon tests, highlighting the significance of the proposed technique in comparison to existing algorithms based on accuracy. This analysis indicates that the proposed BPo substantially improves gene selection performance.
Title: Binary Puma Optimizer: A Metaheuristic Approach for Gene Selection in Bioinformatics with Machine Learning Classification
Description:
Abstract Gene expression data is a matrix derived from DNA microarray analysis; a single chip can contain a thousand genetic instructions via DNA microarray technology.
Each microarray experiment can simultaneously evaluate thousands of genes.
Algorithms for pattern recognition are commonly employed to differentiate between samples of healthy and malignant patients using gene expression data.
Gene expression data is categorized as high-dimensional data and typically includes irrelevant, noisy, and redundant genes.
Such datasets confront the challenge of the application of machine learning algorithms.
This is due to their requirement for extensive computational resources, which negatively impacts classification performance and obstructs the training and testing processes.
Gene selection is necessary to avoid these risks.
This work proposes a unique binary puma optimizer (BPo) to choose the top-ranked genes.
The modified Bpo uses a U-shaped transfer function to transform the algorithm from continuous to discrete.
Nine widely utilized microarray datasets are employed to evaluate the performance of the proposed technique.
The Support Vector Machine (SVM) is employed to evaluate the efficacy of the selected gene subset for the classification task and as a fitness function.
The effectiveness of BPo is evaluated by achieving the least number of genes and the least time.
Furthermore, utilizing the identical datasets, the results of BPo are compared with ten state-of-the-art gene selection methods based on classification accuracy and the number of genes selected.
The results indicate that the proposed method provides the optimal results for the nine datasets.
The experiment's results demonstrated the efficacy of the proposed method in exploring the gene search space while determining the optimal gene pairs.
To statistically support the data, we performed a statistical analysis employing the Friedman and Wilcoxon tests, highlighting the significance of the proposed technique in comparison to existing algorithms based on accuracy.
This analysis indicates that the proposed BPo substantially improves gene selection performance.

Related Results

Postmodern Puma
Postmodern Puma
Postmodernism is supposed to identify the conditions of contemporary cultural production when human affairs in general, and the dissemination of prevailing ideas in particular, hav...
Deciphering the toxicity and secretion mechanisms of the TIR domaincontaining effector PumA from Pseudomonas aeruginosa
Deciphering the toxicity and secretion mechanisms of the TIR domaincontaining effector PumA from Pseudomonas aeruginosa
Décoder les mécanismes de toxicité et de sécrétion de la protéine TIR PumA de Pseudomonas aeruginosa Introduction et objectifs : Le domaine TIR (Toll/interleukin-1 ...
Energy-Efficient Wireless Sensor Networks Through PUMA-Based Clustering and Grid Routing
Energy-Efficient Wireless Sensor Networks Through PUMA-Based Clustering and Grid Routing
Energy efficiency and prolonged network lifetime remain central challenges in wireless sensor networks (WSNs). Clustering, cluster-head (CH) selection, and routing are key to addre...
VARIABLES QUE AFECTAN A LOS CONFLICTOS ENTRE GANADEROS, JAGUAR (PANTHERA ONCA) Y PUMA (PUMA CONCOLOR) EN CUATRO TCO´S DEL BENI
VARIABLES QUE AFECTAN A LOS CONFLICTOS ENTRE GANADEROS, JAGUAR (PANTHERA ONCA) Y PUMA (PUMA CONCOLOR) EN CUATRO TCO´S DEL BENI
RESUMENEl jaguar (Panthera onca) y el puma (Puma concolor), son considerados un serio problema como depredadores de ganado a lo largo de su distribución. El objetivo de este traba...
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
BACKGROUND As of July 2020, a Web of Science search of “machine learning (ML)” nested within the search of “pharmacokinetics or pharmacodynamics” yielded over 100...
Hybrid Gradient Descent Grey Wolf Optimizer for Optimal Feature Selection
Hybrid Gradient Descent Grey Wolf Optimizer for Optimal Feature Selection
Feature selection is the process of decreasing the number of features in a dataset by removing redundant, irrelevant, and randomly class‐corrected data features. By applying featur...
Data from PUMA Suppresses Intestinal Tumorigenesis in Mice
Data from PUMA Suppresses Intestinal Tumorigenesis in Mice
<div>Abstract<p>Defective apoptosis contributes to tumorigenesis, although the critical molecular targets remain to be fully characterized. PUMA, a BH3-only protein ess...
Data from PUMA Suppresses Intestinal Tumorigenesis in Mice
Data from PUMA Suppresses Intestinal Tumorigenesis in Mice
<div>Abstract<p>Defective apoptosis contributes to tumorigenesis, although the critical molecular targets remain to be fully characterized. PUMA, a BH3-only protein ess...

Back to Top