Hyperbolic Temporal Knowledge Graph Embeddings with Relational and Time Curvatures

• URL: http://arxiv.org/abs/2106.04311v1
• Date: Tue, 8 Jun 2021 13:13:43 GMT
• Title: Hyperbolic Temporal Knowledge Graph Embeddings with Relational and Time Curvatures
• Authors: Sebastien Montella, Lina Rojas-Barahona, Johannes Heinecke
• Abstract summary: 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.
• Score: 0.12891210250935145
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Knowledge Graph (KG) completion has been excessively studied with a massive number of models proposed for the Link Prediction (LP) task. The main limitation of such models is their insensitivity to time. Indeed, the temporal aspect of stored facts is often ignored. To this end, more and more works consider time as a parameter to complete KGs. In this paper, 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), albeit its nontemporality. We further propose Hercules, a time-aware extension of AttH model, which defines the curvature of a Riemannian manifold as the product of both relation and time. Our experiments show that both Hercules and AttH achieve competitive or new state-of-the-art performances on ICEWS04 and ICEWS05-15 datasets. Therefore, one should raise awareness when learning TKGs representations to identify whether time truly boosts performances.

Related papers

• Towards Foundation Model on Temporal Knowledge Graph Reasoning [17.165969719351125]
  Temporal Knowledge Graphs (TKGs) store temporal facts with quadruple formats (s, p, o, t)<n>New model employs sinusoidal positional encodings to capture fine-grained temporal patterns.<n>PostRA demonstrates strong zero-shot performance on unseen temporal knowledge graphs.
  arXiv  Detail & Related papers  (2025-06-04T09:19:49Z)
• VITA: Versatile Time Representation Learning for Temporal Hyper-Relational Knowledge Graphs [2.1475990419358255]
  The temporal validity of facts often serves as a strong clue in downstream link prediction tasks.<n>We propose VITA, a versatile time representation that can flexibly accommodate all four types of temporal validity of facts.<n>We show that VITA outperforms the best-performing baselines in various link prediction tasks.
  arXiv  Detail & Related papers  (2025-05-17T03:16:13Z)
• TPP-Gaze: Modelling Gaze Dynamics in Space and Time with Neural Temporal Point Processes [63.95928298690001]
  We present TPP-Gaze, a novel and principled approach to model scanpath dynamics based on Neural Temporal Point Process (TPP) Our results show the overall superior performance of the proposed model compared to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-10-30T19:22:38Z)
• 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)
• Temporal Knowledge Graph Completion with Time-sensitive Relations in Hypercomplex Space [20.235189945656927]
  Temporal knowledge graph completion (TKGC) aims to fill in missing facts within a given temporal knowledge graph at a specific time. This paper advances beyond conventional approaches by introducing more expressive quaternion representations for TKGC within hypercomplex space.
  arXiv  Detail & Related papers  (2024-03-02T16:50:48Z)
• ChiroDiff: Modelling chirographic data with Diffusion Models [132.5223191478268]
  We introduce a powerful model-class namely "Denoising Diffusion Probabilistic Models" or DDPMs for chirographic data. Our model named "ChiroDiff", being non-autoregressive, learns to capture holistic concepts and therefore remains resilient to higher temporal sampling rate.
  arXiv  Detail & Related papers  (2023-04-07T15:17:48Z)
• A Self-supervised Riemannian GNN with Time Varying Curvature for Temporal Graph Learning [79.20249985327007]
  We present a novel self-supervised Riemannian graph neural network (SelfRGNN) Specifically, we design a curvature-varying GNN with a theoretically grounded time encoding, and formulate a functional curvature over time to model the evolvement shifting among the positive, zero and negative curvature spaces. Extensive experiments show the superiority of SelfRGNN, and moreover, the case study shows the time-varying curvature of temporal graph in reality.
  arXiv  Detail & Related papers  (2022-08-30T08:43:06Z)
• Temporal Knowledge Graph Reasoning with Low-rank and Model-agnostic Representations [1.8262547855491458]
  We introduce Time-LowFER, a family of parameter-efficient and time-aware extensions of the low-rank tensor factorization model LowFER. Noting several limitations in current approaches to represent time, we propose a cycle-aware time-encoding scheme for time features. We implement our methods in a unified temporal knowledge graph embedding framework, focusing on time-sensitive data processing.
  arXiv  Detail & Related papers  (2022-04-10T22:24:11Z)
• 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)
• 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)
• Interval-censored Hawkes processes [82.87738318505582]
  We propose a model to estimate the parameters of a Hawkes process in interval-censored settings. We show how a non-homogeneous approximation to the Hawkes admits a tractable likelihood in the interval-censored setting.
  arXiv  Detail & Related papers  (2021-04-16T07:29:04Z)
• 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)
• Learn to cycle: Time-consistent feature discovery for action recognition [83.43682368129072]
  Generalizing over temporal variations is a prerequisite for effective action recognition in videos. We introduce Squeeze Re Temporal Gates (SRTG), an approach that favors temporal activations with potential variations. We show consistent improvement when using SRTPG blocks, with only a minimal increase in the number of GFLOs.
  arXiv  Detail & Related papers  (2020-06-15T09:36:28Z)

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.