Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs

• URL: http://arxiv.org/abs/2307.10219v3
• Date: Thu, 03 Oct 2024 21:43:43 GMT
• Title: Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs
• Authors: Zifeng Ding, Jingcheng Wu, Jingpei Wu, Yan Xia, Volker Tresp,
• Abstract summary: We propose a new type of data structure named hyper-relational TKG (HTKG) Every fact in an HTKG is coupled with a timestamp explicitly indicating its time validity. To support future research on this topic, we open-source our datasets and model.
• Score: 22.000981176155662
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stemming from traditional knowledge graphs (KGs), hyper-relational KGs (HKGs) provide additional key-value pairs (i.e., qualifiers) for each KG fact that help to better restrict the fact validity. In recent years, there has been an increasing interest in studying graph reasoning over HKGs. Meanwhile, as discussed in recent works that focus on temporal KGs (TKGs), world knowledge is ever-evolving, making it important to reason over temporal facts in KGs. Previous mainstream benchmark HKGs do not explicitly specify temporal information for each HKG fact. Therefore, almost all existing HKG reasoning approaches do not devise any module specifically for temporal reasoning. To better study temporal fact reasoning over HKGs, we propose a new type of data structure named hyper-relational TKG (HTKG). Every fact in an HTKG is coupled with a timestamp explicitly indicating its time validity. We develop two new benchmark HTKG datasets, i.e., Wiki-hy and YAGO-hy, and propose an HTKG reasoning model that efficiently models hyper-relational temporal facts. To support future research on this topic, we open-source our datasets and model.

Related papers

• A Review on Knowledge Graphs for Healthcare: Resources, Applications, and Promises [52.31710895034573]
  This work provides the first comprehensive review of healthcare knowledge graphs (HKGs) It summarizes the pipeline and key techniques for HKG construction, as well as the common utilization approaches. At the application level, we delve into the successful integration of HKGs across various health domains.
  arXiv  Detail & Related papers  (2023-06-07T21:51:56Z)
• A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal [57.8455911689554]
  Knowledge graph reasoning (KGR) aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs) It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc.
  arXiv  Detail & Related papers  (2022-12-12T08:40:04Z)
• 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)
• Reasoning over Multi-view Knowledge Graphs [59.99051368907095]
  ROMA is a novel framework for answering logical queries over multi-view KGs. It scales up to KGs of large sizes (e.g., millions of facts) and fine-granular views. It generalizes to query structures and KG views that are unobserved during training.
  arXiv  Detail & Related papers  (2022-09-27T21:32:20Z)
• Explainable Sparse Knowledge Graph Completion via High-order Graph Reasoning Network [111.67744771462873]
  This paper proposes a novel explainable model for sparse Knowledge Graphs (KGs) It combines high-order reasoning into a graph convolutional network, namely HoGRN. It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability.
  arXiv  Detail & Related papers  (2022-07-14T10:16:56Z)
• Learning Meta Representations of One-shot Relations for Temporal Knowledge Graph Link Prediction [33.36701435886095]
  Few-shot relational learning for static knowledge graphs (KGs) has drawn greater interest in recent years. TKGs contain rich temporal information, thus requiring temporal reasoning techniques for modeling. This poses a greater challenge in learning few-shot relations in the temporal context.
  arXiv  Detail & Related papers  (2022-05-21T15:17:52Z)
• EvoKG: Jointly Modeling Event Time and Network Structure for Reasoning over Temporal Knowledge Graphs [25.408246523764085]
  Reasoning over temporal knowledge graphs (TKGs) is crucial for many applications to provide intelligent services. We present a problem formulation that unifies the two major problems that need to be addressed for an effective reasoning over TKGs, namely, modeling the event time and the evolving network structure. Our proposed method EvoKG jointly models both tasks in an effective framework, which captures the ever-changing structural and temporal dynamics in TKGs.
  arXiv  Detail & Related papers  (2022-02-15T18:49:53Z)
• Hyperbolic Temporal Knowledge Graph Embeddings with Relational and Time Curvatures [0.12891210250935145]
  More and more works consider time as a parameter to complete Knowledge Graphs (KGs) We first demonstrate that, by simply increasing the number of negative samples, the recent AttH model can achieve competitive or even better performance than the state-of-the-art on Temporal KGs (TKGs) Our experiments show that both Hercules and AttH achieve competitive or new state-of-the-art performances on ICEWS04 and ICEWS05-15 datasets.
  arXiv  Detail & Related papers  (2021-06-08T13:13:43Z)
• 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)
• 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)
• TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion [45.588053447288566]
  Inferring missing facts in temporal knowledge graphs (TKGs) is a fundamental and challenging task. We propose the Temporal Message Passing (TeMP) framework to address these challenges by combining graph neural networks, temporal dynamics models, data imputation and frequency-based gating techniques.
  arXiv  Detail & Related papers  (2020-10-07T17:11:53Z)
• TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotation [12.138550487430807]
  We present a new approach of TKG embedding, TeRo, which defines the temporal evolution of entity embedding. We show our proposed model overcomes the limitations of the existing KG embedding models and TKG embedding models. Experimental results on four different TKGs show that TeRo significantly outperforms existing state-of-the-art models for link prediction.
  arXiv  Detail & Related papers  (2020-10-02T14:35:27Z)

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.