Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings

• URL: http://arxiv.org/abs/2002.05969v2
• Date: Sat, 29 Feb 2020 03:59:06 GMT
• Title: Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings
• Authors: Hongyu Ren, Weihua Hu, Jure Leskovec
• Abstract summary: query2box is an embedding-based framework for reasoning over arbitrary queries on incomplete knowledge graphs. We show that query2box is capable of handling arbitrary logical queries with $wedge$, $vee$, $exists$ in a scalable manner. We demonstrate the effectiveness of query2box on three large KGs and show that query2box achieves up to 25% relative improvement over the state of the art.
• Score: 84.0206612938464
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Answering complex logical queries on large-scale incomplete knowledge graphs (KGs) is a fundamental yet challenging task. Recently, a promising approach to this problem has been to embed KG entities as well as the query into a vector space such that entities that answer the query are embedded close to the query. However, prior work models queries as single points in the vector space, which is problematic because a complex query represents a potentially large set of its answer entities, but it is unclear how such a set can be represented as a single point. Furthermore, prior work can only handle queries that use conjunctions ($\wedge$) and existential quantifiers ($\exists$). Handling queries with logical disjunctions ($\vee$) remains an open problem. Here we propose query2box, an embedding-based framework for reasoning over arbitrary queries with $\wedge$, $\vee$, and $\exists$ operators in massive and incomplete KGs. Our main insight is that queries can be embedded as boxes (i.e., hyper-rectangles), where a set of points inside the box corresponds to a set of answer entities of the query. We show that conjunctions can be naturally represented as intersections of boxes and also prove a negative result that handling disjunctions would require embedding with dimension proportional to the number of KG entities. However, we show that by transforming queries into a Disjunctive Normal Form, query2box is capable of handling arbitrary logical queries with $\wedge$, $\vee$, $\exists$ in a scalable manner. We demonstrate the effectiveness of query2box on three large KGs and show that query2box achieves up to 25% relative improvement over the state of the art.

Related papers

• DAGE: DAG Query Answering via Relational Combinator with Logical Constraints [24.60431781360608]
  We propose a query embedding method for DAG queries called DAGE. DAGE combines the possibly multiple paths between two nodes into a single path with a trainable operator. We show that it is possible to implement DAGE on top of existing query embedding methods.
  arXiv  Detail & Related papers  (2024-10-29T15:02:48Z)
• RConE: Rough Cone Embedding for Multi-Hop Logical Query Answering on Multi-Modal Knowledge Graphs [30.94793132285142]
  Multi-hop query answering over a Knowledge Graph involves traversing one or more hops from the start node to answer a query. We propose RConE, an embedding method to capture the multi-modal information needed to answer a query. We are the first to introduce logical constructs in querying MMKGs and to answer queries that involve sub-entities of multi-modal entities as the answer.
  arXiv  Detail & Related papers  (2024-08-21T11:02:35Z)
• Generating $SROI^-$ Ontologies via Knowledge Graph Query Embedding Learning [26.905431434167536]
  We propose a novel query embedding method, AConE, which explains the knowledge learned from the graph in the form of $SROI-$ description logic axioms. AConE achieves superior results over previous baselines with fewer parameters. We provide comprehensive analyses showing that the capability to represent axioms positively impacts the results of query answering.
  arXiv  Detail & Related papers  (2024-07-12T12:20:39Z)
• Query2Particles: Knowledge Graph Reasoning with Particle Embeddings [49.64006979045662]
  We propose a query embedding method to answer complex logical queries on knowledge graphs with missing edges. The answer entities are selected according to the similarities between the entity embeddings and the query embedding. A complex KG query answering method, Q2P, is proposed to retrieve diverse answers from different areas over the embedding space.
  arXiv  Detail & Related papers  (2022-04-27T11:16:08Z)
• Knowledge Base Question Answering by Case-based Reasoning over Subgraphs [81.22050011503933]
  We show that our model answers queries requiring complex reasoning patterns more effectively than existing KG completion algorithms. The proposed model outperforms or performs competitively with state-of-the-art models on several KBQA benchmarks.
  arXiv  Detail & Related papers  (2022-02-22T01:34:35Z)
• Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering [78.9863753810787]
  A large amount of world's knowledge is stored in structured databases. query languages can answer questions that require complex reasoning, as well as offering full explainability.
  arXiv  Detail & Related papers  (2021-08-05T22:04:13Z)
• Query Embedding on Hyper-relational Knowledge Graphs [0.4779196219827507]
  Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs. We extend the multi-hop reasoning problem to hyper-relational KGs allowing to tackle this new type of complex queries.
  arXiv  Detail & Related papers  (2021-06-15T14:08:50Z)
• Logic Embeddings for Complex Query Answering [56.25151854231117]
  We propose Logic Embeddings, a new approach to embedding complex queries that uses Skolemisation to eliminate existential variables for efficient querying. We show that Logic Embeddings are competitively fast and accurate in query answering over large, incomplete knowledge graphs, outperform on negation queries, and in particular, provide improved modeling of answer uncertainty.
  arXiv  Detail & Related papers  (2021-02-28T07:52:37Z)
• Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs [89.51365993393787]
  We present BetaE, a probabilistic embedding framework for answering arbitrary FOL queries over a knowledge graph (KG) BetaE is the first method that can handle a complete set of first-order logical operations. We demonstrate the performance of BetaE on answering arbitrary FOL queries on three large, incomplete KGs.
  arXiv  Detail & Related papers  (2020-10-22T06:11:39Z)

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.