Improving Time Sensitivity for Question Answering over Temporal Knowledge Graphs

被引:0
|
作者
Shang, Chao [1 ]
Wang, Guangtao [1 ]
Qi, Peng [1 ]
Huang, Jing [2 ]
机构
[1] JD AI Res, Beijing, Peoples R China
[2] Amazon, Alexa AI, Seattle, WA USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Question answering over temporal knowledge graphs (KGs) efficiently uses facts contained in a temporal KG, which records entity relations and when they occur in time, to answer natural language questions (e.g., "Who was the president of the US before Obama?"). These questions often involve three time-related challenges that previous work fail to adequately address: 1) questions often do not specify exact timestamps of interest (e.g., "Obama" instead of 2000); 2) subtle lexical differences in time relations (e.g., "before" vs "after"); 3) off-the-shelf temporal KG embeddings that previous work builds on ignore the temporal order of timestamps, which is crucial for answering temporal-order related questions. In this paper, 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. With the help of techniques to reduce the search space for potential answers, TSQA significantly outperforms the previous state of the art on a new benchmark for question answering over temporal KGs, especially achieving a 32% (absolute) error reduction on complex questions that require multiple steps of reasoning over facts in the temporal KG.
引用
收藏
页码:8017 / 8026
页数:10
相关论文
共 50 条
  • [31] Question Answering Over Knowledge Graphs: Question Understanding Via Template Decomposition
    Zheng, Weiguo
    Yu, Jeffrey Xu
    Zou, Lei
    Cheng, Hong
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2018, 11 (11): : 1373 - 1386
  • [32] Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs
    Maheshwari, Gaurav
    Trivedi, Priyansh
    Lukovnikov, Denis
    Chakraborty, Nilesh
    Fischer, Asja
    Lehmann, Jens
    SEMANTIC WEB - ISWC 2019, PT I, 2019, 11778 : 487 - 504
  • [33] Language Models as SPARQL Query Filtering for Improving the Quality of Multilingual Question Answering over Knowledge Graphs
    Perevalov, Aleksandr
    Gashkov, Aleksandr
    Eltsova, Maria
    Both, Andreas
    WEB ENGINEERING, ICWE 2024, 2024, 14629 : 3 - 18
  • [34] Question Answering on Scholarly Knowledge Graphs
    Jaradeh, Mohamad Yaser
    Stocker, Markus
    Auer, Soeren
    DIGITAL LIBRARIES FOR OPEN KNOWLEDGE, TPDL 2020, 2020, 12246 : 19 - 32
  • [35] Question answering over knowledge graphs: a graph-driven approach
    Aghaei, Sareh
    Masoudi, Sepide
    Chhetri, Tek Raj
    Fensel, Anna
    2022 IEEE/WIC/ACM INTERNATIONAL JOINT CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WI-IAT, 2022, : 296 - 302
  • [36] CBench: Towards Better Evaluation of Question Answering Over Knowledge Graphs
    Orogat, Abdelghny
    Liu, Isabelle
    El-Roby, Ahmed
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (08): : 1325 - 1337
  • [37] QaldGen: Towards Microbenchmarking of Question Answering Systems over Knowledge Graphs
    Singh, Kuldeep
    Saleem, Muhammad
    Nadgeri, Abhishek
    Conrads, Felix
    Pan, Jeff Z.
    Ngomo, Axel-Cyrille Ngonga
    Lehmann, Jens
    SEMANTIC WEB - ISWC 2019, PT II, 2019, 11779 : 277 - 292
  • [38] MLPQ: A Dataset for Path Question Answering over Multilingual Knowledge Graphs
    Tan, Yiming
    Chen, Yongrui
    Qi, Guilin
    Li, Weizhuo
    Wang, Meng
    BIG DATA RESEARCH, 2023, 32
  • [39] Auction-Based Learning for Question Answering over Knowledge Graphs
    Agrawal, Garima
    Bertsekas, Dimitri
    Liu, Huan
    INFORMATION, 2023, 14 (06)
  • [40] Contrastive Representation Learning for Conversational Question Answering over Knowledge Graphs
    Kacupaj, Endri
    Singh, Kuldeep
    Maleshkova, Maria
    Lehmann, Jens
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 925 - 934