DDR: efficient computational method to predict drug-target interactions using graph mining and machine learning approaches

DTGHAT: multi-molecule heterogeneous graph transformer based on multi-molecule graph for drug-target identification

Introduction

Drug target identification is a fundamental step in drug discovery and plays a pivotal role in new therapies development. Existing computational methods focus on the direct interactions between drugs and targets, often ignoring the complex interrelationships between drugs, targets and various biomolecules in the human system.

Method

To address this limitation, we propose a novel prediction model named DTGHAT (Drug and Target Association Prediction using Heterogeneous Graph Attention Transformer based on Molecular Heterogeneous). DTGHAT utilizes a graph attention transformer to identify novel targets from 15 heterogeneous drug-gene-disease networks characterized by chemical, genomic, phenotypic, and cellular networks.

Result

In a 5-fold cross-validation study, DTGHAT achieved an area under the receiver operating characteristic curve (AUC) of 0.9634, which is at least 4% higher than current state-of-the-art methods. Characterization ablation experiments highlight the importance of integrating biomolecular data from multiple sources in revealing drug-target interactions. In addition, a case study on cancer drugs further validates DTGHAT's effectiveness in predicting novel drug target identification. DTGHAT is free and available at: https://github.com/stella-007/DTGHAT.git.

KGRDR: a deep learning model based on knowledge graph and graph regularized integration for drug repositioning

Computational drug repositioning, serving as an effective alternative to traditional drug discovery plays a key role in optimizing drug development. This approach can accelerate the development of new therapeutic options while reducing costs and mitigating risks. In this study, we propose a novel deep learning-based framework KGRDR containing multi-similarity integration and knowledge graph learning to predict potential drug-disease interactions. Specifically, a graph regularized approach is applied to integrate multiple drug and disease similarity information, which can effectively eliminate noise data and obtain integrated similarity features of drugs and diseases. Then, topological feature representations of drugs and diseases are learned from constructed biomedical knowledge graphs (KGs) which encompasses known drug-related and disease-related interactions. Next, the similarity features and topological features are fused by utilizing an attention-based feature fusion method. Finally, drug-disease associations are predicted using the graph convolutional network. Experimental results demonstrate that KGRDR achieves better performance when compared with the state-of-the-art drug-disease prediction methods. Moreover, case study results further validate the effectiveness of KGRDR in predicting novel drug-disease interactions.

Improving drug repositioning with negative data labeling using large language models

INTRODUCTION

Drug repositioning offers numerous advantages, such as faster development timelines, reduced costs, and lower failure rates in drug development. Supervised machine learning is commonly used to score drug candidates but is hindered by the lack of reliable negative data-drugs that fail due to inefficacy or toxicity- which is difficult to access, lowering their prediction accuracy and generalization. Positive-Unlabeled (PU) learning has been used to overcome this issue by either randomly sampling unlabeled drugs or identifying probable negatives but still suffers from misclassification or oversimplified decision boundaries.

RESULTS

We proposed a novel strategy using Large Language Models (GPT-4) to analyze all clinical trials on prostate cancer and systematically identify true negatives. This approach showed remarkable improvement in predictive accuracy on independent test sets with a Matthews Correlation Coefficient of 0.76 (± 0.33) compared to 0.55 (± 0.15) and 0.48 (± 0.18) for two commonly used PU learning approaches. Using our labeling strategy, we created a training set of 26 positive and 54 experimentally validated negative drugs. We then applied a machine learning ensemble to this new dataset to assess the repurposing potential of the remaining 11,043 drugs in the DrugBank database. This analysis identified 980 potential candidates for prostate cancer. A detailed review of the top 30 revealed 9 promising drugs targeting various mechanisms such as genomic instability, p53 regulation, or TMPRSS2-ERG fusion.

CONCLUSION

By expanding our negative data labeling approach to all diseases within the ClinicalTrials.gov database, our method could greatly advance supervised drug repositioning, offering a more accurate and data-driven path for discovering new treatments.

Label Transfer for Drug Disease Association in Three Meta-Paths

The identification of potential interactions and relationships between diseases and drugs is significant in public health care and drug discovery. As we all know, experimenting to determine the drug-disease interactions is very expensive in both time and money. However, there are still many drug-disease associations that are still undiscovered and potential. Therefore, the development of computational methods to explore the relationship between drugs and diseases is very important and essential. Many computational methods for predicting drug-disease associations have been developed based on known interactions to learn potential interactions of unknown drug-disease pairs. In this paper, we propose 3 new main groups of meta-paths based on the heterogeneous biological network of drug-protein-disease objects. For each meta-path, we design a machine learning model, then an integrated learning method is formed by these models. We evaluated our approach on 3 standard datasets which are DrugBank, OMIM, and Gottlieb's dataset. Experimental results demonstrate that the proposed method is better than some recent methods such as EMP-SVD, LRSSL, MBiRW, MPG-DDA, SCMFDD,. . . in some measures such as AUC, AUPR, and F1-score.

GSRF-DTI: a framework for drug-target interaction prediction based on a drug-target pair network and representation learning on a large graph

BACKGROUND

Identification of potential drug-target interactions (DTIs) with high accuracy is a key step in drug discovery and repositioning, especially concerning specific drug targets. Traditional experimental methods for identifying the DTIs are arduous, time-intensive, and financially burdensome. In addition, robust computational methods have been developed for predicting the DTIs and are widely applied in drug discovery research. However, advancing more precise algorithms for predicting DTIs is essential to meet the stringent standards demanded by drug discovery.

RESULTS

We proposed a novel method called GSRF-DTI, which integrates networks with a deep learning algorithm to identify DTIs. Firstly, GSRF-DTI learned the embedding representation of drugs and targets by integrating multiple drug association information and target association information, respectively. Then, GSRF-DTI considered the influence of drug-target pair (DTP) association on DTI prediction to construct a drug-target pair network (DTP-NET). Next, we utilized GraphSAGE on DTP-NET to learn the potential features of the network and applied random forest (RF) to predict the DTIs. Furthermore, we conducted ablation experiments to validate the necessity of integrating different types of network features for identifying DTIs. It is worth noting that GSRF-DTI proposed three novel DTIs.

CONCLUSIONS

GSRF-DTI not only considered the influence of the interaction relationship between drug and target but also considered the impact of DTP association relationship on DTI prediction. We initially use GraphSAGE to aggregate the neighbor information of nodes for better identification. Experimental analysis on Luo's dataset and the newly constructed dataset revealed that the GSRF-DTI framework outperformed several state-of-the-art methods significantly.

Drug-target interaction prediction using knowledge graph embedding

The prediction of drug-target interactions (DTIs) is a critical phase in the sustainable drug development process, especially when the research focus is to capitalize on the repositioning of existing drugs. Computational approaches to predicting DTIs can provide important insights into drug mechanisms of action. However, current methods for predicting DTIs based on the structural information of the knowledge graph may suffer from the sparseness and incompleteness of the knowledge graph and neglect the latent type information of the knowledge graph. In this paper, we propose TTModel, a knowledge graph embedding model for DTI prediction. By exploiting biomedical text and type information, TTModel can learn latent text semantics and type information to improve the performance of representation learning. Comprehensive experiments on two public datasets demonstrate that our model outperforms the state-of-the-art methods significantly on the task of DTI prediction.

Prediction of Drug–Target Interaction Using Dual-Network Integrated Logistic Matrix Factorization and Knowledge Graph Embedding

Nowadays, drug–target interactions (DTIs) prediction is a fundamental part of drug repositioning. However, on the one hand, drug–target interactions prediction models usually consider drugs or targets information, which ignore prior knowledge between drugs and targets. On the other hand, models incorporating priori knowledge cannot make interactions prediction for under-studied drugs and targets. Hence, this article proposes a novel dual-network integrated logistic matrix factorization DTIs prediction scheme (Ro-DNILMF) via a knowledge graph embedding approach. This model adds prior knowledge as input data into the prediction model and inherits the advantages of the DNILMF model, which can predict under-studied drug–target interactions. Firstly, a knowledge graph embedding model based on relational rotation (RotatE) is trained to construct the interaction adjacency matrix and integrate prior knowledge. Secondly, a dual-network integrated logistic matrix factorization prediction model (DNILMF) is used to predict new drugs and targets. Finally, several experiments conducted on the public datasets are used to demonstrate that the proposed method outperforms the single base-line model and some mainstream methods on efficiency.

A brief review of protein-ligand interaction prediction

The task of identifying protein–ligand interactions (PLIs) plays a prominent role in the field of drug discovery. However, it is infeasible to identify potential PLIs via costly and laborious in vitro experiments. There is a need to develop PLI computational prediction approaches to speed up the drug discovery process. In this review, we summarize a brief introduction to various computation-based PLIs. We discuss these approaches, in particular, machine learning-based methods, with illustrations of different emphases based on mainstream trends. Moreover, we analyzed three research dynamics that can be further explored in future studies.

Development of simultaneous interaction prediction approach (SiPA) for the expansion of interaction network of traditional Chinese medicine

Background

Due to the lack of enough interaction data among compositions, targets and diseases, it is difficult to construct a complete network of Traditional Chinese Medicine (TCM) that comprehensively reflects active compositions and their synergistic network in terms of specific diseases. Therefore, mapping of the full spectrum of interaction between compounds and their targets is of central importance when we use network pharmacology approach to explore the therapeutic potential of the TCM.

Methods

To address this challenge, we developed a large-scale simultaneous interaction prediction approach (SiPA) integrated one interaction network based simple inference model (SIM), focusing on ‘logical relevance’ between compounds, proteins or diseases, and another compound-target correlation space based interaction prediction model (CTCS-IPM) that was built on the basis of the canonical correlation analysis (CCA) to estimate the position of compounds (or targets) in compound-protein correlated space. Then SiPA was applied to discover reliable multiple interactions for interaction network expansion of a TCM, compound Salvia miltiorrhiza. By means of network analysis, potential active compounds and their related network synergy underlying cardiovascular diseases were evaluated between expanded and original interaction networks. Part of new interactions were validated with existing experimental evidence and molecular docking.

Results

As evaluated with known test dataset, the established combination approach was proved to make highly accurate prediction, showing a well prediction performance for the SIM and a high recall rate of 85.2% for the CTCS-IPM. Then 710 pairs of new compound-target interactions, 24 pairs of new compound-cardiovascular disease interactions and 294 pairs of new cardiovascular disease-protein interactions were predicted for compound Salvia miltiorrhiza. Results of network analysis suggested the network expansion could dramatically improve the completeness and effectiveness of the network. Validation results of literature and molecular docking manifested that inferred interactions had good reliability.

Conclusions

We provided a practical and efficient way for large-scale inference of multiple interactions of TCM ingredients, which was not limited by the lack of negative samples, sample size and target 3D structures. SiPA could help researchers more accurately prioritize the effective compounds and more completely explore network synergy of TCM for treating specific diseases, indicating a potential way for effectively identifying candidate compound (or target) in drug discovery.

Predicting The Effects of Chemical-Protein Interactions On Proteins Using Tensor Factorisation

Understanding the different effects of chemical substances on human proteins is fundamental for designing new drugs. It is also important for elucidating the different mechanisms of action of drugs that can cause side-effects. In this context, computational methods for predicting chemical-protein interactions can provide valuable insights on the relation between therapeutic chemical substances and proteins. Their predictions therefore can help in multiple tasks such as drug repurposing, identifying new drug side-effects, etc. Despite their useful predictions, these methods are unable to predict the different implications - such as change in protein expression, abundance, etc, - of chemical - protein interactions. Therefore, In this work, we study the modelling of chemical-protein interactions' effects on proteins activity using computational approaches. We hereby propose using 3D tensors to model chemicals, their target proteins and the effects associated to their interactions. We then use multi-part embedding tensor factorisation to predict the different effects of chemicals on human proteins. We assess the predictive accuracy of our proposed method using a benchmark dataset that we built. We then show by computational experimental evaluation that our approach outperforms other tensor factorisation methods in the task of predicting effects of chemicals on human proteins.

Predicting Polypharmacy Side-effects Using Knowledge Graph Embeddings

Polypharmacy is the use of drug combinations and is commonly used for treating complex and terminal diseases. Despite its effectiveness in many cases, it poses high risks of adverse side effects. Polypharmacy side-effects occur due to unwanted interactions of combined drugs, and they can cause severe complications to patients which results in increasing the risks of morbidity and leading to new mortalities. The use of drug polypharmacy is currently in its early stages; thus, the knowledge of their probable side-effects is limited. This encouraged multiple works to investigate machine learning techniques to efficiently and reliably predict adverse effects of drug combinations. In this context, the Decagon model is known to provide state-of-the-art results. It models polypharmacy side-effect data as a knowledge graph and formulates finding possible adverse effects as a link prediction task over the knowledge graph. The link prediction is solved using an embedding model based on graph convolutions. Despite its effectiveness, the Decagon approach still suffers from a high rate of false positives. In this work, we propose a new knowledge graph embedding technique that uses multi-part embedding vectors to predict polypharmacy side-effects. Like in the Decagon model, we model polypharmacy side effects as a knowledge graph. However, we perform the link prediction task using an approach based on tensor decomposition. Our experimental evaluation shows that our approach outperforms the Decagon model with 12% and 16% margins in terms of the area under the ROC and precision recall curves, respectively.

Dipeptide Frequency of Word Frequency and Graph Convolutional Networks for DTA Prediction

Deep learning is an effective method to capture drug-target binding affinity, but low accuracy is still an obstacle to be overcome. Thus, we propose a novel predictor for drug-target binding affinity based on dipeptide frequency of word frequency encoding and a hybrid graph convolutional network. Word frequency characteristics of natural language are used to improve the frequency characteristics of peptides to express target proteins. For each drug molecules, the five different features of drug atoms and the atomic bond relationships are expressed as graphs. The obtained protein features and graph structure are used as the input of convolution neural network and the input of graph convolution neural network, respectively. A prediction model is established to predict the drug affinity by calculating the hidden relationship. In the KIBA data set test experiment, the consistency coefficient of the model is 0.901, which is 0.01 higher than the existing model, and the MSE (mean square error) of the model is 0.126, which is 5% lower than the existing model. In Davis data set test experiment, the consistency coefficient of the model is 0.895, which is 0.006 higher than the existing model, and the MSE of the model is 0.220, which is 4% lower than the existing model. These results show that our proposed method can not only predict the affinity better than those existing models, but also outperform unitary deep learning approaches.

Comparison Study of Computational Prediction Tools for Drug-Target Binding Affinities

The drug development is generally arduous, costly, and success rates are low. Thus, the identification of drug-target interactions (DTIs) has become a crucial step in early stages of drug discovery. Consequently, developing computational approaches capable of identifying potential DTIs with minimum error rate are increasingly being pursued. These computational approaches aim to narrow down the search space for novel DTIs and shed light on drug functioning context. Most methods developed to date use binary classification to predict if the interaction between a drug and its target exists or not. However, it is more informative but also more challenging to predict the strength of the binding between a drug and its target. If that strength is not sufficiently strong, such DTI may not be useful. Therefore, the methods developed to predict drug-target binding affinities (DTBA) are of great value. In this study, we provide a comprehensive overview of the existing methods that predict DTBA. We focus on the methods developed using artificial intelligence (AI), machine learning (ML), and deep learning (DL) approaches, as well as related benchmark datasets and databases. Furthermore, guidance and recommendations are provided that cover the gaps and directions of the upcoming work in this research area. To the best of our knowledge, this is the first comprehensive comparison analysis of tools focused on DTBA with reference to AI/ML/DL.