scholarly journals GraphMS: Drug Target Prediction Using Graph Representation Learning with Substructures

2021 ◽  
Vol 11 (7) ◽  
pp. 3239
Author(s):  
Shicheng Cheng ◽  
Liang Zhang ◽  
Bo Jin ◽  
Qiang Zhang ◽  
Xinjiang Lu ◽  
...  
Keyword(s):  
Mutual Information ◽  
Link Prediction ◽  
Drug Target ◽  
State Of The Art ◽  
Target Prediction ◽  
Representation Learning ◽  
Graph Representation ◽  
Operating Characteristics ◽  
Information Index ◽  
Drug Target Prediction

The prediction of drug–target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug–target interactions are either mediocre or rely heavily on data stacking. In this work, we proposed our model named GraphMS. We merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end–to–end auto–encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state–of–the–art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.847. We found that the mutual information between the substructure and graph–level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node–level and graph–level representations contributes most in a relatively dense network.

scholarly journals Drug Target Prediction Using Graph Representation Learning via Substructures Contrast

2021 ◽  
Author(s):  
Shicheng Cheng ◽  
Liang Zhang ◽  
Bo Jin ◽  
Qiang Zhang ◽  
Xinjiang Lu
Keyword(s):  
Mutual Information ◽  
Link Prediction ◽  
Drug Target ◽  
Target Prediction ◽  
Representation Learning ◽  
Graph Representation ◽  
Operating Characteristics ◽  
Information Index ◽  
Drug Target Prediction ◽  
Recall Curve

The prediction of drug--target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug--target interactions are either mediocre or rely heavily on data stacking. In this work, we merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end--to--end auto--encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state--of--art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.848. We found that the mutual information between the substructure and graph--level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node--level and graph--level representations contributes most in a relatively dense network.

scholarly journals Large-scale comparison of machine learning methods for drug target prediction on ChEMBL

2018 ◽  
Vol 9 (24) ◽  
pp. 5441-5451 ◽  
Author(s):  
Andreas Mayr ◽  
Günter Klambauer ◽  
Thomas Unterthiner ◽  
Marvin Steijaert ◽  
Jörg K. Wegner ◽  
...  
Keyword(s):  
Machine Learning ◽  
Deep Learning ◽  
Comparative Study ◽  
Drug Target ◽  
Large Scale ◽  
State Of The Art ◽  
Target Prediction ◽  
Prediction Methods ◽  
Machine Learning Methods ◽  
Drug Target Prediction

The to date largest comparative study of nine state-of-the-art drug target prediction methods finds that deep learning outperforms all other competitors. The results are based on a benchmark of 1300 assays and half a million compounds.

scholarly journals A Novel Method to Predict Drug-Target Interactions Based on Large-Scale Graph Representation Learning

Cancers ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 2111
Author(s):  
Bo-Wei Zhao ◽  
Zhu-Hong You ◽  
Lun Hu ◽  
Zhen-Hao Guo ◽  
Lei Wang ◽  
...  
Keyword(s):  
Drug Target ◽  
Large Scale ◽  
Computational Models ◽  
Structural Information ◽  
Characteristic Curve ◽  
Representation Learning ◽  
Graph Representation ◽  
Convolutional Network ◽  
Novel Method

Identification of drug-target interactions (DTIs) is a significant step in the drug discovery or repositioning process. Compared with the time-consuming and labor-intensive in vivo experimental methods, the computational models can provide high-quality DTI candidates in an instant. In this study, we propose a novel method called LGDTI to predict DTIs based on large-scale graph representation learning. LGDTI can capture the local and global structural information of the graph. Specifically, the first-order neighbor information of nodes can be aggregated by the graph convolutional network (GCN); on the other hand, the high-order neighbor information of nodes can be learned by the graph embedding method called DeepWalk. Finally, the two kinds of feature are fed into the random forest classifier to train and predict potential DTIs. The results show that our method obtained area under the receiver operating characteristic curve (AUROC) of 0.9455 and area under the precision-recall curve (AUPR) of 0.9491 under 5-fold cross-validation. Moreover, we compare the presented method with some existing state-of-the-art methods. These results imply that LGDTI can efficiently and robustly capture undiscovered DTIs. Moreover, the proposed model is expected to bring new inspiration and provide novel perspectives to relevant researchers.

Drug–target prediction utilizing heterogeneous bio-linked network embeddings

2019 ◽  
Author(s):  
Nansu Zong ◽  
Rachael Sze Nga Wong ◽  
Yue Yu ◽  
Andrew Wen ◽  
Ming Huang ◽  
...  
Keyword(s):  
Drug Target ◽  
Target Prediction ◽  
Machine Learning Algorithms ◽  
Association Mining ◽  
Drug Target Prediction ◽  
Specific Prediction ◽  
Series Of Experiments ◽  
Inference Methods ◽  
Novel Drug ◽  
Prediction Strategy

Abstract To enable modularization for network-based prediction, we conducted a review of known methods conducting the various subtasks corresponding to the creation of a drug–target prediction framework and associated benchmarking to determine the highest-performing approaches. Accordingly, our contributions are as follows: (i) from a network perspective, we benchmarked the association-mining performance of 32 distinct subnetwork permutations, arranging based on a comprehensive heterogeneous biomedical network derived from 12 repositories; (ii) from a methodological perspective, we identified the best prediction strategy based on a review of combinations of the components with off-the-shelf classification, inference methods and graph embedding methods. Our benchmarking strategy consisted of two series of experiments, totaling six distinct tasks from the two perspectives, to determine the best prediction. We demonstrated that the proposed method outperformed the existing network-based methods as well as how combinatorial networks and methodologies can influence the prediction. In addition, we conducted disease-specific prediction tasks for 20 distinct diseases and showed the reliability of the strategy in predicting 75 novel drug–target associations as shown by a validation utilizing DrugBank 5.1.0. In particular, we revealed a connection of the network topology with the biological explanations for predicting the diseases, ‘Asthma’ ‘Hypertension’, and ‘Dementia’. The results of our benchmarking produced knowledge on a network-based prediction framework with the modularization of the feature selection and association prediction, which can be easily adapted and extended to other feature sources or machine learning algorithms as well as a performed baseline to comprehensively evaluate the utility of incorporating varying data sources.

scholarly journals Drug Target Prediction Based on the Herbs Components: The Study on the Multitargets Pharmacological Mechanism of Qishenkeli Acting on the Coronary Heart Disease

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Yong Wang ◽  
Zhongyang Liu ◽  
Chun Li ◽  
Dong Li ◽  
Yulin Ouyang ◽  
...  
Keyword(s):  
Coronary Heart Disease ◽  
Heart Disease ◽  
Angiotensin Ii ◽  
Drug Target ◽  
Drug Targets ◽  
Target Prediction ◽  
Coronary Artery Ligation ◽  
Potential Drug ◽  
Drug Target Prediction ◽  
Potential Drug Targets

In this paper, we present a case study of Qishenkeli (QSKL) to research TCM’s underlying molecular mechanism, based on drug target prediction and analyses of TCM chemical components and following experimental validation. First, after determining the compositive compounds of QSKL, we use drugCIPHER-CS to predict their potential drug targets. These potential targets are significantly enriched with known cardiovascular disease-related drug targets. Then we find these potential drug targets are significantly enriched in the biological processes of neuroactive ligand-receptor interaction, aminoacyl-tRNA biosynthesis, calcium signaling pathway, glycine, serine and threonine metabolism, and renin-angiotensin system (RAAS), and so on. Then, animal model of coronary heart disease (CHD) induced by left anterior descending coronary artery ligation is applied to validate predicted pathway. RAAS pathway is selected as an example, and the results show that QSKL has effect on both rennin and angiotensin II receptor (AT1R), which eventually down regulates the angiotensin II (AngII). Bioinformatics combing with experiment verification can provide a credible and objective method to understand the complicated multitargets mechanism for Chinese herbal formula.

scholarly journals Hierarchical and Unsupervised Graph Representation Learning with Loukas’s Coarsening

Algorithms ◽  
2020 ◽  
Vol 13 (9) ◽  
pp. 206
Author(s):  
Louis Béthune ◽  
Yacouba Kaloga ◽  
Pierre Borgnat ◽  
Aurélien Garivier ◽  
Amaury Habrard
Keyword(s):  
State Of The Art ◽  
Back Propagation ◽  
Representation Learning ◽  
Graph Representation ◽  
High Quality ◽  
Attributed Graphs ◽  
Information Maximization ◽  
Classification Tasks ◽  
Micro Structures ◽  
Mutual Information Maximization

We propose a novel algorithm for unsupervised graph representation learning with attributed graphs. It combines three advantages addressing some current limitations of the literature: (i) The model is inductive: it can embed new graphs without re-training in the presence of new data; (ii) The method takes into account both micro-structures and macro-structures by looking at the attributed graphs at different scales; (iii) The model is end-to-end differentiable: it is a building block that can be plugged into deep learning pipelines and allows for back-propagation. We show that combining a coarsening method having strong theoretical guarantees with mutual information maximization suffices to produce high quality embeddings. We evaluate them on classification tasks with common benchmarks of the literature. We show that our algorithm is competitive with state of the art among unsupervised graph representation learning methods.

Sign in / Sign up

Export Citation Format

Share Document