Path-based knowledge reasoning with textual semantic information for
medical knowledge graph completion
- URL: http://arxiv.org/abs/2105.13074v2
- Date: Fri, 28 May 2021 02:38:35 GMT
- Title: Path-based knowledge reasoning with textual semantic information for
medical knowledge graph completion
- Authors: Yinyu Lan, Shizhu He, Xiangrong Zeng, Shengping Liu, Kang Liu, Jun
Zhao
- Abstract summary: Medical knowledge graphs (KGs) are often significantly incomplete, so it necessitating a demand for medical knowledge graph completion (MedKGC)
MedKGC can find new facts based on the exited knowledge in the KGs.
This paper proposes two novel path-based reasoning methods to solve the sparsity issues of entity and path respectively.
- Score: 20.929596842568994
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Background Knowledge graphs (KGs), especially medical knowledge graphs, are
often significantly incomplete, so it necessitating a demand for medical
knowledge graph completion (MedKGC). MedKGC can find new facts based on the
exited knowledge in the KGs. The path-based knowledge reasoning algorithm is
one of the most important approaches to this task. This type of method has
received great attention in recent years because of its high performance and
interpretability. In fact, traditional methods such as path ranking algorithm
(PRA) take the paths between an entity pair as atomic features. However, the
medical KGs are very sparse, which makes it difficult to model effective
semantic representation for extremely sparse path features. The sparsity in the
medical KGs is mainly reflected in the long-tailed distribution of entities and
paths. Previous methods merely consider the context structure in the paths of
the knowledge graph and ignore the textual semantics of the symbols in the
path. Therefore, their performance cannot be further improved due to the two
aspects of entity sparseness and path sparseness. To address the above issues,
this paper proposes two novel path-based reasoning methods to solve the
sparsity issues of entity and path respectively, which adopts the textual
semantic information of entities and paths for MedKGC. By using the pre-trained
model BERT, combining the textual semantic representations of the entities and
the relationships, we model the task of symbolic reasoning in the medical KG as
a numerical computing issue in textual semantic representation.
Related papers
- EntailE: Introducing Textual Entailment in Commonsense Knowledge Graph
Completion [54.12709176438264]
Commonsense knowledge graphs (CSKGs) utilize free-form text to represent named entities, short phrases, and events as their nodes.
Current methods leverage semantic similarities to increase the graph density, but the semantic plausibility of the nodes and their relations are under-explored.
We propose to adopt textual entailment to find implicit entailment relations between CSKG nodes, to effectively densify the subgraph connecting nodes within the same conceptual class.
arXiv Detail & Related papers (2024-02-15T02:27:23Z) - ReOnto: A Neuro-Symbolic Approach for Biomedical Relation Extraction [3.263873198567265]
ReOnto Relation Extraction (RE) is the task of extracting semantic relationships between entities in a sentence and aligning them to relations defined in a vocabulary.
We present a novel technique that makes use of neuro symbolic knowledge for the RE task.
Experimental results on two public biomedical datasets, BioRel and ADE, show that our method outperforms all the baselines.
arXiv Detail & Related papers (2023-09-04T05:36:58Z) - Representation Learning for Person or Entity-centric Knowledge Graphs:
An Application in Healthcare [0.757843972001219]
This paper presents an end-to-end representation learning framework to extract entity-centric KGs from structured and unstructured data.
We introduce a star-shaped classifier to represent the multiple facets of a person and use it to guide KG creation.
We highlight that this approach has several potential applications across domains and is open-sourced.
arXiv Detail & Related papers (2023-05-09T17:39:45Z) - Joint Language Semantic and Structure Embedding for Knowledge Graph
Completion [66.15933600765835]
We propose to jointly embed the semantics in the natural language description of the knowledge triplets with their structure information.
Our method embeds knowledge graphs for the completion task via fine-tuning pre-trained language models.
Our experiments on a variety of knowledge graph benchmarks have demonstrated the state-of-the-art performance of our method.
arXiv Detail & Related papers (2022-09-19T02:41:02Z) - Explainable Sparse Knowledge Graph Completion via High-order Graph
Reasoning Network [111.67744771462873]
This paper proposes a novel explainable model for sparse Knowledge Graphs (KGs)
It combines high-order reasoning into a graph convolutional network, namely HoGRN.
It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability.
arXiv Detail & Related papers (2022-07-14T10:16:56Z) - MERIt: Meta-Path Guided Contrastive Learning for Logical Reasoning [63.50909998372667]
We propose MERIt, a MEta-path guided contrastive learning method for logical ReasonIng of text.
Two novel strategies serve as indispensable components of our method.
arXiv Detail & Related papers (2022-03-01T11:13:00Z) - Zero-shot Medical Entity Retrieval without Annotation: Learning From
Rich Knowledge Graph Semantics [5.2710726359379265]
Current approaches tend to work well on specific medical domains but poorly generalize to unseen sub-specialties.
This is of increasing concern under a public health crisis as new medical conditions and drug treatments come to light frequently.
Medical knowledge graphs (KG) contain rich semantics including large numbers of synonyms as well as its curated graphical structures.
arXiv Detail & Related papers (2021-05-26T16:53:48Z) - Quantifying Explainers of Graph Neural Networks in Computational
Pathology [13.526389642048947]
We propose a set of novel quantitative metrics based on statistics of class separability to characterize graph explainers.
We employ the proposed metrics to evaluate three types of graph explainers, namely the layer-wise relevance propagation, gradient-based saliency, and graph pruning approaches.
We validate the qualitative and quantitative findings on the BRACS dataset, a large cohort of breast cancer RoIs, by expert pathologists.
arXiv Detail & Related papers (2020-11-25T11:13:01Z) - Joint Semantics and Data-Driven Path Representation for Knowledge Graph
Inference [60.048447849653876]
We propose a novel joint semantics and data-driven path representation that balances explainability and generalization in the framework of KG embedding.
Our proposed model is evaluated on two classes of tasks: link prediction and path query answering task.
arXiv Detail & Related papers (2020-10-06T10:24:45Z) - Connecting the Dots: A Knowledgeable Path Generator for Commonsense
Question Answering [50.72473345911147]
This paper augments a general commonsense QA framework with a knowledgeable path generator.
By extrapolating over existing paths in a KG with a state-of-the-art language model, our generator learns to connect a pair of entities in text with a dynamic, and potentially novel, multi-hop relational path.
arXiv Detail & Related papers (2020-05-02T03:53:21Z)
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.