HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning

• URL: http://arxiv.org/abs/2210.09708v1
• Date: Tue, 18 Oct 2022 09:39:26 GMT
• Title: HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning
• Authors: Zixuan Li, Zhongni Hou, Saiping Guan, Xiaolong Jin, Weihua Peng, Long Bai, Yajuan Lyu, Wei Li, Jiafeng Guo, Xueqi Cheng
• Abstract summary: This paper proposes the textbfHistorical textbfStructure textbfMatching (textbfHiSMatch) model. It applies two structure encoders to capture the semantic information contained in the historical structures of the query and candidate entities. Experiments on six benchmark datasets demonstrate the significant improvement of the proposed HiSMatch model, with up to 5.6% performance improvement in MRR, compared to the state-of-the-art baselines.
• Score: 59.38797474903334
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A Temporal Knowledge Graph (TKG) is a sequence of KGs with respective timestamps, which adopts quadruples in the form of (\emph{subject}, \emph{relation}, \emph{object}, \emph{timestamp}) to describe dynamic facts. TKG reasoning has facilitated many real-world applications via answering such queries as (\emph{query entity}, \emph{query relation}, \emph{?}, \emph{future timestamp}) about future. This is actually a matching task between a query and candidate entities based on their historical structures, which reflect behavioral trends of the entities at different timestamps. In addition, recent KGs provide background knowledge of all the entities, which is also helpful for the matching. Thus, in this paper, we propose the \textbf{Hi}storical \textbf{S}tructure \textbf{Match}ing (\textbf{HiSMatch}) model. It applies two structure encoders to capture the semantic information contained in the historical structures of the query and candidate entities. Besides, it adopts another encoder to integrate the background knowledge into the model. TKG reasoning experiments on six benchmark datasets demonstrate the significant improvement of the proposed HiSMatch model, with up to 5.6\% performance improvement in MRR, compared to the state-of-the-art baselines.

Related papers

• TIGER: Temporally Improved Graph Entity Linker [6.111040278075022]
  textbfTIGER: a textbfTemporally textbfImproved textbfGraph textbfEntity Linketextbfr. We introduce textbfTIGER: a textbfTemporally textbfImproved textbfGraph textbfEntity Linketextbfr. We enhance the learned representation, making entities
  arXiv  Detail & Related papers  (2024-10-11T09:44:33Z)
• Learning Granularity Representation for Temporal Knowledge Graph Completion [2.689675451882683]
  Temporal Knowledge Graphs (TKGs) incorporate temporal information to reflect the dynamic structural knowledge and evolutionary patterns of real-world facts. This paper proposes textbfLearning textbfGranularity textbfRepresentation (termed $mathsfLGRe$) for TKG completion. It comprises two main components: Granularity Learning (GRL) and Adaptive Granularity Balancing (AGB)
  arXiv  Detail & Related papers  (2024-08-27T08:19:34Z)
• Once Upon a $\textit{Time}$ in $\textit{Graph}$: Relative-Time Pretraining for Complex Temporal Reasoning [96.03608822291136]
  We make use of the underlying nature of time, and suggest creating a graph structure based on the relative placements of events along the time axis. Inspired by the graph view, we propose RemeMo, which explicitly connects all temporally-scoped facts by modeling the time relations between any two sentences. Experimental results show that RemeMo outperforms the baseline T5 on multiple temporal question answering datasets.
  arXiv  Detail & Related papers  (2023-10-23T08:49:00Z)
• More than Classification: A Unified Framework for Event Temporal Relation Extraction [61.44799147458621]
  Event temporal relation extraction(ETRE) is usually formulated as a multi-label classification task. We observe that all relations can be interpreted using the start and end time points of events. We propose a unified event temporal relation extraction framework, which transforms temporal relations into logical expressions of time points.
  arXiv  Detail & Related papers  (2023-05-28T02:09:08Z)
• Adaptive Path-Memory Network for Temporal Knowledge Graph Reasoning [25.84105067110878]
  Temporal knowledge graph (TKG) reasoning aims to predict the future missing facts based on historical information. We propose a novel architecture modeling with relation feature of TKG, namely aDAptivE path-MemOry Network (DaeMon) DaeMon adaptively models the temporal path information between query subject and each object candidate across history time.
  arXiv  Detail & Related papers  (2023-04-25T06:33:08Z)
• Time-aware Multiway Adaptive Fusion Network for Temporal Knowledge Graph Question Answering [10.170042914522778]
  We propose a novel textbfTime-aware textbfMultiway textbfAdaptive (textbfTMA) fusion network. For each given question, TMA first extracts the relevant concepts from the KG, and then feeds them into a multiway adaptive module. This representation can be incorporated with the pre-trained KG embedding to generate the final prediction.
  arXiv  Detail & Related papers  (2023-02-24T09:29:40Z)
• 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)
• Long Document Summarization with Top-down and Bottom-up Inference [113.29319668246407]
  We propose a principled inference framework to improve summarization models on two aspects. Our framework assumes a hierarchical latent structure of a document where the top-level captures the long range dependency. We demonstrate the effectiveness of the proposed framework on a diverse set of summarization datasets.
  arXiv  Detail & Related papers  (2022-03-15T01:24:51Z)
• Temporal Knowledge Graph Reasoning Based on Evolutional Representation Learning [59.004025528223025]
  Key to predict future facts is to thoroughly understand the historical facts. A TKG is actually a sequence of KGs corresponding to different timestamps. We propose a novel Recurrent Evolution network based on Graph Convolution Network (GCN)
  arXiv  Detail & Related papers  (2021-04-21T05:12:21Z)

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.