Biomedical Knowledge Graph Embeddings with Negative Statements
A knowledge graph is a powerful representation of real-world entities and their relations. The vast majority of these relations are defined as positive statements, but the importance of negative statements is increasingly recognized, especially under an Open World Assumption. Explicitly considering negative statements has been shown to improve performance on tasks such as entity summarization and question answering or domain-specific tasks such as protein function prediction. However, no attention has been given to the exploration of negative statements by knowledge graph embedding approaches despite the potential of negative statements to produce more accurate representations of entities in a knowledge graph. We propose a novel approach, TrueWalks, to incorporate negative statements into the knowledge graph representation learning process. In particular, we present a novel walk-generation method that is able to not only differentiate between positive and negative statements but also take into account the semantic implications of negation in ontology-rich knowledge graphs. This is of particular importance for applications in the biomedical domain, where the inadequacy of embedding approaches regarding negative statements at the ontology level has been identified as a crucial limitation. We evaluate TrueWalks in ontology-rich biomedical knowledge graphs in two different predictive tasks based on KG embeddings: protein-protein interaction prediction and gene-disease association prediction. We conduct an extensive analysis over established benchmarks and demonstrate that our method is able to improve the performance of knowledge graph embeddings on all tasks.
Code (1)
Tasks
Graph EmbeddingGraph Representation LearningKnowledge Graph EmbeddingKnowledge Graph EmbeddingsKnowledge GraphsNegationProtein Function PredictionQuestion AnsweringRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Benchmark datasets for biomedical knowledge graphs with negative statements
Knowledge graphs represent facts about real-world entities. Most of these facts are defined as positive statements. The negative statements are scarce but highly relevant under the open-world assumption. Furthermore, the…
Disease PredictionKnowledge Graph EmbeddingsKnowledge GraphsPrediction+1Improving Knowledge Graph Embeddings through Contrastive Learning with Negative Statements
Knowledge graphs represent information as structured triples and serve as the backbone for a wide range of applications, including question answering, link prediction, and recommendation systems. A prominent line of rese…
Recommendation SystemsTriple ClassificationContrastive LearningQuestion AnsweringAutomatic Biomedical Term Clustering by Learning Fine-grained Term Representations
Term clustering is important in biomedical knowledge graph construction. Using similarities between terms embedding is helpful for term clustering. State-of-the-art term embeddings leverage pretrained language models to …
ClusteringContrastive Learninggraph constructionKnowledge GraphsKG-NSF: Knowledge Graph Completion with a Negative-Sample-Free Approach
Knowledge Graph (KG) completion is an important task that greatly benefits knowledge discovery in many fields (e.g. biomedical research). In recent years, learning KG embeddings to perform this task has received consider…
Knowledge Graph CompletionLink PredictionCoRTEx: Contrastive Learning for Representing Terms via Explanations with Applications on Constructing Biomedical Knowledge Graphs
Objective: Biomedical Knowledge Graphs play a pivotal role in various biomedical research domains. Concurrently, term clustering emerges as a crucial step in constructing these knowledge graphs, aiming to identify synony…
ClusteringContrastive LearningKnowledge GraphsWorld Knowledge