Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph

Temporal Knowledge Graph (TKG) is an extension of regular knowledge graph by attaching the time scope. Existing temporal knowledge graph question answering (TKGQA) models solely approach simple questions, owing to the prior assumption that each question only contains a single temporal fact with expl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Huang, Rikui, Wei, Wei, Qu, Xiaoye, Xie, Wenfeng, Mao, Xianling, Chen, Dangyang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Huang, Rikui
Wei, Wei
Qu, Xiaoye
Xie, Wenfeng
Mao, Xianling
Chen, Dangyang
description Temporal Knowledge Graph (TKG) is an extension of regular knowledge graph by attaching the time scope. Existing temporal knowledge graph question answering (TKGQA) models solely approach simple questions, owing to the prior assumption that each question only contains a single temporal fact with explicit/implicit temporal constraints. Hence, they perform poorly on questions which own multiple temporal facts. In this paper, we propose \textbf{\underline{J}}oint \textbf{\underline{M}}ulti \textbf{\underline{F}}acts \textbf{\underline{R}}easoning \textbf{\underline{N}}etwork (JMFRN), to jointly reasoning multiple temporal facts for accurately answering \emph{complex} temporal questions. Specifically, JMFRN first retrieves question-related temporal facts from TKG for each entity of the given complex question. For joint reasoning, we design two different attention (\ie entity-aware and time-aware) modules, which are suitable for universal settings, to aggregate entities and timestamps information of retrieved facts. Moreover, to filter incorrect type answers, we introduce an additional answer type discrimination task. Extensive experiments demonstrate our proposed method significantly outperforms the state-of-art on the well-known complex temporal question benchmark TimeQuestions.
doi_str_mv 10.48550/arxiv.2401.02212
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2401_02212</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2401_02212</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-654e95aa3a6603b8e23404ce58d70b98dd1926c385acbbd1990ea4e80367ffb63</originalsourceid><addsrcrecordid>eNotz8tOg0AYBeDZuDDVB3DlvAA4zI1h2RBbL9VGwx5_4KdOhBky0FLfXltdnZzk5CQfITcJi6VRit1BONpDzCVLYsZ5wi_Jx5O3bqIv-26y0QrqaaTvCKN31u3oK06zD1905QPNfT90eKQF9oMP0NG3PY6T9Y4u3ThjOO23Bwz02fm5w2aHdB1g-LwiFy10I17_54IUq_sif4g22_VjvtxEoFMeaSUxUwACtGaiMsiFZLJGZZqUVZlpmiTjuhZGQV1VvyVjCBINEzpt20qLBbn9uz0TyyHYHsJ3eaKWZ6r4AcmmT2A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph</title><source>arXiv.org</source><creator>Huang, Rikui ; Wei, Wei ; Qu, Xiaoye ; Xie, Wenfeng ; Mao, Xianling ; Chen, Dangyang</creator><creatorcontrib>Huang, Rikui ; Wei, Wei ; Qu, Xiaoye ; Xie, Wenfeng ; Mao, Xianling ; Chen, Dangyang</creatorcontrib><description>Temporal Knowledge Graph (TKG) is an extension of regular knowledge graph by attaching the time scope. Existing temporal knowledge graph question answering (TKGQA) models solely approach simple questions, owing to the prior assumption that each question only contains a single temporal fact with explicit/implicit temporal constraints. Hence, they perform poorly on questions which own multiple temporal facts. In this paper, we propose \textbf{\underline{J}}oint \textbf{\underline{M}}ulti \textbf{\underline{F}}acts \textbf{\underline{R}}easoning \textbf{\underline{N}}etwork (JMFRN), to jointly reasoning multiple temporal facts for accurately answering \emph{complex} temporal questions. Specifically, JMFRN first retrieves question-related temporal facts from TKG for each entity of the given complex question. For joint reasoning, we design two different attention (\ie entity-aware and time-aware) modules, which are suitable for universal settings, to aggregate entities and timestamps information of retrieved facts. Moreover, to filter incorrect type answers, we introduce an additional answer type discrimination task. Extensive experiments demonstrate our proposed method significantly outperforms the state-of-art on the well-known complex temporal question benchmark TimeQuestions.</description><identifier>DOI: 10.48550/arxiv.2401.02212</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence ; Computer Science - Computation and Language</subject><creationdate>2024-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2401.02212$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2401.02212$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Huang, Rikui</creatorcontrib><creatorcontrib>Wei, Wei</creatorcontrib><creatorcontrib>Qu, Xiaoye</creatorcontrib><creatorcontrib>Xie, Wenfeng</creatorcontrib><creatorcontrib>Mao, Xianling</creatorcontrib><creatorcontrib>Chen, Dangyang</creatorcontrib><title>Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph</title><description>Temporal Knowledge Graph (TKG) is an extension of regular knowledge graph by attaching the time scope. Existing temporal knowledge graph question answering (TKGQA) models solely approach simple questions, owing to the prior assumption that each question only contains a single temporal fact with explicit/implicit temporal constraints. Hence, they perform poorly on questions which own multiple temporal facts. In this paper, we propose \textbf{\underline{J}}oint \textbf{\underline{M}}ulti \textbf{\underline{F}}acts \textbf{\underline{R}}easoning \textbf{\underline{N}}etwork (JMFRN), to jointly reasoning multiple temporal facts for accurately answering \emph{complex} temporal questions. Specifically, JMFRN first retrieves question-related temporal facts from TKG for each entity of the given complex question. For joint reasoning, we design two different attention (\ie entity-aware and time-aware) modules, which are suitable for universal settings, to aggregate entities and timestamps information of retrieved facts. Moreover, to filter incorrect type answers, we introduce an additional answer type discrimination task. Extensive experiments demonstrate our proposed method significantly outperforms the state-of-art on the well-known complex temporal question benchmark TimeQuestions.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz8tOg0AYBeDZuDDVB3DlvAA4zI1h2RBbL9VGwx5_4KdOhBky0FLfXltdnZzk5CQfITcJi6VRit1BONpDzCVLYsZ5wi_Jx5O3bqIv-26y0QrqaaTvCKN31u3oK06zD1905QPNfT90eKQF9oMP0NG3PY6T9Y4u3ThjOO23Bwz02fm5w2aHdB1g-LwiFy10I17_54IUq_sif4g22_VjvtxEoFMeaSUxUwACtGaiMsiFZLJGZZqUVZlpmiTjuhZGQV1VvyVjCBINEzpt20qLBbn9uz0TyyHYHsJ3eaKWZ6r4AcmmT2A</recordid><startdate>20240104</startdate><enddate>20240104</enddate><creator>Huang, Rikui</creator><creator>Wei, Wei</creator><creator>Qu, Xiaoye</creator><creator>Xie, Wenfeng</creator><creator>Mao, Xianling</creator><creator>Chen, Dangyang</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240104</creationdate><title>Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph</title><author>Huang, Rikui ; Wei, Wei ; Qu, Xiaoye ; Xie, Wenfeng ; Mao, Xianling ; Chen, Dangyang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-654e95aa3a6603b8e23404ce58d70b98dd1926c385acbbd1990ea4e80367ffb63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Huang, Rikui</creatorcontrib><creatorcontrib>Wei, Wei</creatorcontrib><creatorcontrib>Qu, Xiaoye</creatorcontrib><creatorcontrib>Xie, Wenfeng</creatorcontrib><creatorcontrib>Mao, Xianling</creatorcontrib><creatorcontrib>Chen, Dangyang</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Huang, Rikui</au><au>Wei, Wei</au><au>Qu, Xiaoye</au><au>Xie, Wenfeng</au><au>Mao, Xianling</au><au>Chen, Dangyang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph</atitle><date>2024-01-04</date><risdate>2024</risdate><abstract>Temporal Knowledge Graph (TKG) is an extension of regular knowledge graph by attaching the time scope. Existing temporal knowledge graph question answering (TKGQA) models solely approach simple questions, owing to the prior assumption that each question only contains a single temporal fact with explicit/implicit temporal constraints. Hence, they perform poorly on questions which own multiple temporal facts. In this paper, we propose \textbf{\underline{J}}oint \textbf{\underline{M}}ulti \textbf{\underline{F}}acts \textbf{\underline{R}}easoning \textbf{\underline{N}}etwork (JMFRN), to jointly reasoning multiple temporal facts for accurately answering \emph{complex} temporal questions. Specifically, JMFRN first retrieves question-related temporal facts from TKG for each entity of the given complex question. For joint reasoning, we design two different attention (\ie entity-aware and time-aware) modules, which are suitable for universal settings, to aggregate entities and timestamps information of retrieved facts. Moreover, to filter incorrect type answers, we introduce an additional answer type discrimination task. Extensive experiments demonstrate our proposed method significantly outperforms the state-of-art on the well-known complex temporal question benchmark TimeQuestions.</abstract><doi>10.48550/arxiv.2401.02212</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2401.02212
ispartof
issn
language eng
recordid cdi_arxiv_primary_2401_02212
source arXiv.org
subjects Computer Science - Artificial Intelligence
Computer Science - Computation and Language
title Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T07%3A02%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Joint%20Multi-Facts%20Reasoning%20Network%20For%20Complex%20Temporal%20Question%20Answering%20Over%20Knowledge%20Graph&rft.au=Huang,%20Rikui&rft.date=2024-01-04&rft_id=info:doi/10.48550/arxiv.2401.02212&rft_dat=%3Carxiv_GOX%3E2401_02212%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true