Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks

• URL: http://arxiv.org/abs/2010.08516v1
• Date: Fri, 16 Oct 2020 17:16:09 GMT
• Title: Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks
• Authors: Kishan KC, Rui Li, Feng Cui, Anne Haake
• Abstract summary: We present a higher-order graph convolutional network (HOGCN) to aggregate information from the higher-order neighborhood for biomedical interaction prediction. Experiments on four interaction networks, including protein-protein, drug-drug, drug-target, and gene-disease interactions, show that HOGCN achieves more accurate and calibrated predictions.
• Score: 2.9488233765621295
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Biomedical interaction networks have incredible potential to be useful in the prediction of biologically meaningful interactions, identification of network biomarkers of disease, and the discovery of putative drug targets. Recently, graph neural networks have been proposed to effectively learn representations for biomedical entities and achieved state-of-the-art results in biomedical interaction prediction. These methods only consider information from immediate neighbors but cannot learn a general mixing of features from neighbors at various distances. In this paper, we present a higher-order graph convolutional network (HOGCN) to aggregate information from the higher-order neighborhood for biomedical interaction prediction. Specifically, HOGCN collects feature representations of neighbors at various distances and learns their linear mixing to obtain informative representations of biomedical entities. Experiments on four interaction networks, including protein-protein, drug-drug, drug-target, and gene-disease interactions, show that HOGCN achieves more accurate and calibrated predictions. HOGCN performs well on noisy, sparse interaction networks when feature representations of neighbors at various distances are considered. Moreover, a set of novel interaction predictions are validated by literature-based case studies.

Related papers

• Learning to Denoise Biomedical Knowledge Graph for Robust Molecular Interaction Prediction [50.7901190642594]
  We propose BioKDN (Biomedical Knowledge Graph Denoising Network) for robust molecular interaction prediction. BioKDN refines the reliable structure of local subgraphs by denoising noisy links in a learnable manner. It maintains consistent and robust semantics by smoothing relations around the target interaction.
  arXiv  Detail & Related papers  (2023-12-09T07:08:00Z)
• Emerging Drug Interaction Prediction Enabled by Flow-based Graph Neural Network with Biomedical Network [69.16939798838159]
  We propose EmerGNN, a graph neural network (GNN) that can effectively predict interactions for emerging drugs. EmerGNN learns pairwise representations of drugs by extracting the paths between drug pairs, propagating information from one drug to the other, and incorporating the relevant biomedical concepts on the paths. Overall, EmerGNN has higher accuracy than existing approaches in predicting interactions for emerging drugs and can identify the most relevant information on the biomedical network.
  arXiv  Detail & Related papers  (2023-11-15T06:34:00Z)
• ResMGCN: Residual Message Graph Convolution Network for Fast Biomedical Interactions Discovering [0.0]
  We propose a novel Residual Message Graph Convolution Network (ResMGCN) for fast and precise biomedical interaction prediction. We conduct experiments on four biomedical interaction network datasets, including protein-protein, drug-drug, drug-target, and gene-disease interactions.
  arXiv  Detail & Related papers  (2023-11-13T13:16:35Z)
• 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)
• Discovering the Representation Bottleneck of Graph Neural Networks from Multi-order Interactions [51.597480162777074]
  Graph neural networks (GNNs) rely on the message passing paradigm to propagate node features and build interactions. Recent works point out that different graph learning tasks require different ranges of interactions between nodes. We study two common graph construction methods in scientific domains, i.e., emphK-nearest neighbor (KNN) graphs and emphfully-connected (FC) graphs.
  arXiv  Detail & Related papers  (2022-05-15T11:38:14Z)
• Heterogeneous Graph based Deep Learning for Biomedical Network Link Prediction [7.628651624423363]
  We propose a Graph Pair based Link Prediction model (GPLP) for predicting biomedical network links. InP, 1-hop subgraphs extracted from known network interaction matrix is learnt to predict missing links. Our method demonstrates the potential applications in other biomedical networks.
  arXiv  Detail & Related papers  (2021-01-28T07:35:29Z)
• Distance-aware Molecule Graph Attention Network for Drug-Target Binding Affinity Prediction [54.93890176891602]
  We propose a diStance-aware Molecule graph Attention Network (S-MAN) tailored to drug-target binding affinity prediction. As a dedicated solution, we first propose a position encoding mechanism to integrate the topological structure and spatial position information into the constructed pocket-ligand graph. We also propose a novel edge-node hierarchical attentive aggregation structure which has edge-level aggregation and node-level aggregation.
  arXiv  Detail & Related papers  (2020-12-17T17:44:01Z)
• SumGNN: Multi-typed Drug Interaction Prediction via Efficient Knowledge Graph Summarization [64.56399911605286]
  We propose SumGNN: knowledge summarization graph neural network, which is enabled by a subgraph extraction module. SumGNN outperforms the best baseline by up to 5.54%, and the performance gain is particularly significant in low data relation types.
  arXiv  Detail & Related papers  (2020-10-04T00:14:57Z)
• SkipGNN: Predicting Molecular Interactions with Skip-Graph Networks [70.64925872964416]
  We present SkipGNN, a graph neural network approach for the prediction of molecular interactions. SkipGNN predicts molecular interactions by not only aggregating information from direct interactions but also from second-order interactions. We show that SkipGNN achieves superior and robust performance, outperforming existing methods by up to 28.8% of area.
  arXiv  Detail & Related papers  (2020-04-30T16:55:58Z)

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.