A Novel Multitasking Ant Colony Optimization Method for Detecting Multiorder SNP Interactions

Distributed multi-objective optimization for SNP-SNP interaction detection

The detection of complex interactions between single nucleotide polymorphisms (SNPs) plays a vital role in genome-wide association analysis (GWAS). The multi-objective evolutionary algorithm is a promising technique for SNP-SNP interaction detection. However, as the scale of SNP data further increases, the exponentially growing search space gradually becomes the dominant factor, causing evolutionary algorithm (EA)-based approaches to fall into local optima. In addition, multi-objective genetic operations consume significant amounts of time and computational resources. To this end, this study proposes a distributed multi-objective evolutionary framework (DM-EF) to identify SNP-SNP interactions on large-scale datasets. DM-EF first partitions the entire search space into several subspaces based on a space-partitioning strategy, which is nondestructive because it guarantees that each feasible solution is assigned to a specific subspace. Thereafter, each subspace is optimized using a multi-objective EA optimizer, and all subspaces are optimized in parallel. A decomposition-based multi-objective firework optimizer (DCFWA) with several problem-guided operators was designed. Finally, the final output is selected from the Pareto-optimal solutions in the historical search of each subspace. DM-EF avoids the preference for a single objective function, handles the heavy computational burden, and enhances the diversity of the population to avoid local optima. Notably, DM-EF is load-balanced and scalable because it can flexibly partition the space according to the number of available computational nodes and problem size. Experiments on both artificial and real-world datasets demonstrate that the proposed method significantly improves the search speed and accuracy.

A multistart tabu search-based method for feature selection in medical applications

In the design of classification models, irrelevant or noisy features are often generated. In some cases, there may even be negative interactions among features. These weaknesses can degrade the performance of the models. Feature selection is a task that searches for a small subset of relevant features from the original set that generate the most efficient models possible. In addition to improving the efficiency of the models, feature selection confers other advantages, such as greater ease in the generation of the necessary data as well as clearer and more interpretable models. In the case of medical applications, feature selection may help to distinguish which characteristics, habits, and factors have the greatest impact on the onset of diseases. However, feature selection is a complex task due to the large number of possible solutions. In the last few years, methods based on different metaheuristic strategies, mainly evolutionary algorithms, have been proposed. The motivation of this work is to develop a method that outperforms previous methods, with the benefits that this implies especially in the medical field. More precisely, the present study proposes a simple method based on tabu search and multistart techniques. The proposed method was analyzed and compared to other methods by testing their performance on several medical databases. Specifically, eight databases belong to the well-known repository of the University of California in Irvine and one of our own design were used. In these computational tests, the proposed method outperformed other recent methods as gauged by various metrics and classifiers. The analyses were accompanied by statistical tests, the results of which showed that the superiority of our method is significant and therefore strengthened these conclusions. In short, the contribution of this work is the development of a method that, on the one hand, is based on different strategies than those used in recent methods, and on the other hand, improves the performance of these methods.

Using Bayesian networks with Tabu-search algorithm to explore risk factors for hyperhomocysteinemia

Hyperhomocysteinemia (HHcy) is a condition closely associated with cardiovascular and cerebrovascular diseases. Detecting its risk factors and taking some relevant interventions still represent the top priority to lower its prevalence. Yet, in discussing risk factors, Logistic regression model is usually adopted but accompanied by some defects. In this study, a Tabu Search-based BNs was first constructed for HHcy and its risk factors, and the conditional probability between nodes was calculated using Maximum Likelihood Estimation. Besides, we tried to compare its performance with Hill Climbing-based BNs and Logistic regression model in risk factor detection and discuss its prospect in clinical practice. Our study found that Age, sex, α1-microgloblobumin to creatinine ratio, fasting plasma glucose, diet and systolic blood pressure represent direct risk factors for HHcy, and smoking, glycosylated hemoglobin and BMI constitute indirect risk factors for HHcy. Besides, the performance of Tabu Search-based BNs is better than Hill Climbing-based BNs. Accordingly, BNs with Tabu Search algorithm could be a supplement for Logistic regression, allowing for exploring the complex network relationship and the overall linkage between HHcy and its risk factors. Besides, Bayesian reasoning allows for risk prediction of HHcy, which is more reasonable in clinical practice and thus should be promoted.