CognTKE: A Cognitive Temporal Knowledge Extrapolation Framework

• URL: http://arxiv.org/abs/2412.16557v1
• Date: Sat, 21 Dec 2024 09:50:55 GMT
• Title: CognTKE: A Cognitive Temporal Knowledge Extrapolation Framework
• Authors: Wei Chen, Yuting Wu, Shuhan Wu, Zhiyu Zhang, Mengqi Liao, Youfang Lin, Huaiyu Wan,
• Abstract summary: Motivated by the Dual Process Theory in cognitive science, we propose a textbfCognitive textbfTemporal textbfKnowledge textbfExtrapolation framework (CognTKE) CognTKE introduces a novel temporal cognitive relation directed graph (TCR-Digraph) and performs interpretable global shallow reasoning and local deep reasoning over the TCR-Digraph. The experimental results on four benchmark datasets demonstrate that CognTKE achieves significant improvement in accuracy compared to the state-of-the
• Score: 28.9250547012577
• License:
• Abstract: Reasoning future unknowable facts on temporal knowledge graphs (TKGs) is a challenging task, holding significant academic and practical values for various fields. Existing studies exploring explainable reasoning concentrate on modeling comprehensible temporal paths relevant to the query. Yet, these path-based methods primarily focus on local temporal paths appearing in recent times, failing to capture the complex temporal paths in TKG and resulting in the loss of longer historical relations related to the query. Motivated by the Dual Process Theory in cognitive science, we propose a \textbf{Cogn}itive \textbf{T}emporal \textbf{K}nowledge \textbf{E}xtrapolation framework (CognTKE), which introduces a novel temporal cognitive relation directed graph (TCR-Digraph) and performs interpretable global shallow reasoning and local deep reasoning over the TCR-Digraph. Specifically, the proposed TCR-Digraph is constituted by retrieving significant local and global historical temporal relation paths associated with the query. In addition, CognTKE presents the global shallow reasoner and the local deep reasoner to perform global one-hop temporal relation reasoning (System 1) and local complex multi-hop path reasoning (System 2) over the TCR-Digraph, respectively. The experimental results on four benchmark datasets demonstrate that CognTKE achieves significant improvement in accuracy compared to the state-of-the-art baselines and delivers excellent zero-shot reasoning ability. \textit{The code is available at https://github.com/WeiChen3690/CognTKE}.

Related papers

• Path-of-Thoughts: Extracting and Following Paths for Robust Relational Reasoning with Large Language Models [62.12031550252253]
  We present Path-of-Thoughts (PoT), a novel framework designed to tackle relation reasoning. PoT efficiently extracts a task-agnostic graph that identifies crucial entities, relations, and attributes within the problem context. PoT identifies relevant reasoning chains within the graph corresponding to the posed question, facilitating inference of potential answers.
  arXiv  Detail & Related papers  (2024-12-23T20:27:12Z)
• 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)
• Large Language Models-guided Dynamic Adaptation for Temporal Knowledge Graph Reasoning [87.10396098919013]
  Large Language Models (LLMs) have demonstrated extensive knowledge and remarkable proficiency in temporal reasoning. We propose a Large Language Models-guided Dynamic Adaptation (LLM-DA) method for reasoning on Temporal Knowledge Graphs. LLM-DA harnesses the capabilities of LLMs to analyze historical data and extract temporal logical rules.
  arXiv  Detail & Related papers  (2024-05-23T04:54:37Z)
• Historically Relevant Event Structuring for Temporal Knowledge Graph Reasoning [5.510391547468202]
  Temporal Knowledge Graph (TKG) reasoning focuses on predicting events through historical information within snapshots distributed on a timeline. We propose an innovative TKG reasoning approach towards textbfHistorically textbfRelevant textbfEvents textbfStructuring ($mathsfHisRES$)
  arXiv  Detail & Related papers  (2024-05-17T08:33:43Z)
• Enhancing Systematic Decompositional Natural Language Inference Using Informal Logic [51.967603572656266]
  We introduce a consistent and theoretically grounded approach to annotating decompositional entailment. We find that our new dataset, RDTE, has a substantially higher internal consistency (+9%) than prior decompositional entailment datasets. We also find that training an RDTE-oriented entailment classifier via knowledge distillation and employing it in an entailment tree reasoning engine significantly improves both accuracy and proof quality.
  arXiv  Detail & Related papers  (2024-02-22T18:55:17Z)
• Conflict Detection for Temporal Knowledge Graphs:A Fast Constraint Mining Algorithm and New Benchmarks [21.152721572830373]
  We propose a pattern-based temporal constraint mining method, PaTeCon. We show how this method can be optimized to achieve significant speed improvement. We also annotate Wikidata and Freebase to build two new benchmarks for conflict detection.
  arXiv  Detail & Related papers  (2023-12-18T09:35:43Z)
• Search to Pass Messages for Temporal Knowledge Graph Completion [97.40256786473516]
  We propose to use neural architecture search (NAS) to design data-specific message passing architecture for temporal knowledge graphs (TKGs) completion. In particular, we develop a generalized framework to explore topological and temporal information in TKGs. We adopt a search algorithm, which trains a supernet structure by sampling single path for efficient search with less cost.
  arXiv  Detail & Related papers  (2022-10-30T04:05:06Z)
• 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)
• Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs [19.851986862305623]
  We propose a temporal question answering method, SF-TQA, which generates query graphs by exploring the relevant facts of mentioned entities. Our evaluations show that SF-TQA significantly outperforms existing methods on two benchmarks over different knowledge graphs.
  arXiv  Detail & Related papers  (2022-10-10T08:40:28Z)
• T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion [13.209193437124881]
  Temporal knowledge graphs (TKGs) inherently reflect the transient nature of real-world knowledge, as opposed to static knowledge graphs. We propose T-GAP, a novel model for TKG completion that maximally utilizes both temporal information and graph structure in its encoder and decoder. Our experiments demonstrate that T-GAP achieves superior performance against state-of-the-art baselines, and competently generalizes to queries with unseen timestamps.
  arXiv  Detail & Related papers  (2020-12-19T04:45:32Z)
• One-shot Learning for Temporal Knowledge Graphs [49.41854171118697]
  We propose a one-shot learning framework for link prediction in temporal knowledge graphs. Our proposed method employs a self-attention mechanism to effectively encode temporal interactions between entities. Our experiments show that the proposed algorithm outperforms the state of the art baselines for two well-studied benchmarks.
  arXiv  Detail & Related papers  (2020-10-23T03:24:44Z)

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.