Relation Matters in Sampling: A Scalable Multi-Relational Graph Neural Network for Drug-Drug Interaction Prediction

• URL: http://arxiv.org/abs/2105.13975v1
• Date: Fri, 28 May 2021 16:55:09 GMT
• Title: Relation Matters in Sampling: A Scalable Multi-Relational Graph Neural Network for Drug-Drug Interaction Prediction
• Authors: Arthur Feeney and Rishabh Gupta and Veronika Thost and Rico Angell and Gayathri Chandu and Yash Adhikari and Tengfei Ma
• Abstract summary: We propose an approach to modeling the importance of relation types for neighborhood sampling in graph neural networks. Our experiments on drug-drug interaction prediction show that state-of-the-art graph neural networks profit from relation-dependent sampling.
• Score: 6.685734268578486
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sampling is an established technique to scale graph neural networks to large graphs. Current approaches however assume the graphs to be homogeneous in terms of relations and ignore relation types, critically important in biomedical graphs. Multi-relational graphs contain various types of relations that usually come with variable frequency and have different importance for the problem at hand. We propose an approach to modeling the importance of relation types for neighborhood sampling in graph neural networks and show that we can learn the right balance: relation-type probabilities that reflect both frequency and importance. Our experiments on drug-drug interaction prediction show that state-of-the-art graph neural networks profit from relation-dependent sampling in terms of both accuracy and efficiency.

Related papers

• A deep graph model for the signed interaction prediction in biological network [1.03121181235382]
  Predicting signed interactions in biological networks is crucial for understanding drug mechanisms and facilitating drug repurposing. textbfRGCNTD is designed to predict both polar (e.g. activation, inhibition) and non-polar (e.g. binding, affect) chemical-gene interactions. We introduce new evaluation metrics, textitAUCtextsubscriptpolarity and textitCP@500, to assess the model's ability to differentiate interaction types.
  arXiv  Detail & Related papers  (2024-07-10T04:28:21Z)
• Learning Latent Graph Structures and their Uncertainty [63.95971478893842]
  We show that minimizing point-prediction losses does not guarantee proper learning of latent relational information.<n>We propose a sampling-based method that solves this joint learning task.
  arXiv  Detail & Related papers  (2024-05-30T10:49:22Z)
• Multi-Relational Graph Neural Network for Out-of-Domain Link Prediction [12.475382123139024]
  We introduce a novel Graph Neural Network model, named GOOD, to tackle the out-of-domain generalization problem. GOOD can effectively generalize predictions out of known relationship types and achieve state-of-the-art results.
  arXiv  Detail & Related papers  (2024-03-17T18:08:22Z)
• A Comparative Study of Population-Graph Construction Methods and Graph Neural Networks for Brain Age Regression [48.97251676778599]
  In medical imaging, population graphs have demonstrated promising results, mostly for classification tasks. extracting population graphs is a non-trivial task and can significantly impact the performance of Graph Neural Networks (GNNs) In this work, we highlight the importance of a meaningful graph construction and experiment with different population-graph construction methods.
  arXiv  Detail & Related papers  (2023-09-26T10:30:45Z)
• Predicting Biomedical Interactions with Probabilistic Model Selection for Graph Neural Networks [5.156812030122437]
  Current biological networks are noisy, sparse, and incomplete. Experimental identification of such interactions is both time-consuming and expensive. Deep graph neural networks have shown their effectiveness in modeling graph-structured data and achieved good performance in biomedical interaction prediction. Our proposed method enables the graph convolutional networks to dynamically adapt their depths to accommodate an increasing number of interactions.
  arXiv  Detail & Related papers  (2022-11-22T20:44:28Z)
• Multi-modal Dynamic Graph Network: Coupling Structural and Functional Connectome for Disease Diagnosis and Classification [8.67028273829113]
  We propose a Multi-modal Dynamic Graph Convolution Network (MDGCN) for structural and functional brain network learning. Our method benefits from modeling inter-modal representations and relating attentive multi-model associations into dynamic graphs.
  arXiv  Detail & Related papers  (2022-10-25T02:41:32Z)
• Relation Embedding based Graph Neural Networks for Handling Heterogeneous Graph [58.99478502486377]
  We propose a simple yet efficient framework to make the homogeneous GNNs have adequate ability to handle heterogeneous graphs. Specifically, we propose Relation Embedding based Graph Neural Networks (RE-GNNs), which employ only one parameter per relation to embed the importance of edge type relations and self-loop connections.
  arXiv  Detail & Related papers  (2022-09-23T05:24:18Z)
• Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting [50.901984244738806]
  We show how to model the evolutionary and multi-scale interactions of time series. In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations. A unified neural network is provided to integrate the components above to get the final prediction.
  arXiv  Detail & Related papers  (2022-06-28T08:11:12Z)
• Graph-in-Graph (GiG): Learning interpretable latent graphs in non-Euclidean domain for biological and healthcare applications [52.65389473899139]
  Graphs are a powerful tool for representing and analyzing unstructured, non-Euclidean data ubiquitous in the healthcare domain. Recent works have shown that considering relationships between input data samples have a positive regularizing effect for the downstream task. We propose Graph-in-Graph (GiG), a neural network architecture for protein classification and brain imaging applications.
  arXiv  Detail & Related papers  (2022-04-01T10:01:37Z)
• Brain dynamics via Cumulative Auto-Regressive Self-Attention [0.0]
  We present a model that is considerably shallow than deep graph neural networks (GNNs) Our model learns the autoregressive structure of individual time series and estimates directed connectivity graphs. We demonstrate our results on a functional neuroimaging dataset classifying schizophrenia patients and controls.
  arXiv  Detail & Related papers  (2021-11-01T21:50:35Z)
• Towards Deeper Graph Neural Networks [63.46470695525957]
  Graph convolutions perform neighborhood aggregation and represent one of the most important graph operations. Several recent studies attribute this performance deterioration to the over-smoothing issue. We propose Deep Adaptive Graph Neural Network (DAGNN) to adaptively incorporate information from large receptive fields.
  arXiv  Detail & Related papers  (2020-07-18T01:11:14Z)
• Graph Structure of Neural Networks [104.33754950606298]
  We show how the graph structure of neural networks affect their predictive performance. A "sweet spot" of relational graphs leads to neural networks with significantly improved predictive performance. Top-performing neural networks have graph structure surprisingly similar to those of real biological neural networks.
  arXiv  Detail & Related papers  (2020-07-13T17:59:31Z)

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.