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.

Deep evolutionary fusion neural network: a new prediction standard for infectious disease incidence rates.

BACKGROUND: Previously, many methods have been used to predict the incidence trends of infectious diseases. There are numerous methods for predicting the incidence trends of infectious diseases, and they have exhibited varying degrees of success. However, there are a lack of prediction benchmarks that integrate linear and nonlinear methods and effectively use internet data. The aim of this paper is to develop a prediction model of the incidence rate of infectious diseases that integrates multiple methods and multisource data, realizing ground-breaking research. RESULTS: The infectious disease dataset is from an official release and includes four national and three regional datasets. The Baidu index platform provides internet data. We choose a single model (seasonal autoregressive integrated moving average (SARIMA), nonlinear autoregressive neural network (NAR), and long short-term memory (LSTM)) and a deep evolutionary fusion neural network (DEFNN). The DEFNN is built using the idea of neural evolution and fusion, and the DEFNN + is built using multisource data. We compare the model accuracy on reference group data and validate the model generalizability on external data. (1) The loss of SA-LSTM in the reference group dataset is 0.4919, which is significantly better than that of other single models. (2) The loss values of SA-LSTM on the national and regional external datasets are 0.9666, 1.2437, 0.2472, 0.7239, 1.4026, and 0.6868. (3) When multisource indices are added to the national dataset, the loss of the DEFNN + increases to 0.4212, 0.8218, 1.0331, and 0.8575. CONCLUSIONS: We propose an SA-LSTM optimization model with good accuracy and generalizability based on the concept of multiple methods and multiple data fusion. DEFNN enriches and supplements infectious disease prediction methodologies, can serve as a new benchmark for future infectious disease predictions and provides a reference for the prediction of the incidence rates of various infectious diseases.

Performance analyses of weighted superposition attraction-repulsion algorithms in solving difficult optimization problems.

The purpose of this paper is to test the performance of the recently proposed weighted superposition attraction-repulsion algorithms (WSA and WSAR) on unconstrained continuous optimization test problems and constrained optimization problems. WSAR is a successor of weighted superposition attraction algorithm (WSA). WSAR is established upon the superposition principle from physics and mimics attractive and repulsive movements of solution agents (vectors). Differently from the WSA, WSAR also considers repulsive movements with updated solution move equations. WSAR requires very few algorithm-specific parameters to be set and has good convergence and searching capability. Through extensive computational tests on many benchmark problems including CEC'2015 and CEC'2020 performance of the WSAR is compared against WSA and other metaheuristic algorithms. It is statistically shown that the WSAR algorithm is able to produce good and competitive results in comparison to its predecessor WSA and other metaheuristic algorithms.

Hyperparameter Optimization with Genetic Algorithms and XGBoost: A Step Forward in Smart Grid Fraud Detection.

This study provides a comprehensive analysis of the combination of Genetic Algorithms (GA) and XGBoost, a well-known machine-learning model. The primary emphasis lies in hyperparameter optimization for fraud detection in smart grid applications. The empirical findings demonstrate a noteworthy enhancement in the model's performance metrics following optimization, particularly emphasizing a substantial increase in accuracy from 0.82 to 0.978. The precision, recall, and AUROC metrics demonstrate a clear improvement, indicating the effectiveness of optimizing the XGBoost model for fraud detection. The findings from our study significantly contribute to the expanding field of smart grid fraud detection. These results emphasize the potential uses of advanced metaheuristic algorithms to optimize complex machine-learning models. This work showcases significant progress in enhancing the accuracy and efficiency of fraud detection systems in smart grids.

Energy Efficiency Optimisation of Joint Computational Task Offloading and Resource Allocation Using Particle Swarm Optimisation Approach in Vehicular Edge Networks.

With the progression of smart vehicles, i.e., connected autonomous vehicles (CAVs), and wireless technologies, there has been an increased need for substantial computational operations for tasks such as path planning, scene recognition, and vision-based object detection. Managing these intensive computational applications is concerned with significant energy consumption. Hence, for this article, a low-cost and sustainable solution using computational offloading and efficient resource allocation at edge devices within the Internet of Vehicles (IoV) framework has been utilised. To address the quality of service (QoS) among vehicles, a trade-off between energy consumption and computational time has been taken into consideration while deciding on the offloading process and resource allocation. The offloading process has been assigned at a minimum wireless resource block level to adapt to the beyond 5G (B5G) network. The novel approach of joint optimisation of computational resources and task offloading decisions uses the meta-heuristic particle swarm optimisation (PSO) algorithm and decision analysis (DA) to find the near-optimal solution. Subsequently, a comparison is made with other proposed algorithms, namely CTORA, CODO, and Heuristics, in terms of computational efficiency and latency. The performance analysis reveals that the numerical results outperform existing algorithms, demonstrating an 8% and a 5% increase in energy efficiency.

Assessment of noise pollution-prone areas using an explainable geospatial artificial intelligence approach.

This research aims to use the power of geospatial artificial intelligence (GeoAI), employing the categorical boosting (CatBoost) machine learning model in conjunction with two metaheuristic algorithms, the firefly algorithm (CatBoost-FA) and the fruit fly optimization algorithm (CatBoost-FOA), to spatially assess and map noise pollution prone areas in Tehran city, Iran. To spatially model areas susceptible to noise pollution, we established a comprehensive spatial database encompassing data for the annual average Leq (equivalent continuous sound level) from 2019 to 2022. This database was enriched with critical spatial criteria influencing noise pollution, including urban land use, traffic volume, population density, and normalized difference vegetation index (NDVI). Our study evaluated the predictive accuracy of these models using key performance metrics, including root mean square error (RMSE), mean absolute error (MAE), and receiver operating characteristic (ROC) indices. The results demonstrated the superior performance of the CatBoost-FA algorithm, with RMSE and MAE values of 0.159 and 0.114 for the training data and 0.437 and 0.371 for the test data, outperforming both the CatBoost-FOA and CatBoost models. ROC analysis further confirmed the efficacy of the models, achieving an accuracy of 0.897, CatBoost-FOA with an accuracy of 0.871, and CatBoost with an accuracy of 0.846, highlighting their robust modeling capabilities. Additionally, we employed an explainable artificial intelligence (XAI) approach, utilizing the SHAP (Shapley Additive Explanations) method to interpret the underlying mechanisms of our models. The SHAP results revealed the significant influence of various factors on noise-pollution-prone areas, with airport, commercial, and administrative zones emerging as pivotal contributors.

An interval water demand prediction method to reduce uncertainty: A case study of Sichuan Province, China.

Effective prediction of water demand is a prerequisite for decision makers to achieve reliable management of water supply. Currently, the research on water demand prediction focuses on point prediction method. In this study, we constructed a GA-BP-KDE hybrid interval water demand prediction model by combining non-parametric estimation and point prediction. Multiple metaheuristic algorithms were used to optimize the Back-Propagation Neural Network (BP) and Kernel Extreme Learning Machine (KELM) network structures. The performance of the water demand point prediction models was compared by the Root Mean Squared Error (RMSE), Mean Absolute Percentage Error (MAPE), Kling-Gupta Efficiency (KGE), computation time, and fitness convergence curves. The kernel density estimation method (KDE) and the normal distribution method were used to fit the distribution of errors. The probability density function with the best fitting degree was selected based on the index G. The shortest confidence interval under 95% confidence was calculated according to the asymmetry of the error distribution. We predicted the impact indicator values for 2025 using the exponential smoothing method, and obtained water demand prediction intervals for various water use sectors. The results showed that the GA-BP model was the optimal model as it exhibited the highest computational efficiency, algorithmic stability, and prediction accuracy. The three prediction intervals estimated after adjusting the KDE bandwidth parameter covered most of the sample points in the test set. The prediction intervals of the four water use sectors were evaluated as F values of 1.6845, 1.3294, 1.6237, and 1.3600, which indicates high accuracy and quality of the prediction intervals. The mixed water demand interval prediction based on GA-BP-KDE reduces the uncertainty of the point prediction results and can provide a basis for water resource management by decision makers.

A novel nonlinear time-varying sigmoid transfer function in binary whale optimization algorithm for descriptors selection in drug classification.

In computational chemistry, the high-dimensional molecular descriptors contribute to the curse of dimensionality issue. Binary whale optimization algorithm (BWOA) is a recently proposed metaheuristic optimization algorithm that has been efficiently applied in feature selection. The main contribution of this paper is a new version of the nonlinear time-varying Sigmoid transfer function to improve the exploitation and exploration activities in the standard whale optimization algorithm (WOA). A new BWOA algorithm, namely BWOA-3, is introduced to solve the descriptors selection problem, which becomes the second contribution. To validate BWOA-3 performance, a high-dimensional drug dataset is employed. The proficiency of the proposed BWOA-3 and the comparative optimization algorithms are measured based on convergence speed, the length of the selected feature subset, and classification performance (accuracy, specificity, sensitivity, and f-measure). In addition, statistical significance tests are also conducted using the Friedman test and Wilcoxon signed-rank test. The comparative optimization algorithms include two BWOA variants, binary bat algorithm (BBA), binary gray wolf algorithm (BGWOA), and binary manta-ray foraging algorithm (BMRFO). As the final contribution, from all experiments, this study has successfully revealed the superiority of BWOA-3 in solving the descriptors selection problem and improving the Amphetamine-type Stimulants (ATS) drug classification performance.

Chaotic Mapping Lion Optimization Algorithm-Based Node Localization Approach for Wireless Sensor Networks.

Wireless Sensor Networks (WSNs) contain several small, autonomous sensor nodes (SNs) able to process, transfer, and wirelessly sense data. These networks find applications in various domains like environmental monitoring, industrial automation, healthcare, and surveillance. Node Localization (NL) is a major problem in WSNs, aiming to define the geographical positions of sensors correctly. Accurate localization is essential for distinct WSN applications comprising target tracking, environmental monitoring, and data routing. Therefore, this paper develops a Chaotic Mapping Lion Optimization Algorithm-based Node Localization Approach (CMLOA-NLA) for WSNs. The purpose of the CMLOA-NLA algorithm is to define the localization of unknown nodes based on the anchor nodes (ANs) as a reference point. In addition, the CMLOA is mainly derived from the combination of the tent chaotic mapping concept into the standard LOA, which tends to improve the convergence speed and precision of NL. With extensive simulations and comparison results with recent localization approaches, the effectual performance of the CMLOA-NLA technique is illustrated. The experimental outcomes demonstrate considerable improvement in terms of accuracy as well as efficiency. Furthermore, the CMLOA-NLA technique was demonstrated to be highly robust against localization error and transmission range with a minimum average localization error of 2.09%.

Meshless Search SR-STAP for Airborne Radar Based on Meta-Heuristic Algorithms.

The sparse recovery (SR) space-time adaptive processing (STAP) method has excellent clutter suppression performance under the condition of limited observation samples. However, when the cluttering is nonlinear in a spatial-Doppler profile, it will cause an off-grid effect and reduce the sparse recovery performance. A meshless search using a meta-heuristic algorithm (MH) can completely eliminate the off-grid effect in theory. Therefore, genetic algorithm (GA), differential evolution (DE), particle swarm optimization (PSO), and grey wolf optimization (GWO) methods are applied to SR-STAP for selecting exact clutter atoms in this paper. The simulation results show that MH-STAP can estimate the clutter subspace more accurately than the traditional algorithm; PSO-STAP and GWO-STAP showed better clutter suppression performance in four MH-STAP methods. To search for more accurate clutter atoms, PSO and GWO are combined to improve the method's capacity for global optimization. Meanwhile, the fitness function is improved by using prior knowledge of the clutter distribution. The simulation results show that the improved PSO-GWO-STAP algorithm provides excellent clutter suppression performance, which solves the off-grid problem better than does single MH-STAP.