Communicative Subgraph Representation Learning for Multi-Relational Inductive Drug-Gene Interaction Prediction

• URL: http://arxiv.org/abs/2205.05957v1
• Date: Thu, 12 May 2022 08:53:45 GMT
• Title: Communicative Subgraph Representation Learning for Multi-Relational Inductive Drug-Gene Interaction Prediction
• Authors: Jiahua Rao, Shuangjia Zheng, Sijie Mai, and Yuedong Yang
• Abstract summary: We propose a novel Communicative Subgraph representation learning for Multi-relational Inductive drug-Gene interactions prediction (CoSMIG) The model strengthened the relations on the drug-gene graph through a communicative message passing mechanism. Our method outperformed state-of-the-art baselines in the transductive scenarios and achieved superior performance in the inductive ones.
• Score: 17.478102754113294
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Illuminating the interconnections between drugs and genes is an important topic in drug development and precision medicine. Currently, computational predictions of drug-gene interactions mainly focus on the binding interactions without considering other relation types like agonist, antagonist, etc. In addition, existing methods either heavily rely on high-quality domain features or are intrinsically transductive, which limits the capacity of models to generalize to drugs/genes that lack external information or are unseen during the training process. To address these problems, we propose a novel Communicative Subgraph representation learning for Multi-relational Inductive drug-Gene interactions prediction (CoSMIG), where the predictions of drug-gene relations are made through subgraph patterns, and thus are naturally inductive for unseen drugs/genes without retraining or utilizing external domain features. Moreover, the model strengthened the relations on the drug-gene graph through a communicative message passing mechanism. To evaluate our method, we compiled two new benchmark datasets from DrugBank and DGIdb. The comprehensive experiments on the two datasets showed that our method outperformed state-of-the-art baselines in the transductive scenarios and achieved superior performance in the inductive ones. Further experimental analysis including LINCS experimental validation and literature verification also demonstrated the value of our model.

Related papers

• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• PGraphDTA: Improving Drug Target Interaction Prediction using Protein Language Models and Contact Maps [4.590060921188914]
  Key aspect of drug discovery involves identifying novel drug-target (DT) interactions. Protein-ligand interactions exhibit a continuum of binding strengths, known as binding affinity. We propose novel enhancements to enhance their performance.
  arXiv  Detail & Related papers  (2023-10-06T05:00:25Z)
• Message Intercommunication for Inductive Relation Reasoning [49.731293143079455]
  We develop a novel inductive relation reasoning model called MINES. We introduce a Message Intercommunication mechanism on the Neighbor-Enhanced Subgraph. Our experiments show that MINES outperforms existing state-of-the-art models.
  arXiv  Detail & Related papers  (2023-05-23T13:51:46Z)
• Drug Synergistic Combinations Predictions via Large-Scale Pre-Training and Graph Structure Learning [82.93806087715507]
  Drug combination therapy is a well-established strategy for disease treatment with better effectiveness and less safety degradation. Deep learning models have emerged as an efficient way to discover synergistic combinations. Our framework achieves state-of-the-art results in comparison with other deep learning-based methods.
  arXiv  Detail & Related papers  (2023-01-14T15:07:43Z)
• Integrating Heterogeneous Domain Information into Relation Extraction: A Case Study on Drug-Drug Interaction Extraction [1.0152838128195465]
  This thesis works on Drug-Drug Interactions (DDIs) from the literature as a case study. A deep neural relation extraction model is prepared and its attention mechanism is analyzed. In order to further exploit the heterogeneous information, drug-related items, such as protein entries, medical terms and pathways are collected.
  arXiv  Detail & Related papers  (2022-12-21T01:26:07Z)
• Hierarchical Graph Representation Learning for the Prediction of Drug-Target Binding Affinity [7.023929372010717]
  We propose a novel hierarchical graph representation learning model for the drug-target binding affinity prediction, namely HGRL-DTA. In this paper, we adopt a message broadcasting mechanism to integrate the hierarchical representations learned from the global-level affinity graph and the local-level molecular graph. Besides, we design a similarity-based embedding map to solve the cold start problem of inferring representations for unseen drugs and targets.
  arXiv  Detail & Related papers  (2022-03-22T04:50:16Z)
• Improved Drug-target Interaction Prediction with Intermolecular Graph Transformer [98.8319016075089]
  We propose a novel approach to model intermolecular information with a three-way Transformer-based architecture. Intermolecular Graph Transformer (IGT) outperforms state-of-the-art approaches by 9.1% and 20.5% over the second best for binding activity and binding pose prediction respectively. IGT exhibits promising drug screening ability against SARS-CoV-2 by identifying 83.1% active drugs that have been validated by wet-lab experiments with near-native predicted binding poses.
  arXiv  Detail & Related papers  (2021-10-14T13:28:02Z)
• Predicting Drug-Drug Interactions from Heterogeneous Data: An Embedding Approach [20.87835183671462]
  We present the first work that uses multiple data sources such as drug structure images, drug structure string representation and relational representation of drug relationships as the input. Our empirical evaluation against several state-of-the-art methods using standalone different data types for drugs clearly demonstrate the efficacy of combining heterogeneous data in predicting DDIs.
  arXiv  Detail & Related papers  (2021-03-19T17:25:48Z)
• Ensemble Transfer Learning for the Prediction of Anti-Cancer Drug Response [49.86828302591469]
  In this paper, we apply transfer learning to the prediction of anti-cancer drug response. We apply the classic transfer learning framework that trains a prediction model on the source dataset and refines it on the target dataset. The ensemble transfer learning pipeline is implemented using LightGBM and two deep neural network (DNN) models with different architectures.
  arXiv  Detail & Related papers  (2020-05-13T20:29:48Z)
• Drug-Drug Interaction Prediction with Wasserstein Adversarial Autoencoder-based Knowledge Graph Embeddings [22.562175708415392]
  We propose a new knowledge graph embedding framework for drug-drug interactions. In our framework, the autoencoder is employed to generate high-quality negative samples. The discriminator learns the embeddings of drugs and interactions based on both positive and negative triplets.
  arXiv  Detail & Related papers  (2020-04-15T21:03:29Z)
• Explainable Deep Relational Networks for Predicting Compound-Protein Affinities and Contacts [80.69440684790925]
  DeepRelations is a physics-inspired deep relational network with intrinsically explainable architecture. It shows superior interpretability to the state-of-the-art. It boosts the AUPRC of contact prediction 9.5, 16.9, 19.3 and 5.7-fold for the test, compound-unique, protein-unique, and both-unique sets.
  arXiv  Detail & Related papers  (2019-12-29T00:14:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.