RLGNet: Repeating-Local-Global History Network for Temporal Knowledge Graph Reasoning
- URL: http://arxiv.org/abs/2404.00586v1
- Date: Sun, 31 Mar 2024 07:19:29 GMT
- Title: RLGNet: Repeating-Local-Global History Network for Temporal Knowledge Graph Reasoning
- Authors: Ao Lv, Yongzhong Huang, Guige Ouyang, Yue Chen, Haoran Xie,
- Abstract summary: Temporal Knowledge Graph (TKG) reasoning is based on historical information to predict the future.
Most existing methods fail to concurrently address and comprehend historical information from both global and local perspectives.
We propose textbfRepetitive-textbfLocal-textbfGlobal History textbfNetwork(RLGNet)
- Score: 9.576427721924533
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Temporal Knowledge Graph (TKG) reasoning is based on historical information to predict the future. Therefore, parsing and mining historical information is key to predicting the future. Most existing methods fail to concurrently address and comprehend historical information from both global and local perspectives. Neglecting the global view might result in overlooking macroscopic trends and patterns, while ignoring the local view can lead to missing critical detailed information. Additionally, some methods do not focus on learning from high-frequency repeating events, which means they may not fully grasp frequently occurring historical events. To this end, we propose the \textbf{R}epetitive-\textbf{L}ocal-\textbf{G}lobal History \textbf{Net}work(RLGNet). We utilize a global history encoder to capture the overarching nature of historical information. Subsequently, the local history encoder provides information related to the query timestamp. Finally, we employ the repeating history encoder to identify and learn from frequently occurring historical events. In the evaluation on six benchmark datasets, our approach generally outperforms existing TKG reasoning models in multi-step and single-step reasoning tasks.
Related papers
- HIP Network: Historical Information Passing Network for Extrapolation
Reasoning on Temporal Knowledge Graph [14.832067253514213]
We propose the Historical Information Passing (HIP) network to predict future events.
Our method considers the updating of relation representations and adopts three scoring functions corresponding to the above dimensions.
Experimental results on five benchmark datasets show the superiority of HIP network.
arXiv Detail & Related papers (2024-02-19T11:50:30Z) - Local-Global History-aware Contrastive Learning for Temporal Knowledge
Graph Reasoning [25.497749629866757]
We propose a novel blueLocal-blueglobal history-aware blueContrastive blueL model (blueLogCL) for temporal knowledge graphs.
For the first challenge, LogCL proposes an entity-aware attention mechanism applied to the local and global historical facts encoder.
For the latter issue, LogCL designs four historical query contrast patterns, effectively improving the robustness of the model.
arXiv Detail & Related papers (2023-12-04T03:27:01Z) - SCTc-TE: A Comprehensive Formulation and Benchmark for Temporal Event Forecasting [63.01035584154509]
We develop a fully automated pipeline and construct a large-scale dataset named MidEast-TE from about 0.6 million news articles.
This dataset focuses on the cooperation and conflict events among countries mainly in the MidEast region from 2015 to 2022.
We propose a novel method LoGo that is able to take advantage of both Local and Global contexts for SCTc-TE forecasting.
arXiv Detail & Related papers (2023-12-02T07:40:21Z) - Temporal Inductive Path Neural Network for Temporal Knowledge Graph
Reasoning [16.984588879938947]
Reasoning on Temporal Knowledge Graph (TKG) aims to predict future facts based on historical occurrences.
Most existing approaches model TKGs relying on entity modeling, as nodes in the graph play a crucial role in knowledge representation.
We propose Temporal Inductive Path Neural Network (TiPNN), which models historical information in an entity-independent perspective.
arXiv Detail & Related papers (2023-09-06T17:37:40Z) - Exploring the Limits of Historical Information for Temporal Knowledge
Graph Extrapolation [59.417443739208146]
We propose a new event forecasting model based on a novel training framework of historical contrastive learning.
CENET learns both the historical and non-historical dependency to distinguish the most potential entities.
We evaluate our proposed model on five benchmark graphs.
arXiv Detail & Related papers (2023-08-29T03:26:38Z) - History-Aware Hierarchical Transformer for Multi-session Open-domain
Dialogue System [59.78425104243993]
We propose History-Aware Hierarchical Transformer (HAHT) for multi-session open-domain dialogue.
HAHT maintains a long-term memory of history conversations and utilizes history information to understand current conversation context.
Experimental results on a large-scale Multi-Session Conversation dataset suggest that the proposed HAHT model consistently outperforms baseline models.
arXiv Detail & Related papers (2023-02-02T06:54:33Z) - Temporal Knowledge Graph Reasoning with Historical Contrastive Learning [24.492458924487863]
We propose a new event forecasting model called Contrastive Event Network (CENET)
CENET learns both the historical and non-historical dependency to distinguish the most potential entities that can best match the given query.
During the inference process, CENET employs a mask-based strategy to generate the final results.
arXiv Detail & Related papers (2022-11-20T08:32:59Z) - HiSMatch: Historical Structure Matching based Temporal Knowledge Graph
Reasoning [59.38797474903334]
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.
arXiv Detail & Related papers (2022-10-18T09:39:26Z) - Search from History and Reason for Future: Two-stage Reasoning on
Temporal Knowledge Graphs [56.33651635705633]
We propose CluSTeR to predict future facts in a two-stage manner, Clue Searching and Temporal Reasoning.
CluSTeR learns a beam search policy via reinforcement learning (RL) to induce multiple clues from historical facts.
At the temporal reasoning stage, it adopts a graph convolution network based sequence method to deduce answers from clues.
arXiv Detail & Related papers (2021-06-01T09:01:22Z) - A Graph-guided Multi-round Retrieval Method for Conversational
Open-domain Question Answering [52.041815783025186]
We propose a novel graph-guided retrieval method to model the relations among answers across conversation turns.
We also propose to incorporate the multi-round relevance feedback technique to explore the impact of the retrieval context on current question understanding.
arXiv Detail & Related papers (2021-04-17T04:39:41Z)
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.