Neural Multi-Hop Reasoning With Logical Rules on Biomedical Knowledge Graphs

• URL: http://arxiv.org/abs/2103.10367v1
• Date: Thu, 18 Mar 2021 16:46:11 GMT
• Title: Neural Multi-Hop Reasoning With Logical Rules on Biomedical Knowledge Graphs
• Authors: Yushan Liu, Marcel Hildebrandt, Mitchell Joblin, Martin Ringsquandl, Rime Raissouni, Volker Tresp
• Abstract summary: We conduct an empirical study based on the real-world task of drug repurposing. We formulate this task as a link prediction problem where both compounds and diseases correspond to entities in a knowledge graph. We propose a new method, PoLo, that combines policy-guided walks based on reinforcement learning with logical rules.
• Score: 10.244651735862627
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Biomedical knowledge graphs permit an integrative computational approach to reasoning about biological systems. The nature of biological data leads to a graph structure that differs from those typically encountered in benchmarking datasets. To understand the implications this may have on the performance of reasoning algorithms, we conduct an empirical study based on the real-world task of drug repurposing. We formulate this task as a link prediction problem where both compounds and diseases correspond to entities in a knowledge graph. To overcome apparent weaknesses of existing algorithms, we propose a new method, PoLo, that combines policy-guided walks based on reinforcement learning with logical rules. These rules are integrated into the algorithm by using a novel reward function. We apply our method to Hetionet, which integrates biomedical information from 29 prominent bioinformatics databases. Our experiments show that our approach outperforms several state-of-the-art methods for link prediction while providing interpretability.

Related papers

• Learning to refine domain knowledge for biological network inference [2.209921757303168]
  Perturbation experiments allow biologists to discover causal relationships between variables of interest. The sparsity and high dimensionality of these data pose significant challenges for causal structure learning algorithms. We propose an amortized algorithm for refining domain knowledge, based on data observations.
  arXiv  Detail & Related papers  (2024-10-18T12:53:23Z)
• 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)
• Graph Relation Distillation for Efficient Biomedical Instance Segmentation [80.51124447333493]
  We propose a graph relation distillation approach for efficient biomedical instance segmentation. We introduce two graph distillation schemes deployed at both the intra-image level and the inter-image level. Experimental results on a number of biomedical datasets validate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2024-01-12T04:41:23Z)
• Diversifying Knowledge Enhancement of Biomedical Language Models using Adapter Modules and Knowledge Graphs [54.223394825528665]
  We develop an approach that uses lightweight adapter modules to inject structured biomedical knowledge into pre-trained language models. We use two large KGs, the biomedical knowledge system UMLS and the novel biochemical OntoChem, with two prominent biomedical PLMs, PubMedBERT and BioLinkBERT. We show that our methodology leads to performance improvements in several instances while keeping requirements in computing power low.
  arXiv  Detail & Related papers  (2023-12-21T14:26:57Z)
• Latent Graphs for Semi-Supervised Learning on Biomedical Tabular Data [4.498659756007485]
  In this work, we provide an approach for inferring latent graphs that capture the intrinsic data relationships. By leveraging graph-based representations, our approach facilitates the seamless propagation of information throughout the graph. Our work demonstrates the significance of inter-instance relationship discovery as practical means for constructing robust latent graphs.
  arXiv  Detail & Related papers  (2023-09-27T16:13:36Z)
• BERT Based Clinical Knowledge Extraction for Biomedical Knowledge Graph Construction and Analysis [0.4893345190925178]
  We propose an end-to-end approach for knowledge extraction and analysis from biomedical clinical notes. The proposed framework can successfully extract relevant structured information with high accuracy.
  arXiv  Detail & Related papers  (2023-04-21T14:45:33Z)
• RandomSCM: interpretable ensembles of sparse classifiers tailored for omics data [59.4141628321618]
  We propose an ensemble learning algorithm based on conjunctions or disjunctions of decision rules. The interpretability of the models makes them useful for biomarker discovery and patterns discovery in high dimensional data.
  arXiv  Detail & Related papers  (2022-08-11T13:55:04Z)
• Biomedical Knowledge Graph Refinement and Completion using Graph Representation Learning and Top-K Similarity Measure [1.4660617536303606]
  This work demonstrates learning discrete representations of the integrated biomedical knowledge graph Chem2Bio2RD. We perform a knowledge graph completion and refinement task using a simple top-K cosine similarity measure between the learned embedding vectors.
  arXiv  Detail & Related papers  (2020-12-18T22:19:57Z)
• Information Theoretic Meta Learning with Gaussian Processes [74.54485310507336]
  We formulate meta learning using information theoretic concepts; namely, mutual information and the information bottleneck. By making use of variational approximations to the mutual information, we derive a general and tractable framework for meta learning.
  arXiv  Detail & Related papers  (2020-09-07T16:47:30Z)
• Integrating Logical Rules Into Neural Multi-Hop Reasoning for Drug Repurposing [23.783111050856245]
  We propose a novel method that combines these rules with a neural multi-hop reasoning approach that uses reinforcement learning. We apply our method to the biomedical knowledge graph Hetionet and show that our approach outperforms several baseline methods.
  arXiv  Detail & Related papers  (2020-07-10T10:32:08Z)
• A Heterogeneous Graph with Factual, Temporal and Logical Knowledge for Question Answering Over Dynamic Contexts [81.4757750425247]
  We study question answering over a dynamic textual environment. We develop a graph neural network over the constructed graph, and train the model in an end-to-end manner.
  arXiv  Detail & Related papers  (2020-04-25T04:53:54Z)

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.