Heterogeneous Graph Convolutional Networks and Matrix Completion for miRNA-Disease Association Prediction

Meta-Path Semantic and Global-Local Representation Learning Enhanced Graph Convolutional Model for Disease-Related miRNA Prediction

Dysregulation of miRNAs is closely related to the progression of various diseases, so identifying disease-related miRNAs is crucial. Most recently proposed methods are based on graph reasoning, while they did not completely exploit the topological structure composed of the higher-order neighbor nodes and the global and local features of miRNA and disease nodes. We proposed a prediction method, MDAP, to learn semantic features of miRNA and disease nodes based on various meta-paths, as well as node features from the entire heterogeneous network perspective, and node pair attributes. Firstly, for both the miRNA and disease nodes, node category-wise meta-paths were constructed to integrate the similarity and association connection relationships. Each target node has its specific neighbor nodes for each meta-path, and the neighbors of longer meta-paths constitute its higher-order neighbor topological structure. Secondly, we constructed a meta-path specific graph convolutional network module to integrate the features of higher-order neighbors and their topology, and then learned the semantic representations of nodes. Thirdly, for the entire miRNA-disease heterogeneous network, a global-aware graph convolutional autoencoder was built to learn the network-view feature representations of nodes. We also designed semantic-level and representation-level attentions to obtain informative semantic features and node representations. Finally, the strategy based on the parallel convolutional-deconvolutional neural networks were designed to enhance the local feature learning for a pair of miRNA and disease nodes. The experiment results showed that MDAP outperformed other state-of-the-art methods, and the ablation experiments demonstrated the effectiveness of MDAP's major innovations. MDAP's ability in discovering potential disease-related miRNAs was further analyzed by the case studies over three diseases.

DGAMDA: Predicting miRNA-disease association based on dynamic graph attention network

MiRNA (microRNA)-disease association prediction has essential applications for early disease screening. The process of traditional biological experimental validation is both time-consuming and expensive. However, as artificial intelligence technology continues to advance, computational methods have become efficient tools for predicting miRNA-disease associations. These methods often rely on the combination of multiple sources of association data and require improved feature mining. This study proposes a dynamic graph attention-based association prediction model, DGAMDA, which combines feature mapping and dynamic graph attention mechanisms through feature mining on a single miRNA-disease association network. DGAMDA effectively solves the problems of feature heterogeneity and inadequate feature mining by previous static graph attention mechanisms and achieves high-precision feature mining and association scoring prediction. We conducted a five-fold cross-validation experiment and obtained the mean values of Accuracy, Precision, Recall, and F1-score, which were .8986, .8869, .9115, and .8984, respectively. Our proposed model outperforms other advanced models in terms of experimental results, demonstrating its effectiveness in feature mining and association prediction based on a single association network. In addition, our model can also be used to predict miRNAs associated with unknown diseases.

A Survey of Deep Learning for Detecting miRNA- Disease Associations: Databases, Computational Methods, Challenges, and Future Directions

MicroRNAs (miRNAs) are an important class of non-coding RNAs that play an essential role in the occurrence and development of various diseases. Identifying the potential miRNA-disease associations (MDAs) can be beneficial in understanding disease pathogenesis. Traditional laboratory experiments are expensive and time-consuming. Computational models have enabled systematic large-scale prediction of potential MDAs, greatly improving the research efficiency. With recent advances in deep learning, it has become an attractive and powerful technique for uncovering novel MDAs. Consequently, numerous MDA prediction methods based on deep learning have emerged. In this review, we first summarize publicly available databases related to miRNAs and diseases for MDA prediction. Next, we outline commonly used miRNA and disease similarity calculation and integration methods. Then, we comprehensively review the 48 existing deep learning-based MDA computation methods, categorizing them into classical deep learning and graph neural network-based techniques. Subsequently, we investigate the evaluation methods and metrics that are frequently used to assess MDA prediction performance. Finally, we discuss the performance trends of different computational methods, point out some problems in current research, and propose 9 potential future research directions. Data resources and recent advances in MDA prediction methods are summarized in the GitHub repository https://github.com/sheng-n/DL-miRNA-disease-association-methods.

Synchronous Mutual Learning Network and Asynchronous Multi-Scale Embedding Network for miRNA-Disease Association Prediction

MicroRNA (miRNA) serves as a pivotal regulator of numerous cellular processes, and the identification of miRNA-disease associations (MDAs) is crucial for comprehending complex diseases. Recently, graph neural networks (GNN) have made significant advancements in MDA prediction. However, these methods tend to learn one type of node representation from a single heterogeneous network, ignoring the importance of multiple network topologies and node attributes. Here, we propose SMDAP (Sequence hierarchical modeling-based Mirna-Disease Association Prediction framework), a novel GNN-based framework that incorporates multiple network topologies and various node attributes including miRNA seed and full-length sequences to predict potential MDAs. Specifically, SMDAP consists of two types of MDA representation: following a heterogeneous pattern, we construct a transfer learning-like synchronous mutual learning network to learn the first MDA representation in conjunction with the miRNA seed sequence. Meanwhile, following a homogeneous pattern, we design a subgraph-inspired asynchronous multi-scale embedding network to obtain the second MDA representation based on the miRNA full-length sequence. Subsequently, an adaptive fusion approach is designed to combine the two branches such that we can score the MDAs by the downstream classifier and infer novel MDAs. Comprehensive experiments demonstrate that SMDAP integrates the advantages of multiple network topologies and node attributes into two branch representations. Moreover, the area under the receiver operating characteristic curve is 0.9622 on DB1, which is a 5.06% increase from the baselines. The area under the precision-recall curve is 0.9777, which is a 7.33% increase from the baselines. In addition, case studies on three human cancers validated the predictive performance of SMDAP. Overall, SMDAP represents a powerful tool for MDA prediction.

Predicting Mirna-Disease Associations Based on Neighbor Selection Graph Attention Networks

Numerous experiments have shown that the occurrence of complex human diseases is often accompanied by abnormal expression of microRNA (miRNA). Identifying the associations between miRNAs and diseases is of great significance in the development of clinical medicine. However, traditional experimental methods are often time-consuming and inefficient. To this end, we proposed a deep learning method based on neighbor selection graph attention networks for predicting miRNA-disease associations (NSAMDA). Specifically, we firstly fused miRNA sequence similarity information and miRNA integrated similarity information to enrich miRNA feature information. Secondly, we used the fused miRNA feature information and disease integrated similarity information to construct a miRNA-disease heterogeneous graph. Thirdly, we introduced a neighbor selection method based on graph attention networks to select k-most important neighbors for aggregation. Finally, we used the inner product decoder to score miRNA-disease pairs. The results of five-fold cross-validation show that the mean AUC of NSAMDA is 93.69% on HMDD v2.0 dataset. In addition, case studies on the esophageal neoplasm, lung neoplasm and lymphoma were carried out to further confirm the effectiveness of the NSAMDA model. The results showed that the NSAMDA method achieves satisfactory performance on predicting miRNA-disease associations and is superior to the most advanced model.

GraphCDA: a hybrid graph representation learning framework based on GCN and GAT for predicting disease-associated circRNAs

MOTIVATION

CircularRNA (circRNA) is a class of noncoding RNA with high conservation and stability, which is considered as an important disease biomarker and drug target. Accumulating pieces of evidence have indicated that circRNA plays a crucial role in the pathogenesis and progression of many complex diseases. As the biological experiments are time-consuming and labor-intensive, developing an accurate computational prediction method has become indispensable to identify disease-related circRNAs.

RESULTS

We presented a hybrid graph representation learning framework, named GraphCDA, for predicting the potential circRNA-disease associations. Firstly, the circRNA-circRNA similarity network and disease-disease similarity network were constructed to characterize the relationships of circRNAs and diseases, respectively. Secondly, a hybrid graph embedding model combining Graph Convolutional Networks and Graph Attention Networks was introduced to learn the feature representations of circRNAs and diseases simultaneously. Finally, the learned representations were concatenated and employed to build the prediction model for identifying the circRNA-disease associations. A series of experimental results demonstrated that GraphCDA outperformed other state-of-the-art methods on several public databases. Moreover, GraphCDA could achieve good performance when only using a small number of known circRNA-disease associations as the training set. Besides, case studies conducted on several human diseases further confirmed the prediction capability of GraphCDA for predicting potential disease-related circRNAs. In conclusion, extensive experimental results indicated that GraphCDA could serve as a reliable tool for exploring the regulatory role of circRNAs in complex diseases.

Network Analyses Based on Machine Learning Methods to Quantify Effects of Peptide-Protein Complexes as Drug Targets Using Cinnamon in Cardiovascular Diseases and Metabolic Syndrome as a Case Study

Peptide-protein complexes play important roles in multiple diseases such as cardiovascular diseases (CVDs) and metabolic syndrome (MetS). The peptides may be the key molecules in the designing of inhibitors or drug targets. Many Chinese traditional drugs are shown to play various roles in different diseases, and comprehensive analyses should be performed using networks which could offer more information than results generated from a single level. In this study, a network analysis pipeline was designed based on machine learning methods to quantify the effects of peptide-protein complexes as drug targets. Three steps, namely, pathway filter, combined network construction, and biomarker prediction and validation based on peptides, were performed using cinnamon (CA) in CVDs and MetS as a case. Results showed that 17 peptide-protein complexes including six peptides and four proteins were identified as CA targets. The expressions of AKT1, AKT2, and ENOS were tested using qRT-PCR in a mouse model that was constructed. AKT2 was shown to be a CA-indicating biomarker, while E2F1 and ENOS were CA treatment targets. AKT1 was considered a diabetic responsive biomarker because it was down-regulated in diabetic but not related to CA. Taken together, the pipeline could identify new drug targets based on biological function analyses. This may provide a deep understanding of the drugs' roles in different diseases which may foster the development of peptide-protein complex-based therapeutic approaches.

Integration of pairwise neighbor topologies and miRNA family and cluster attributes for miRNA-disease association prediction

Identifying disease-related microRNAs (miRNAs) assists the understanding of disease pathogenesis. Existing research methods integrate multiple kinds of data related to miRNAs and diseases to infer candidate disease-related miRNAs. The attributes of miRNA nodes including their family and cluster belonging information, however, have not been deeply integrated. Besides, the learning of neighbor topology representation of a pair of miRNA and disease is a challenging issue. We present a disease-related miRNA prediction method by encoding and integrating multiple representations of miRNA and disease nodes learnt from the generative and adversarial perspective. We firstly construct a bilayer heterogeneous network of miRNA and disease nodes, and it contains multiple types of connections among these nodes, which reflect neighbor topology of miRNA-disease pairs, and the attributes of miRNA nodes, especially miRNA-related families and clusters. To learn enhanced pairwise neighbor topology, we propose a generative and adversarial model with a convolutional autoencoder-based generator to encode the low-dimensional topological representation of the miRNA-disease pair and multi-layer convolutional neural network-based discriminator to discriminate between the true and false neighbor topology embeddings. Besides, we design a novel feature category-level attention mechanism to learn the various importance of different features for final adaptive fusion and prediction. Comparison results with five miRNA-disease association methods demonstrated the superior performance of our model and technical contributions in terms of area under the receiver operating characteristic curve and area under the precision-recall curve. The results of recall rates confirmed that our model can find more actual miRNA-disease associations among top-ranked candidates. Case studies on three cancers further proved the ability to detect potential candidate miRNAs.

LRGCPND: Predicting Associations between ncRNA and Drug Resistance via Linear Residual Graph Convolution

Accurate inference of the relationship between non-coding RNAs (ncRNAs) and drug resistance is essential for understanding the complicated mechanisms of drug actions and clinical treatment. Traditional biological experiments are time-consuming, laborious, and minor in scale. Although several databases provide relevant resources, computational method for predicting this type of association has not yet been developed. In this paper, we leverage the verified association data of ncRNA and drug resistance to construct a bipartite graph and then develop a linear residual graph convolution approach for predicting associations between non-coding RNA and drug resistance (LRGCPND) without introducing or defining additional data. LRGCPND first aggregates the potential features of neighboring nodes per graph convolutional layer. Next, we transform the information between layers through a linear function. Eventually, LRGCPND unites the embedding representations of each layer to complete the prediction. Results of comparison experiments demonstrate that LRGCPND has more reliable performance than seven other state-of-the-art approaches with an average AUC value of 0.8987. Case studies illustrate that LRGCPND is an effective tool for inferring the associations between ncRNA and drug resistance.

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.