Semi-supervised prediction of human miRNA-disease association based on graph regularization framework in heterogeneous networks

Predicting associations between drugs and G protein-coupled receptors using a multi-graph convolutional network

Developing new drugs is an expensive, time-consuming process that frequently involves safety concerns. By discovering novel uses for previously verified drugs, drug repurposing helps to bypass the time-consuming and costly process of drug development. As the largest family of proteins targeted by verified drugs, G protein-coupled receptors (GPCR) are vital to efficiently repurpose drugs by inferring their associations with drugs. Drug repurposing may be sped up by computational models that predict the strength of novel drug-GPCR pairs interaction. To this end, a number of models have been put forth. In existing methods, however, drug structure, drug-drug interactions, GPCR sequence, and subfamily information couldn't simultaneously be taken into account to detect novel drugs-GPCR relationships. In this study, based on a multi-graph convolutional network, an end-to-end deep model was developed to efficiently and precisely discover latent drug-GPCR relationships by combining data from multi-sources. We demonstrated that our model, based on multi-graph convolutional networks, outperformed rival deep learning techniques as well as non-deep learning models in terms of inferring drug-GPCR relationships. Our results indicated that integrating data from multi-sources can lead to further advancement.

Graph-Based Semi-Supervised Learning: A Comprehensive Review

Semi-supervised learning (SSL) has tremendous value in practice due to the utilization of both labeled and unlabelled data. An essential class of SSL methods, referred to as graph-based semi-supervised learning (GSSL) methods in the literature, is to first represent each sample as a node in an affinity graph, and then, the label information of unlabeled samples can be inferred based on the structure of the constructed graph. GSSL methods have demonstrated their advantages in various domains due to their uniqueness of structure, the universality of applications, and their scalability to large-scale data. Focusing on GSSL methods only, this work aims to provide both researchers and practitioners with a solid and systematic understanding of relevant advances as well as the underlying connections among them. The concentration on one class of SSL makes this article distinct from recent surveys that cover a more general and broader picture of SSL methods yet often neglect the fundamental understanding of GSSL methods. In particular, a significant contribution of this article lies in a newly generalized taxonomy for GSSL under the unified framework, with the most up-to-date references and valuable resources such as codes, datasets, and applications. Furthermore, we present several potential research directions as future work with our insights into this rapidly growing field.

Machine learning in the development of targeting microRNAs in human disease

A microRNA is a small, single-stranded, non-coding ribonucleic acid that plays a crucial role in RNA silencing and can regulate gene expression. With the in-depth study of miRNA in development and disease, miRNA has become an attractive target for novel therapeutic strategies. Exploring miRNA targeting therapy only through experiments is expensive and laborious, so it is essential to develop novel and efficient computational methods to narrow down the search. Recent advances in machine learning applied in biomedical informatics provide opportunities to explore miRNA-targeting drugs, thus promoting miRNA therapeutics. This review provides an overview of recent advancements in miRNA targeting therapeutic using machine learning. First, we mainly describe the basics of predicting miRNA targeting drugs, including pharmacogenomic data resources and data preprocessing. Then we present primary machine learning algorithms and elaborate their application in discovering relationships among miRNAs, drugs, and diseases. Along with the progress of miRNA targeting therapeutics, we finally analyze and discuss the current challenges and opportunities that machine learning confronts.

Prediction of Synergistic Antibiotic Combinations by Graph Learning

Antibiotic resistance is a major public health concern. Antibiotic combinations, offering better efficacy at lower doses, are a useful way to handle this problem. However, it is difficult for us to find effective antibiotic combinations in the vast chemical space. Herein, we propose a graph learning framework to predict synergistic antibiotic combinations. In this model, a network proximity method combined with network propagation was used to quantify the relationships of drug pairs, and we found that synergistic antibiotic combinations tend to have smaller network proximity. Therefore, network proximity can be used for building an affinity matrix. Subsequently, the affinity matrix was fed into a graph regularization model to predict potential synergistic antibiotic combinations. Compared with existing methods, our model shows a better performance in the prediction of synergistic antibiotic combinations and interpretability.

Incorporating Clinical, Chemical and Biological Information for Predicting Small Molecule-microRNA Associations Based on Non-Negative Matrix Factorization

Small molecule(SM) drugs can affect the expression of miRNAs, which plays crucial roles in many important biological processes. The chemical structure and clinical information of small molecule can simultaneously incorporate information such as anatomical distribution, therapeutic effects and structural characteristics. It is necessary to develop a novel model that incorporates small molecule chemical structure and clinical information to reveal the unknown small molecule-miRNA associations. In this study, we developed a new framework based on non-negative matrix factorization, called SMANMF, to discover the potential small molecules-miRNAs associations. First, the functional similarity of two miRNAs can be obtained by computing the overlap of the target gene sets in which the miRNAs interact together, and we integrated two types of small molecule similarities, including chemical similarity and clinical similarity. Then, we utilized a non-negative matrix factorization model to discover the unknown relationship between small molecules and miRNAs. The evaluation results indicate that our model can achieve superior prediction performance compared with previous approaches in 5-fold cross-validation. At the same time, the results of case studies also reveal that the SMANMF model has good predictive performance for predicting the potential association between small molecules and miRNAs.

Heterogeneous information network and its application to human health and disease

The molecular components with the functional interdependencies in human cell form complicated biological network. Diseases are mostly caused by the perturbations of the composite of the interaction multi-biomolecules, rather than an abnormality of a single biomolecule. Furthermore, new biological functions and processes could be revealed by discovering novel biological entity relationships. Hence, more and more biologists focus on studying the complex biological system instead of the individual biological components. The emergence of heterogeneous information network (HIN) offers a promising way to systematically explore complicated and heterogeneous relationships between various molecules for apparently distinct phenotypes. In this review, we first present the basic definition of HIN and the biological system considered as a complex HIN. Then, we discuss the topological properties of HIN and how these can be applied to detect network motif and functional module. Afterwards, methodologies of discovering relationships between disease and biomolecule are presented. Useful insights on how HIN aids in drug development and explores human interactome are provided. Finally, we analyze the challenges and opportunities for uncovering combinatorial patterns among pharmacogenomics and cell-type detection based on single-cell genomic data.

MDA-CF: Predicting MiRNA-Disease associations based on a cascade forest model by fusing multi-source information

MicroRNAs (miRNAs) are significant regulators in various biological processes. They may become promising biomarkers or therapeutic targets, which provide a new perspective in diagnosis and treatment of multiple diseases. Since the experimental methods are always costly and resource-consuming, prediction of disease-related miRNAs using computational methods is in great need. In this study, we developed MDA-CF to identify underlying miRNA-disease associations based on a cascade forest model. In this method, multi-source information was integrated to represent miRNAs and diseases comprehensively, and the autoencoder was utilized for dimension reduction to obtain the optimal feature space. The cascade forest model was then employed for miRNA-disease association prediction. As a result, the average AUC of MDA-CF was 0.9464 on HMDD v3.2 in five-fold cross-validation. Compared with previous computational methods, MDA-CF performed better on HMDD v2.0 with an average AUC of 0.9258. Moreover, MDA-CF was implemented to investigate colon neoplasm, breast neoplasm, and gastric neoplasm, and 100%, 86%, 88% of the top 50 potential miRNAs were validated by authoritative databases. In conclusion, MDA-CF appears to be a reliable method to uncover disease-associated miRNAs. The source code of MDA-CF is available at https://github.com/a1622108/MDA-CF.

An Ensemble Matrix Completion Model for Predicting Potential Drugs Against SARS-CoV-2

Because of the catastrophic outbreak of global coronavirus disease 2019 (COVID-19) and its strong infectivity and possible persistence, computational repurposing of existing approved drugs will be a promising strategy that facilitates rapid clinical treatment decisions and provides reasonable justification for subsequent clinical trials and regulatory reviews. Since the effects of a small number of conditionally marketed vaccines need further clinical observation, there is still an urgent need to quickly and effectively repurpose potentially available drugs before the next disease peak. In this work, we have manually collected a set of experimentally confirmed virus-drug associations through the publicly published database and literature, consisting of 175 drugs and 95 viruses, as well as 933 virus-drug associations. Then, because the samples are extremely sparse and unbalanced, negative samples cannot be easily obtained. We have developed an ensemble model, EMC-Voting, based on matrix completion and weighted soft voting, a semi-supervised machine learning model for computational drug repurposing. Finally, we have evaluated the prediction performance of EMC-Voting by fivefold crossing-validation and compared it with other baseline classifiers and prediction models. The case study for the virus SARS-COV-2 included in the dataset demonstrates that our model achieves the outperforming AUPR value of 0.934 in virus-drug association's prediction.

Inferring Synergistic Drug Combinations Based on Symmetric Meta-Path in a Novel Heterogeneous Network

Combinatorial drug therapy is a promising way for treating cancers, which can reduce drug side effects and improve drug efficacy. However, due to the large-scale combinatorial space, it is difficult to quickly and effectively identify novel synergistic drug combinations for further implementing combinatorial drug therapy. The computational method of fusing multi-source knowledge is a time- and cost-efficient strategy to infer synergistic drug combinations for testing. However, for the existing computational methods of inferring synergistic drug combinations, it still remains a challenging to effectively combine multi-source information to achieve the desired results. Hence, in this study, we developed a novel Inference method of Synergistic Drug Combinations based on Symmetric Meta-Path (ISDCSMP), which can systematically and accurately prioritize synergistic drug combinations in a novel drug-target heterogeneous network integrating multi-source information. In the experiment, ISDCSMP outperformed the state-of-the-art methods in terms of AUC and precision on the benchmark dataset in five-fold cross validation. Moreover, we further illustrated performances of different ways for obtaining the combination coefficients, and analyzed the influences of the maximum meta-path length. The performances of various single meta-paths were described in five-fold cross validation. Finally, we confirmed the practical usefulness of ISDCSMP with the predicted novel synergistic drug combinations. The source code of ISDCSMP is available at https://github.com/KDDing/ISDCSMP.

Grey wolf assisted dragonfly-based weighted rule generation for predicting heart disease and breast cancer

Disease prediction plays a significant role in the life of people, as predicting the threat of diseases is necessary for citizens to live life in a healthy manner. The current development of data mining schemes has offered several systems that concern on disease prediction. Even though the disease prediction system includes more advantages, there are still many challenges that might limit its realistic use, such as the efficiency of prediction and information protection. This paper intends to develop an improved disease prediction model, which includes three phases: Weighted Coalesce rule generation, Optimized feature extraction, and Classification. At first, Coalesce rule generation is carried out after data transformation that involves normalization and sequential labeling. Here, rule generation is done based on the weights (priority level) assigned for each attribute by the expert. The support of each rule is multiplied with the proposed weighted function, and the resultant weighted support is compared with the minimum support for selecting the rules. Further, the obtained rule is subject to the optimal feature selection process. The hybrid classifiers that merge Support Vector Machine (SVM), and Deep Belief Network (DBN) takes the role of classification, which characterizes whether the patient is affected with the disease or not. In fact, the optimized feature selection process depends on a new hybrid optimization algorithm by linking the Grey Wolf Optimization (GWO) with Dragonfly Algorithm (DA) and hence, the presented model is termed as Grey Wolf Levy Updated-DA (GWU-DA). Here, the heart disease and breast cancer data are taken, where the efficiency of the proposed model is validated by comparing over the state-of-the-art models. From the analysis, the proposed GWU-DA model for accuracy is 65.98 %, 53.61 %, 42.27 %, 35.05 %, 34.02 %, 11.34 %, 13.4 %, 10.31 %, 9.28 % and 9.89 % better than CBA + CPAR, MKL + ANFIS, RF + EA, WCBA, IQR + KNN + PSO, NL-DA + SVM + DBN, AWFS-RA, HCS-RFRS, ADS-SM-DNN and OSSVM-HGSA models at 60th learning percentage.

MDA-GCNFTG: identifying miRNA-disease associations based on graph convolutional networks via graph sampling through the feature and topology graph

Accurate identification of the miRNA-disease associations (MDAs) helps to understand the etiology and mechanisms of various diseases. However, the experimental methods are costly and time-consuming. Thus, it is urgent to develop computational methods towards the prediction of MDAs. Based on the graph theory, the MDA prediction is regarded as a node classification task in the present study. To solve this task, we propose a novel method MDA-GCNFTG, which predicts MDAs based on Graph Convolutional Networks (GCNs) via graph sampling through the Feature and Topology Graph to improve the training efficiency and accuracy. This method models both the potential connections of feature space and the structural relationships of MDA data. The nodes of the graphs are represented by the disease semantic similarity, miRNA functional similarity and Gaussian interaction profile kernel similarity. Moreover, we considered six tasks simultaneously on the MDA prediction problem at the first time, which ensure that under both balanced and unbalanced sample distribution, MDA-GCNFTG can predict not only new MDAs but also new diseases without known related miRNAs and new miRNAs without known related diseases. The results of 5-fold cross-validation show that the MDA-GCNFTG method has achieved satisfactory performance on all six tasks and is significantly superior to the classic machine learning methods and the state-of-the-art MDA prediction methods. Moreover, the effectiveness of GCNs via the graph sampling strategy and the feature and topology graph in MDA-GCNFTG has also been demonstrated. More importantly, case studies for two diseases and three miRNAs are conducted and achieved satisfactory performance.

An In Silico Method for Predicting Drug Synergy Based on Multitask Learning

To make better use of all kinds of knowledge to predict drug synergy, it is crucial to successfully establish a drug synergy prediction model and leverage the reconstruction of sparse known drug targets. Therefore, we present an in silico method that predicts the synergy scores of drug pairs based on multitask learning (DSML) that could fuse drug targets, protein-protein interactions, anatomical therapeutic chemical codes, a priori knowledge of drug combinations. To simultaneously reconstruct drug-target protein interactions and synergistic drug combinations, DSML benefits indirectly from the associations with relation through proteins. In cross-validation experiments, DSML improved the ability to predict drug synergy. Moreover, the reconstruction of drug-target interactions and the incorporation of multisource knowledge significantly improved drug combination predictions by a large margin. The potential drug combinations predicted by DSML demonstrate its ability to predict drug synergy.

Deep learning disease prediction model for use with intelligent robots

Deep learning applications with robotics contribute to massive challenges that are not addressed in machine learning. The present world is currently suffering from the COVID-19 pandemic, and millions of lives are getting affected every day with extremely high death counts. Early detection of the disease would provide an opportunity for proactive treatment to save lives, which is the primary research objective of this study. The proposed prediction model caters to this objective following a stepwise approach through cleaning, feature extraction, and classification. The cleaning process constitutes the cleaning of missing values ,which is proceeded by outlier detection using the interpolation of splines and entropy-correlation. The cleaned data is then subjected to a feature extraction process using Principle Component Analysis. A Fitness Oriented Dragon Fly algorithm is introduced to select optimal features, and the resultant feature vector is fed into the Deep Belief Network. The overall accuracy of the proposed scheme experimentally evaluated with the traditional state of the art models. The results highlighted the superiority of the proposed model wherein it was observed to be 6.96% better than Firefly, 6.7% better than Particle Swarm Optimization, 6.96% better than Gray Wolf Optimization ad 7.22% better than Dragonfly Algorithm.

Incorporating Multisource Knowledge To Predict Drug Synergy Based on Graph Co-regularization

Drug combinations may reduce toxicity and increase therapeutic efficacy, offering a promising strategy to conquer multiple complex diseases. However, due to large-scale combinatorial space, it remains challenging to identify effective combinations. Although many computational methods have focused on predicting drug synergy to reduce combinatorial space, they fail to effectively consider multiple sources of important knowledge. Thus, it is necessary to propose a computational method that can exploit useful information to predict drug synergy. Here, we developed a computational method to predict drug synergy based on graph co-regularization, named DSGCR. By incorporating drug-target network patterns, pharmacological patterns, and prior knowledge of drug combinations, DSGCR performs predictions of synergistic drug combinations. Compared to several existing methods, DSGCR achieves superior performance in predicting drug synergy in terms of various metrics via cross-validation. Additionally, we analyzed the importance of various sources of drug knowledge concerning three DSGCR's scenarios. Finally, the potential of DSGCR to score drug synergy was confirmed by three predicted synergistic drug combinations.

A network embedding-based multiple information integration method for the MiRNA-disease association prediction

BACKGROUND

MiRNAs play significant roles in many fundamental and important biological processes, and predicting potential miRNA-disease associations makes contributions to understanding the molecular mechanism of human diseases. Existing state-of-the-art methods make use of miRNA-target associations, miRNA-family associations, miRNA functional similarity, disease semantic similarity and known miRNA-disease associations, but the known miRNA-disease associations are not well exploited.

RESULTS

In this paper, a network embedding-based multiple information integration method (NEMII) is proposed for the miRNA-disease association prediction. First, known miRNA-disease associations are formulated as a bipartite network, and the network embedding method Structural Deep Network Embedding (SDNE) is adopted to learn embeddings of nodes in the bipartite network. Second, the embedding representations of miRNAs and diseases are combined with biological features about miRNAs and diseases (miRNA-family associations and disease semantic similarities) to represent miRNA-disease pairs. Third, the prediction models are constructed based on the miRNA-disease pairs by using the random forest. In computational experiments, NEMII achieves high-accuracy performances and outperforms other state-of-the-art methods: GRNMF, NTSMDA and PBMDA. The usefulness of NEMII is further validated by case studies. The studies demonstrate the great potential of network embedding method for the miRNA-disease association prediction, and SDNE outperforms other popular network embedding methods: DeepWalk, High-Order Proximity preserved Embedding (HOPE) and Laplacian Eigenmaps (LE).

CONCLUSION

We propose a new method, named NEMII, for predicting miRNA-disease associations, which has great potential to benefit the field of miRNA-disease association prediction.

Improved Pre-miRNAs Identification Through Mutual Information of Pre-miRNA Sequences and Structures

Playing critical roles as post-transcriptional regulators, microRNAs (miRNAs) are a family of short non-coding RNAs that are derived from longer transcripts called precursor miRNAs (pre-miRNAs). Experimental methods to identify pre-miRNAs are expensive and time-consuming, which presents the need for computational alternatives. In recent years, the accuracy of computational methods to predict pre-miRNAs has been increasing significantly. However, there are still several drawbacks. First, these methods usually only consider base frequencies or sequence information while ignoring the information between bases. Second, feature extraction methods based on secondary structures usually only consider the global characteristics while ignoring the mutual influence of the local structures. Third, methods integrating high-dimensional feature information is computationally inefficient. In this study, we have proposed a novel mutual information-based feature representation algorithm for pre-miRNA sequences and secondary structures, which is capable of catching the interactions between sequence bases and local features of the RNA secondary structure. In addition, the feature space is smaller than that of most popular methods, which makes our method computationally more efficient than the competitors. Finally, we applied these features to train a support vector machine model to predict pre-miRNAs and compared the results with other popular predictors. As a result, our method outperforms others based on both 5-fold cross-validation and the Jackknife test.

FKL-Spa-LapRLS: an accurate method for identifying human microRNA-disease association

BACKGROUND

In the process of post-transcription, microRNAs (miRNAs) are closely related to various complex human diseases. Traditional verification methods for miRNA-disease associations take a lot of time and expense, so it is especially important to design computational methods for detecting potential associations. Considering the restrictions of previous computational methods for predicting potential miRNAs-disease associations, we develop the model of FKL-Spa-LapRLS (Fast Kernel Learning Sparse kernel Laplacian Regularized Least Squares) to break through the limitations.

RESULT

First, we extract three miRNA similarity kernels and three disease similarity kernels. Then, we combine these kernels into a single kernel through the Fast Kernel Learning (FKL) model, and use sparse kernel (Spa) to eliminate noise in the integrated similarity kernel. Finally, we find the associations via Laplacian Regularized Least Squares (LapRLS). Based on three evaluation methods, global and local leave-one-out cross validation (LOOCV), and 5-fold cross validation, the AUCs of our method achieve 0.9563, 0.8398 and 0.9535, thus it can be seen that our method is reliable. Then, we use case studies of eight neoplasms to further analyze the performance of our method. We find that most of the predicted miRNA-disease associations are confirmed by previous traditional experiments, and some important miRNAs should be paid more attention, which uncover more associations of various neoplasms than other miRNAs.

CONCLUSIONS

Our proposed model can reveal miRNA-disease associations and improve the accuracy of correlation prediction for various diseases. Our method can be also easily extended with more similarity kernels.

MDA-SKF: Similarity Kernel Fusion for Accurately Discovering miRNA-Disease Association

Identifying accurate associations between miRNAs and diseases is beneficial for diagnosis and treatment of human diseases. It is especially important to develop an efficient method to detect the association between miRNA and disease. Traditional experimental method has high precision, but its process is complicated and time-consuming. Various computational methods have been developed to uncover potential associations based on an assumption that similar miRNAs are always related to similar diseases. In this paper, we propose an accurate method, MDA-SKF, to uncover potential miRNA-disease associations. We first extract three miRNA similarity kernels (miRNA functional similarity, miRNA sequence similarity, Hamming profile similarity for miRNA) and three disease similarity kernels (disease semantic similarity, disease functional similarity, Hamming profile similarity for disease) in two subspaces, respectively. Then, due to limitations that some initial information may be lost in the process and some noises may be exist in integrated similarity kernel, we propose a novel Similarity Kernel Fusion (SKF) method to integrate multiple similarity kernels. Finally, we utilize the Laplacian Regularized Least Squares (LapRLS) method on the integrated kernel to find potential associations. MDA-SKF is evaluated by three evaluation methods, including global leave-one-out cross validation (LOOCV) and local LOOCV and 5-fold cross validation (CV), and achieves AUCs of 0.9576, 0.8356, and 0.9557, respectively. Compared with existing seven methods, MDA-SKF has outstanding performance on global LOOCV and 5-fold. We also test case studies to further analyze the performance of MDA-SKF on 32 diseases. Furthermore, 3200 candidate associations are obtained and a majority of them can be confirmed. It demonstrates that MDA-SKF is an accurate and efficient computational tool for guiding traditional experiments.