Distributed representations of graphs for drug pair scoring

• URL: http://arxiv.org/abs/2209.09383v1
• Date: Mon, 19 Sep 2022 23:35:26 GMT
• Title: Distributed representations of graphs for drug pair scoring
• Authors: Paul Scherer, Pietro Li\`o, Mateja Jamnik
• Abstract summary: We study the practicality and usefulness of incorporating distributed representations of graphs into models within the context of drug pair scoring. We present a methodology for learning and incorporating distributed representations of graphs within a unified framework for drug pair scoring. We empirically show that the incorporation of these embeddings improves downstream performance of almost every model across different drug pair scoring tasks.
• Score: 4.277733268268646
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In this paper we study the practicality and usefulness of incorporating distributed representations of graphs into models within the context of drug pair scoring. We argue that the real world growth and update cycles of drug pair scoring datasets subvert the limitations of transductive learning associated with distributed representations. Furthermore, we argue that the vocabulary of discrete substructure patterns induced over drug sets is not dramatically large due to the limited set of atom types and constraints on bonding patterns enforced by chemistry. Under this pretext, we explore the effectiveness of distributed representations of the molecular graphs of drugs in drug pair scoring tasks such as drug synergy, polypharmacy, and drug-drug interaction prediction. To achieve this, we present a methodology for learning and incorporating distributed representations of graphs within a unified framework for drug pair scoring. Subsequently, we augment a number of recent and state-of-the-art models to utilise our embeddings. We empirically show that the incorporation of these embeddings improves downstream performance of almost every model across different drug pair scoring tasks, even those the original model was not designed for. We publicly release all of our drug embeddings for the DrugCombDB, DrugComb, DrugbankDDI, and TwoSides datasets.

Related papers

• GTP-4o: Modality-prompted Heterogeneous Graph Learning for Omni-modal Biomedical Representation [68.63955715643974]
  Modality-prompted Heterogeneous Graph for Omnimodal Learning (GTP-4o) We propose an innovative Modality-prompted Heterogeneous Graph for Omnimodal Learning (GTP-4o)
  arXiv  Detail & Related papers  (2024-07-08T01:06:13Z)
• DecompDiff: Diffusion Models with Decomposed Priors for Structure-Based Drug Design [62.68420322996345]
  Existing structured-based drug design methods treat all ligand atoms equally. We propose a new diffusion model, DecompDiff, with decomposed priors over arms and scaffold. Our approach achieves state-of-the-art performance in generating high-affinity molecules.
  arXiv  Detail & Related papers  (2024-02-26T05:21:21Z)
• Co-modeling the Sequential and Graphical Routes for Peptide Representation Learning [67.66393016797181]
  We propose a peptide co-modeling method, RepCon, to enhance the mutual information of representations from decoupled sequential and graphical end-to-end models. RepCon learns to enhance the consistency of representations between positive sample pairs and to repel representations between negative pairs. Our results demonstrate the superiority of the co-modeling approach over independent modeling, as well as the superiority of RepCon over other methods under the co-modeling framework.
  arXiv  Detail & Related papers  (2023-10-04T16:58:25Z)
• GraphCL-DTA: a graph contrastive learning with molecular semantics for drug-target binding affinity prediction [2.523552067304274]
  GraphCL-DTA is a graph contrastive learning framework for molecular graphs to learn drug representations. Next, we design a new loss function that can be directly used to adjust the uniformity of drug and target representations. The effectiveness of the above innovative elements is verified on two real datasets.
  arXiv  Detail & Related papers  (2023-07-18T06:01:37Z)
• Relation-aware graph structure embedding with co-contrastive learning for drug-drug interaction prediction [4.639653766590366]
  We propose a novel DDI prediction method based on relation-aware graph structure embedding with co-contrastive learning, RaGSECo. The proposed RaGSECo constructs two heterogeneous drug graphs: a multi-relational DDI graph and a multi-attribute drug-drug similarity (DDS) graph. We present a novel co-contrastive learning module to learn drug-pairs (DPs) representations.
  arXiv  Detail & Related papers  (2023-07-04T06:41:50Z)
• Modeling Polypharmacy and Predicting Drug-Drug Interactions using Deep Generative Models on Multimodal Graphs [6.875312133832078]
  We present the effectiveness of graph autoencoders (VGAE) in modeling latent node representations on multimodal networks. Our approach can produce flexible latent spaces for each node type of the multimodal graph. Morgan fingerprints capture the molecular structures of each drug, with their latent embeddings before preceding them to the decoding stage.
  arXiv  Detail & Related papers  (2023-02-17T04:06: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)
• Repurposing Knowledge Graph Embeddings for Triple Representation via Weak Supervision [77.34726150561087]
  Current methods learn triple embeddings from scratch without utilizing entity and predicate embeddings from pre-trained models. We develop a method for automatically sampling triples from a knowledge graph and estimating their pairwise similarities from pre-trained embedding models. These pairwise similarity scores are then fed to a Siamese-like neural architecture to fine-tune triple representations.
  arXiv  Detail & Related papers  (2022-08-22T14:07:08Z)
• 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)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• 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)

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.