Optimized feature selection method using particle swarm intelligence with ensemble learning for cancer classification based on microarray datasets

Enhanced ovarian cancer survival prediction using temporal analysis and graph neural networks

Ovarian cancer is a formidable health challenge that demands accurate and timely survival predictions to guide clinical interventions. Existing methods, while commendable, suffer from limitations in harnessing the temporal evolution of patient data and capturing intricate interdependencies among different data elements. In this paper, we present a novel methodology which combines Temporal Analysis and Graph Neural Networks (GNNs) to significantly enhance ovarian cancer survival rate predictions. The shortcomings of current processes originate from their disability to correctly seize the complex interactions amongst diverse scientific information units in addition to the dynamic modifications that arise in a affected person`s nation over time. By combining temporal information evaluation and GNNs, our cautioned approach overcomes those drawbacks and, whilst as compared to preceding methods, yields a noteworthy 8.3% benefit in precision, 4.9% more accuracy, 5.5% more advantageous recall, and a considerable 2.9% reduction in prediction latency. Our method's Temporal Analysis factor uses longitudinal affected person information to perceive good-sized styles and tendencies that offer precious insights into the direction of ovarian cancer. Through the combination of GNNs, we offer a robust framework able to shoot complicated interactions among exclusive capabilities of scientific data, permitting the version to realize diffused dependencies that would affect survival results. Our paintings have tremendous implications for scientific practice. Prompt and correct estimation of the survival price of ovarian most cancers allows scientific experts to customize remedy regimens, manipulate assets efficiently, and provide individualized care to patients. Additionally, the interpretability of our version`s predictions promotes a collaborative method for affected person care via way of means of strengthening agreement among scientific employees and the AI-driven selection help system. The proposed approach not only outperforms existing methods but also has the possible to develop ovarian cancer treatment by providing clinicians through a reliable tool for informed decision-making. Through a fusion of Temporal Analysis and Graph Neural Networks, we conduit the gap among data-driven insights and clinical practice, proposing a capable opportunity for refining patient outcomes in ovarian cancer management operations.

A novel parallel feature rank aggregation algorithm for gene selection applied to microarray data classification

Microarray data often comprises numerous genes, yet not all genes are relevant for predicting cancer. Feature selection becomes a crucial step to reduce the high dimensionality in these kinds of data. While no single feature selection method consistently outperforms others across diverse domains, the combination of multiple feature selectors or rankers tends to produce more effective results compared to relying on a single ranker alone. However, this approach can be computationally expensive, particularly when handling a large quantity of features. Hence, this paper presents a parallel feature rank aggregation that utilizes borda count as the rank aggregator. The concept of vertically partitioning the data along feature space was adapted to ease the parallel execution of the aggregation task. Features were selected based on the final aggregated rank list, and their classification performances were evaluated. The model's execution time was also observed across multiple worker nodes of the cluster. The experiment was conducted on six benchmark microarray datasets. The results show the capability of the proposed distributed framework compared to the sequential version in all the cases. It also illustrated the improved accuracy performance of the proposed method and its ability to select a minimal number of genes.

Augmented histopathology: Enhancing colon cancer detection through deep learning and ensemble techniques

Colon cancer poses a significant threat to human life with a high global mortality rate. Early and accurate detection is crucial for improving treatment quality and the survival rate. This paper presents a comprehensive approach to enhance colon cancer detection and classification. The histopathological images are gathered from the CRC-VAL-HE-7K dataset. The images undergo preprocessing to improve quality, followed by augmentation to increase dataset size and enhance model generalization. A deep learning based transformer model is designed for efficient feature extraction and enhancing classification by incorporating a convolutional neural network (CNN). A cross-transformation model captures long-range dependencies between regions, and an attention mechanism assigns weights to highlight crucial features. To boost classification accuracy, a Siamese network distinguishes colon cancer tissue classes based on probabilities. Optimization algorithms fine-tune model parameters, categorizing colon cancer tissues into different classes. The multi-class classification performance is evaluated in the experimental evaluation, which demonstrates that the proposed model provided highest accuracy rate of 98.84%. In this research article, the proposed method achieved better performance in all analyses by comparing with other existing methods. RESEARCH HIGHLIGHTS: Deep learning-based techniques are proposed. DL methods are used to enhance colon cancer detection and classification. CRC-VAL-HE-7K dataset is utilized to enhance image quality. Hybrid particle swarm optimization (PSO) and dwarf mongoose optimization (DMO) are used. The deep learning models are tuned by implementing the PSO-DMO algorithm.

An improved Differential evolution with Sailfish optimizer (DESFO) for handling feature selection problem

As a preprocessing for machine learning and data mining, Feature Selection plays an important role. Feature selection aims to streamline high-dimensional data by eliminating irrelevant and redundant features, which reduces the potential curse of dimensionality of a given large dataset. When working with datasets containing many features, algorithms that aim to identify the most valuable features to improve dataset accuracy may encounter difficulties because of local optima. Many studies have been conducted to solve this problem. One of the solutions is to use meta-heuristic techniques. This paper presents a combination of the Differential evolution and the sailfish optimizer algorithms (DESFO) to tackle the feature selection problem. To assess the effectiveness of the proposed algorithm, a comparison between Differential Evolution, sailfish optimizer, and nine other modern algorithms, including different optimization algorithms, is presented. The evaluation used Random forest and key nearest neighbors as quality measures. The experimental results show that the proposed algorithm is a superior algorithm compared to others. It significantly impacts high classification accuracy, achieving 85.7% with the Random Forest classifier and 100% with the Key Nearest Neighbors classifier across 14 multi-scale benchmarks. According to fitness values, it gained 71% with the Random forest and 85.7% with the Key Nearest Neighbors classifiers.

Enhancement of Classifier Performance with Adam and RanAdam Hyper-Parameter Tuning for Lung Cancer Detection from Microarray Data-In Pursuit of Precision

Microarray gene expression analysis is a powerful technique used in cancer classification and research to identify and understand gene expression patterns that can differentiate between different cancer types, subtypes, and stages. However, microarray databases are highly redundant, inherently nonlinear, and noisy. Therefore, extracting meaningful information from such a huge database is a challenging one. The paper adopts the Fast Fourier Transform (FFT) and Mixture Model (MM) for dimensionality reduction and utilises the Dragonfly optimisation algorithm as the feature selection technique. The classifiers employed in this research are Nonlinear Regression, Naïve Bayes, Decision Tree, Random Forest and SVM (RBF). The classifiers' performances are analysed with and without feature selection methods. Finally, Adaptive Moment Estimation (Adam) and Random Adaptive Moment Estimation (RanAdam) hyper-parameter tuning techniques are used as improvisation techniques for classifiers. The SVM (RBF) classifier with the Fast Fourier Transform Dimensionality Reduction method and Dragonfly feature selection achieved the highest accuracy of 98.343% with RanAdam hyper-parameter tuning compared to other classifiers.

Refining breast cancer biomarker discovery and drug targeting through an advanced data-driven approach

Breast cancer remains a major public health challenge worldwide. The identification of accurate biomarkers is critical for the early detection and effective treatment of breast cancer. This study utilizes an integrative machine learning approach to analyze breast cancer gene expression data for superior biomarker and drug target discovery. Gene expression datasets, obtained from the GEO database, were merged post-preprocessing. From the merged dataset, differential expression analysis between breast cancer and normal samples revealed 164 differentially expressed genes. Meanwhile, a separate gene expression dataset revealed 350 differentially expressed genes. Additionally, the BGWO_SA_Ens algorithm, integrating binary grey wolf optimization and simulated annealing with an ensemble classifier, was employed on gene expression datasets to identify predictive genes including TOP2A, AKR1C3, EZH2, MMP1, EDNRB, S100B, and SPP1. From over 10,000 genes, BGWO_SA_Ens identified 1404 in the merged dataset (F1 score: 0.981, PR-AUC: 0.998, ROC-AUC: 0.995) and 1710 in the GSE45827 dataset (F1 score: 0.965, PR-AUC: 0.986, ROC-AUC: 0.972). The intersection of DEGs and BGWO_SA_Ens selected genes revealed 35 superior genes that were consistently significant across methods. Enrichment analyses uncovered the involvement of these superior genes in key pathways such as AMPK, Adipocytokine, and PPAR signaling. Protein-protein interaction network analysis highlighted subnetworks and central nodes. Finally, a drug-gene interaction investigation revealed connections between superior genes and anticancer drugs. Collectively, the machine learning workflow identified a robust gene signature for breast cancer, illuminated their biological roles, interactions and therapeutic associations, and underscored the potential of computational approaches in biomarker discovery and precision oncology.

Gene selection and tumor identification based on a hybrid of the multi-filter embedded recursive mountain gazelle algorithm

Microarray gene expression data are useful for identifying gene expression patterns associated with cancer outcomes; however, their high dimensionality make it difficult to extract meaningful information and accurately classify tumors. Hence, developing effective methods for reducing dimensionality while preserving relevant information is a crucial task. Hybrid-based gene selection methods are widely proposed in the gene expression analysis domain and can still be enhanced in terms of efficiency and reliability. This study proposes a new hybrid-based gene selection method, called multi-filter embedded mountain gazelle optimizer (MUL-MGO), which utilizes two filters and an embedded method to remove irrelevant genes, followed by selecting the most relevant genes using recently developed MGO algorithm. To the best of our knowledge, this is the first work to exploit MGO as a gene or feature selection method. A new version of MGO, called recursive mountain gazelle optimizer (RMGO), which implements MGO algorithm recursively to avoid local optima, minimize search space, and obtain minimum gene count without decreasing the classifier's performance, is developed. The proposed RMGO is used to develop a new hybrid gene selection method employing similar filters and embedded methods as MUL-MGO, but with a recursive MGO algorithm version. The resulting method is called multi-filter embedded recursive mountain gazelle optimizer (MUL-RMGO). Several classifiers are used for cancer classification. Accordingly, several experimental studies are performed on eight microarray gene expression datasets to demonstrate the proficiencies of MUL-MGO and MUL-RMGO methods. The experimental findings indicate the efficiency and productivity of the suggested MUL-MGO and MUL-RMGO methods for gene selection. The methods outperform cutting-edge methods in the literature, with MUL-RMGO exceeding MUL-MGO in terms of accuracy and selected gene count.

A robust medical image steganography approach based on particle swarm optimization algorithm and quantum walks

Medical information plays an essential task in our everyday lives, in which medical data privacy and security constitute an important issue. The confidentiality of medical data can be achieved by applying one or more encryption and data hiding methods. Amidst the development of quantum computers, most medical data confidentiality techniques may be hacked because their construction is based on mathematical models. Most medical data have a long lifetime exceeding 25 years. Therefore, it is an important issue to design a new medical data hiding technique that has the capability to withstand the probable attacks from the side of quantum or digital devices. In this article, we aim to present a novel medical image steganography strategy based on quantum walks, chaotic systems, and particle swarm optimization algorithm. A 3-D chaotic system and quantum walks are utilized for operating particle swarm optimization algorithm, in which the generated velocity sequence is utilized for substituting the confidential data, and the position sequence is utilized for selecting which position in the hosting image will be employed to host the substituted confidential data. The payload capacity of the suggested mechanism is 2 bits per 1 byte, and the average value for PSNR is 44.1, which is big enough for the naked eye to not differentiate the difference between the carrier image and its stego one.