Query Embedding on Hyper-relational Knowledge Graphs
arXiv:2106.08166
Abstract
Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs (KGs). It subsumes both one-hop link prediction as well as other more complex types of logical queries. Existing algorithms operate only on classical, triple-based graphs, whereas modern KGs often employ a hyper-relational modeling paradigm. In this paradigm, typed edges may have several key-value pairs known as qualifiers that provide fine-grained context for facts. In queries, this context modifies the meaning of relations, and usually reduces the answer set. Hyper-relational queries are often observed in real-world KG applications, and existing approaches for approximate query answering cannot make use of qualifier pairs. In this work, we bridge this gap and extend the multi-hop reasoning problem to hyper-relational KGs allowing to tackle this new type of complex queries. Building upon recent advancements in Graph Neural Networks and query embedding techniques, we study how to embed and answer hyper-relational conjunctive queries. Besides that, we propose a method to answer such queries and demonstrate in our experiments that qualifiers improve query answering on a diverse set of query patterns.
Presented at ICLR2022. https://openreview.net/forum?id=4rLw09TgRw9
References in corpus (8)
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- A Survey on Knowledge Graphs: Representation, Acquisition and Applications
- Knowledge Graphs
- Bringing Light Into the Dark: A Large-scale Evaluation of Knowledge Graph Embedding Models Under a Unified Framework
- Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings
- Faithful Embeddings for Knowledge Base Queries
- End-to-End Entity Classification on Multimodal Knowledge Graphs
- Message Passing Query Embedding