Universal Preprocessing Operators for Embedding Knowledge Graphs with Literals
Knowledge graph embeddings are dense numerical representations of entities in a knowledge graph (KG). While the majority of approaches concentrate only on relational information, i.e., relations between entities, fewer approaches exist which also take information about literal values (e.g., textual descriptions or numerical information) into account. Those which exist are typically tailored towards a particular modality of literal and a particular embedding method. In this paper, we propose a set of universal preprocessing operators which can be used to transform KGs with literals for numerical, temporal, textual, and image information, so that the transformed KGs can be embedded with any method. The results on the kgbench dataset with three different embedding methods show promising results.
Code (1)
Tasks
Knowledge Graph EmbeddingsKnowledge GraphsSimilar Papers 제목 키워드 기반
Universal Knowledge Graph Embeddings
A variety of knowledge graph embedding approaches have been developed. Most of them obtain embeddings by learning the structure of the knowledge graph within a link prediction setting. As a result, the embeddings reflect…
Entity DisambiguationGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graph Embeddings+3Embedding Retrofitting: Data Engineering for better RAG
Embedding retrofitting adjusts pre-trained word vectors using knowledge graph constraints to improve domain-specific retrieval. However, the effectiveness of retrofitting depends critically on knowledge graph quality, wh…
Neural Methods for Logical Reasoning Over Knowledge Graphs
Reasoning is a fundamental problem for computers and deeply studied in Artificial Intelligence. In this paper, we specifically focus on answering multi-hop logical queries on Knowledge Graphs (KGs). This is a complicated…
BenchmarkingKnowledge GraphsLogical ReasoningNegationWasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transport
Answering complex queries on knowledge graphs is important but particularly challenging because of the data incompleteness. Query embedding methods address this issue by learning-based models and simulating logical reaso…
Knowledge GraphsLogical ReasoningBIG MOOD: Relating Transformers to Explicit Commonsense Knowledge
We introduce a simple yet effective method of integrating contextual embeddings with commonsense graph embeddings, dubbed BERT Infused Graphs: Matching Over Other embeDdings. First, we introduce a preprocessing method to…
Language ModelingLanguage Modelling