GCSENet: A GCN, CNN and SENet ensemble model for microRNA-disease association prediction

MGFmiRNAloc: Predicting miRNA Subcellular Localization Using Molecular Graph Feature and Convolutional Block Attention Module

MiRNA has distinct physiological functions at various cellular locations. However, few effective computational methods for predicting the subcellular location of miRNA exist, thereby leaving considerable room for improvement. Accordingly, our study proposes the MGFmiRNAloc simplified molecular input line entry system (SMILES) format as a new approach for predicting the subcellular localization of miRNA. Additionally, the graphical convolutional network (GCN) technique was employed to extract the atomic nodes and topological structure of a single base, thereby constructing RNA sequence molecular map features. Subsequently, the channel attention and spatial attention mechanisms (CBAM) were designed to mine deeper for more efficient information. Finally, the prediction module was used to detect the subcellular localization of miRNA. The 10-fold cross-validation and independent test set experiments demonstrate that MGFmiRNAloc outperforms the most sophisticated methods. The results indicate that the new atomic level feature representation proposed in this study could overcome the limitations of small samples and short miRNA sequences, accurately predict the subcellular localization of miRNAs, and be extended to the subcellular localization of other sequences.

MMFSyn: A Multimodal Deep Learning Model for Predicting Anticancer Synergistic Drug Combination Effect

Combination therapy aims to synergistically enhance efficacy or reduce toxic side effects and has widely been used in clinical practice. However, with the rapid increase in the types of drug combinations, identifying the synergistic relationships between drugs remains a highly challenging task. This paper proposes a novel deep learning model MMFSyn based on multimodal drug data combined with cell line features. Firstly, to ensure the full expression of drug molecular features, multiple modalities of drugs, including Morgan fingerprints, atom sequences, molecular diagrams, and atomic point cloud data, are extracted using SMILES. Secondly, for different modal data, a Bi-LSTM, gMLP, multi-head attention mechanism, and multi-scale GCNs are comprehensively applied to extract the drug feature. Then, it selects appropriate omics features from gene expression and mutation omics data of cancer cell lines to construct cancer cell line features. Finally, these features are combined to predict the synergistic anti-cancer drug combination effect. The experimental results verify that MMFSyn has significant advantages in performance compared to other popular methods, with a root mean square error of 13.33 and a Pearson correlation coefficient of 0.81, which indicates that MMFSyn can better capture the complex relationship between multimodal drug combinations and omics data, thereby improving the synergistic drug combination prediction.

Global-local aware Heterogeneous Graph Contrastive Learning for multifaceted association prediction in miRNA-gene-disease networks

Unraveling the intricate network of associations among microRNAs (miRNAs), genes, and diseases is pivotal for deciphering molecular mechanisms, refining disease diagnosis, and crafting targeted therapies. Computational strategies, leveraging link prediction within biological graphs, present a cost-efficient alternative to high-cost empirical assays. However, while plenty of methods excel at predicting specific associations, such as miRNA-disease associations (MDAs), miRNA-target interactions (MTIs), and disease-gene associations (DGAs), a holistic approach harnessing diverse data sources for multifaceted association prediction remains largely unexplored. The limited availability of high-quality data, as vitro experiments to comprehensively confirm associations are often expensive and time-consuming, results in a sparse and noisy heterogeneous graph, hindering an accurate prediction of these complex associations. To address this challenge, we propose a novel framework called Global-local aware Heterogeneous Graph Contrastive Learning (GlaHGCL). GlaHGCL combines global and local contrastive learning to improve node embeddings in the heterogeneous graph. In particular, global contrastive learning enhances the robustness of node embeddings against noise by aligning global representations of the original graph and its augmented counterpart. Local contrastive learning enforces representation consistency between functionally similar or connected nodes across diverse data sources, effectively leveraging data heterogeneity and mitigating the issue of data scarcity. The refined node representations are applied to downstream tasks, such as MDA, MTI, and DGA prediction. Experiments show GlaHGCL outperforming state-of-the-art methods, and case studies further demonstrate its ability to accurately uncover new associations among miRNAs, genes, and diseases. We have made the datasets and source code publicly available at https://github.com/Sue-syx/GlaHGCL.

Kernel Bayesian logistic tensor decomposition with automatic rank determination for predicting multiple types of miRNA-disease associations

Identifying the association and corresponding types of miRNAs and diseases is crucial for studying the molecular mechanisms of disease-related miRNAs. Compared to traditional biological experiments, computational models can not only save time and reduce costs, but also discover potential associations on a large scale. Although some computational models based on tensor decomposition have been proposed, these models usually require manual specification of numerous hyperparameters, leading to a decrease in computational efficiency and generalization ability. Additionally, these linear models struggle to analyze complex, higher-order nonlinear relationships. Based on this, we propose a novel framework, KBLTDARD, to identify potential multiple types of miRNA-disease associations. Firstly, KBLTDARD extracts information from biological networks and high-order association network, and then fuses them to obtain more precise similarities of miRNAs (diseases). Secondly, we combine logistic tensor decomposition and Bayesian methods to achieve automatic hyperparameter search by introducing sparse-induced priors of multiple latent variables, and incorporate auxiliary information to improve prediction capabilities. Finally, an efficient deterministic Bayesian inference algorithm is developed to ensure computational efficiency. Experimental results on two benchmark datasets show that KBLTDARD has better Top-1 precision, Top-1 recall, and Top-1 F1 for new type predictions, and higher AUPR, AUC, and F1 values for new triplet predictions, compared to other state-of-the-art methods. Furthermore, case studies demonstrate the efficiency of KBLTDARD in predicting multiple types of miRNA-disease associations.

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.

MHCLMDA: multihypergraph contrastive learning for miRNA-disease association prediction

The correct prediction of disease-associated miRNAs plays an essential role in disease prevention and treatment. Current computational methods to predict disease-associated miRNAs construct different miRNA views and disease views based on various miRNA properties and disease properties and then integrate the multiviews to predict the relationship between miRNAs and diseases. However, most existing methods ignore the information interaction among the views and the consistency of miRNA features (disease features) across multiple views. This study proposes a computational method based on multiple hypergraph contrastive learning (MHCLMDA) to predict miRNA-disease associations. MHCLMDA first constructs multiple miRNA hypergraphs and disease hypergraphs based on various miRNA similarities and disease similarities and performs hypergraph convolution on each hypergraph to capture higher order interactions between nodes, followed by hypergraph contrastive learning to learn the consistent miRNA feature representation and disease feature representation under different views. Then, a variational auto-encoder is employed to extract the miRNA and disease features in known miRNA-disease association relationships. Finally, MHCLMDA fuses the miRNA and disease features from different views to predict miRNA-disease associations. The parameters of the model are optimized in an end-to-end way. We applied MHCLMDA to the prediction of human miRNA-disease association. The experimental results show that our method performs better than several other state-of-the-art methods in terms of the area under the receiver operating characteristic curve and the area under the precision-recall curve.

Drug Repositioning Based on the Enhanced Message Passing and Hypergraph Convolutional Networks

Drug repositioning, an important method of drug development, is utilized to discover investigational drugs beyond the originally approved indications, expand the application scope of drugs, and reduce the cost of drug development. With the emergence of increasingly drug-disease-related biological networks, the challenge still remains to effectively fuse biological entity data and accurately achieve drug-disease repositioning. This paper proposes a new drug repositioning method named EMPHCN based on enhanced message passing and hypergraph convolutional networks (HGCN). It firstly constructs the homogeneous multi-view information with multiple drug similarity features and then extracts the intra-domain embedding of drugs through the combination of HGCN and channel attention mechanism. Secondly, inter-domain information of known drug-disease associations is extracted by graph convolutional networks combining node and edge embedding (NEEGCN), and a heterogeneous network composed of drugs, proteins and diseases is built as an important auxiliary to enhance the inter-domain message passing of drugs and diseases. Besides, the intra-domain embedding of diseases is also extracted through HGCN. Ultimately, intra-domain and inter-domain embeddings of drugs and diseases are integrated as the final embedding for calculating the drug-disease correlation matrix. Through 10-fold cross-validation on some benchmark datasets, we find that the AUPR of EMPHCN reaches 0.593 (T1) and 0.526 (T2), respectively, and the AUC achieves 0.887 (T1) and 0.961 (T2) respectively, which shows that EMPHCN has an advantage over other state-of-the-art prediction methods. Concerning the new disease association prediction, the AUC of EMPHCN through the five-fold cross-validation reaches 0.806 (T1) and 0.845 (T2), which are 4.3% (T1) and 4.0% (T2) higher than the second best existing methods, respectively. In the case study, EMPHCN also achieves satisfactory results in real drug repositioning for breast carcinoma and Parkinson's disease.

MuCoMiD: A Multitask Graph Convolutional Learning Framework for miRNA-Disease Association Prediction

Growing evidence from recent studies implies that microRNAs or miRNAs could serve as biomarkers in various complex human diseases. Since wet-lab experiments for detecting miRNAs associated with a disease are expensive and time-consuming, machine learning techniques for miRNA-disease association prediction have attracted much attention in recent years. A big challenge in building reliable machine learning models is that of data scarcity. In particular, existing approaches trained on the available small datasets, even when combined with precalculated handcrafted input features, often suffer from bad generalization and data leakage problems. We overcome the limitations of existing works by proposing a novel multitask graph convolution-based approach, which we refer to as MuCoMiD. MuCoMiD allows automatic feature extraction while incorporating knowledge from five heterogeneous biological information sources (associations between miRNAs/diseases and protein-coding genes (PCGs), interactions between protein-coding genes, miRNA family information, and disease ontology) in a multitask setting which is a novel perspective and has not been studied before. To effectively test the generalization capability of our model, we conduct large-scale experiments on the standard benchmark datasets as well as on our proposed large independent testing sets and case studies. MuCoMiD obtains significantly higher Average Precision (AP) scores than all benchmarked models on three large independent testing sets, especially those with many new miRNAs, as well as in the detection of false positives. Thanks to its capability of learning directly from raw input information, MuCoMiD is easier to maintain and update than handcrafted feature-based methods, which would require recomputation of features every time there is a change in the original information sources (e.g., disease ontology, miRNA/disease-PCG associations, etc.). We share our code for reproducibility and future research at https://git.l3s.uni-hannover.de/dong/cmtt.

A Predictive Model for Abnormal Bone Density in Male Underground Coal Mine Workers

The dark and humid environment of underground coal mines had a detrimental effect on workers’ skeletal health. Optimal risk prediction models can protect the skeletal health of coal miners by identifying those at risk of abnormal bone density as early as possible. A total of 3695 male underground workers who attended occupational health physical examination in a coal mine in Hebei, China, from July to August 2018 were included in this study. The predictor variables were identified through single-factor analysis and literature review. Three prediction models, Logistic Regression, CNN and XG Boost, were developed to evaluate the prediction performance. The training set results showed that the sensitivity of Logistic Regression, XG Boost and CNN models was 74.687, 82.058, 70.620, the specificity was 80.986, 89.448, 91.866, the F1 scores was 0.618, 0.919, 0.740, the Brier scores was 0.153, 0.040, 0.156, and the Calibration-in-the-large was 0.104, 0.020, 0.076, respectively, XG Boost outperformed the other two models. Similar results were obtained for the test set and validation set. A two-by-two comparison of the area under the ROC curve (AUC) of the three models showed that the XG Boost model had the best prediction performance. The XG Boost model had a high application value and outperformed the CNN and Logistic regression models in prediction.

Predicting miRNA-disease associations based on graph attention network with multi-source information

BACKGROUND

There is a growing body of evidence from biological experiments suggesting that microRNAs (miRNAs) play a significant regulatory role in both diverse cellular activities and pathological processes. Exploring miRNA-disease associations not only can decipher pathogenic mechanisms but also provide treatment solutions for diseases. As it is inefficient to identify undiscovered relationships between diseases and miRNAs using biotechnology, an explosion of computational methods have been advanced. However, the prediction accuracy of existing models is hampered by the sparsity of known association network and single-category feature, which is hard to model the complicated relationships between diseases and miRNAs.

RESULTS

In this study, we advance a new computational framework (GATMDA) to discover unknown miRNA-disease associations based on graph attention network with multi-source information, which effectively fuses linear and non-linear features. In our method, the linear features of diseases and miRNAs are constructed by disease-lncRNA correlation profiles and miRNA-lncRNA correlation profiles, respectively. Then, the graph attention network is employed to extract the non-linear features of diseases and miRNAs by aggregating information of each neighbor with different weights. Finally, the random forest algorithm is applied to infer the disease-miRNA correlation pairs through fusing linear and non-linear features of diseases and miRNAs. As a result, GATMDA achieves impressive performance: an average AUC of 0.9566 with five-fold cross validation, which is superior to other previous models. In addition, case studies conducted on breast cancer, colon cancer and lymphoma indicate that 50, 50 and 48 out of the top fifty prioritized candidates are verified by biological experiments.

CONCLUSIONS

The extensive experimental results justify the accuracy and utility of GATMDA and we could anticipate that it may regard as a utility tool for identifying unobserved disease-miRNA relationships.