Complex Temporal Question Answering on Knowledge Graphs

• URL: http://arxiv.org/abs/2109.08935v1
• Date: Sat, 18 Sep 2021 13:41:43 GMT
• Title: Complex Temporal Question Answering on Knowledge Graphs
• Authors: Zhen Jia, Soumajit Pramanik, Rishiraj Saha Roy, Gerhard Weikum
• Abstract summary: This work presents EXAQT, the first end-to-end system for answering complex temporal questions. It answers natural language questions over knowledge graphs (KGs) in two stages, one geared towards high recall, the other towards precision at top ranks. We evaluate EXAQT on TimeQuestions, a large dataset of 16k temporal questions compiled from a variety of general purpose KG-QA benchmarks.
• Score: 22.996399822102575
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Question answering over knowledge graphs (KG-QA) is a vital topic in IR. Questions with temporal intent are a special class of practical importance, but have not received much attention in research. This work presents EXAQT, the first end-to-end system for answering complex temporal questions that have multiple entities and predicates, and associated temporal conditions. EXAQT answers natural language questions over KGs in two stages, one geared towards high recall, the other towards precision at top ranks. The first step computes question-relevant compact subgraphs within the KG, and judiciously enhances them with pertinent temporal facts, using Group Steiner Trees and fine-tuned BERT models. The second step constructs relational graph convolutional networks (R-GCNs) from the first step's output, and enhances the R-GCNs with time-aware entity embeddings and attention over temporal relations. We evaluate EXAQT on TimeQuestions, a large dataset of 16k temporal questions we compiled from a variety of general purpose KG-QA benchmarks. Results show that EXAQT outperforms three state-of-the-art systems for answering complex questions over KGs, thereby justifying specialized treatment of temporal QA.

Related papers

• Question Answering Over Spatio-Temporal Knowledge Graph [13.422936134074629]
  We present a dataset comprising 10,000 natural language questions for incorporatingtemporal knowledge graph question answering (STKGQA) By extracting temporal and spatial information from a question, our QA model can better comprehend the question and retrieve accurate answers from the STKG.
  arXiv  Detail & Related papers  (2024-02-18T10:44:48Z)
• Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph [34.44840297353777]
  Temporal Knowledge Graph (TKG) is an extension of regular knowledge graph by attaching the time scope. We propose textbfunderlineJoint textbfunderlineMulti textbfunderlineFacts textbfunderlineReasoning textbfunderlineNetwork (JMFRN)
  arXiv  Detail & Related papers  (2024-01-04T11:34:39Z)
• UniKGQA: Unified Retrieval and Reasoning for Solving Multi-hop Question Answering Over Knowledge Graph [89.98762327725112]
  Multi-hop Question Answering over Knowledge Graph(KGQA) aims to find the answer entities that are multiple hops away from the topic entities mentioned in a natural language question. We propose UniKGQA, a novel approach for multi-hop KGQA task, by unifying retrieval and reasoning in both model architecture and parameter learning.
  arXiv  Detail & Related papers  (2022-12-02T04:08:09Z)
• TwiRGCN: Temporally Weighted Graph Convolution for Question Answering over Temporal Knowledge Graphs [35.50055476282997]
  We show how to generalize relational graph convolutional networks (RGCN) for temporal question answering (QA) We propose a novel, intuitive and interpretable scheme to modulate the messages passed through a KG edge during convolution. We evaluate the resulting system, which we call TwiRGCN, on TimeQuestions, a recently released, challenging dataset for complex temporal QA.
  arXiv  Detail & Related papers  (2022-10-12T15:03:49Z)
• Improving Time Sensitivity for Question Answering over Temporal Knowledge Graphs [13.906994055281826]
  We propose a time-sensitive question answering (TSQA) framework to tackle these problems. TSQA features a timestamp estimation module to infer the unwritten timestamp from the question. We also employ a time-sensitive KG encoder to inject ordering information into the temporal KG embeddings that TSQA is based on.
  arXiv  Detail & Related papers  (2022-03-01T06:21:14Z)
• A Benchmark for Generalizable and Interpretable Temporal Question Answering over Knowledge Bases [67.33560134350427]
  TempQA-WD is a benchmark dataset for temporal reasoning. It is based on Wikidata, which is the most frequently curated, openly available knowledge base.
  arXiv  Detail & Related papers  (2022-01-15T08:49:09Z)
• TempoQR: Temporal Question Reasoning over Knowledge Graphs [11.054877399064804]
  This paper puts forth a comprehensive embedding-based framework for answering complex questions over Knowledge Graphs. Our method termed temporal question reasoning (TempoQR) exploits TKG embeddings to ground the question to the specific entities and time scope it refers to. Experiments show that TempoQR improves accuracy by 25--45 percentage points on complex temporal questions over state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-12-10T23:59:14Z)
• Relation-Guided Pre-Training for Open-Domain Question Answering [67.86958978322188]
  We propose a Relation-Guided Pre-Training (RGPT-QA) framework to solve complex open-domain questions. We show that RGPT-QA achieves 2.2%, 2.4%, and 6.3% absolute improvement in Exact Match accuracy on Natural Questions, TriviaQA, and WebQuestions.
  arXiv  Detail & Related papers  (2021-09-21T17:59:31Z)
• QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering [122.84513233992422]
  We propose a new model, QA-GNN, which addresses the problem of answering questions using knowledge from pre-trained language models (LMs) and knowledge graphs (KGs) We show its improvement over existing LM and LM+KG models, as well as its capability to perform interpretable and structured reasoning.
  arXiv  Detail & Related papers  (2021-04-13T17:32:51Z)
• A Survey on Complex Question Answering over Knowledge Base: Recent Advances and Challenges [71.4531144086568]
  Question Answering (QA) over Knowledge Base (KB) aims to automatically answer natural language questions. Researchers have shifted their attention from simple questions to complex questions, which require more KB triples and constraint inference.
  arXiv  Detail & Related papers  (2020-07-26T07:13:32Z)
• Toward Subgraph-Guided Knowledge Graph Question Generation with Graph Neural Networks [53.58077686470096]
  Knowledge graph (KG) question generation (QG) aims to generate natural language questions from KGs and target answers. In this work, we focus on a more realistic setting where we aim to generate questions from a KG subgraph and target answers.
  arXiv  Detail & Related papers  (2020-04-13T15:43:22Z)

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.