ChronoR: Rotation Based Temporal Knowledge Graph Embedding

• URL: http://arxiv.org/abs/2103.10379v1
• Date: Thu, 18 Mar 2021 17:08:33 GMT
• Title: ChronoR: Rotation Based Temporal Knowledge Graph Embedding
• Authors: Ali Sadeghian, Mohammadreza Armandpour, Anthony Colas, Daisy Zhe Wang
• Abstract summary: We study the challenging problem of inference over temporal knowledge graphs. We propose Chronological Rotation embedding (ChronoR), a novel model for learning representations for entities, relations, and time. ChronoR is able to outperform many of the state-of-the-art methods on the benchmark datasets for temporal knowledge graph link prediction.
• Score: 8.039202293739185
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Despite the importance and abundance of temporal knowledge graphs, most of the current research has been focused on reasoning on static graphs. In this paper, we study the challenging problem of inference over temporal knowledge graphs. In particular, the task of temporal link prediction. In general, this is a difficult task due to data non-stationarity, data heterogeneity, and its complex temporal dependencies. We propose Chronological Rotation embedding (ChronoR), a novel model for learning representations for entities, relations, and time. Learning dense representations is frequently used as an efficient and versatile method to perform reasoning on knowledge graphs. The proposed model learns a k-dimensional rotation transformation parametrized by relation and time, such that after each fact's head entity is transformed using the rotation, it falls near its corresponding tail entity. By using high dimensional rotation as its transformation operator, ChronoR captures rich interaction between the temporal and multi-relational characteristics of a Temporal Knowledge Graph. Experimentally, we show that ChronoR is able to outperform many of the state-of-the-art methods on the benchmark datasets for temporal knowledge graph link prediction.

Related papers

• 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)
• TimeGraphs: Graph-based Temporal Reasoning [64.18083371645956]
  TimeGraphs is a novel approach that characterizes dynamic interactions as a hierarchical temporal graph. Our approach models the interactions using a compact graph-based representation, enabling adaptive reasoning across diverse time scales. We evaluate TimeGraphs on multiple datasets with complex, dynamic agent interactions, including a football simulator, the Resistance game, and the MOMA human activity dataset.
  arXiv  Detail & Related papers  (2024-01-06T06:26:49Z)
• Temporal Smoothness Regularisers for Neural Link Predictors [8.975480841443272]
  We show that a simple method like TNTComplEx can produce significantly more accurate results than state-of-the-art methods. We also evaluate the impact of a wide range of temporal smoothing regularisers on two state-of-the-art temporal link prediction models.
  arXiv  Detail & Related papers  (2023-09-16T16:52:49Z)
• Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment [53.72873672076391]
  Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information. We propose a self-supervised method called S2T for temporal graph learning, which extracts both temporal and structural information. S2T achieves at most 10.13% performance improvement compared with the state-of-the-art competitors on several datasets.
  arXiv  Detail & Related papers  (2023-02-15T06:36:04Z)
• DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graph [59.583555454424]
  We propose a novel disenTangled representation learning framework for discrete-time Dynamic graphs, namely DyTed. We specially design a temporal-clips contrastive learning task together with a structure contrastive learning to effectively identify the time-invariant and time-varying representations respectively.
  arXiv  Detail & Related papers  (2022-10-19T14:34:12Z)
• 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)
• RotateQVS: Representing Temporal Information as Rotations in Quaternion Vector Space for Temporal Knowledge Graph Completion [21.587197001067043]
  We propose a novel temporal modeling method which represents temporal entities as Rotations in Quaternion Vector Space (RotateQVS) and relations as complex vectors in Hamilton's quaternion space. Our method can boost the performance of link prediction tasks over four temporal knowledge graph benchmarks.
  arXiv  Detail & Related papers  (2022-03-15T15:27:23Z)
• Temporal Contrastive Graph Learning for Video Action Recognition and Retrieval [83.56444443849679]
  This work takes advantage of the temporal dependencies within videos and proposes a novel self-supervised method named Temporal Contrastive Graph Learning (TCGL) Our TCGL roots in a hybrid graph contrastive learning strategy to jointly regard the inter-snippet and intra-snippet temporal dependencies as self-supervision signals for temporal representation learning. Experimental results demonstrate the superiority of our TCGL over the state-of-the-art methods on large-scale action recognition and video retrieval benchmarks.
  arXiv  Detail & Related papers  (2021-01-04T08:11:39Z)
• Time-aware Graph Embedding: A temporal smoothness and task-oriented approach [9.669206664225234]
  This paper presents a Robustly Time-aware Graph Embedding (RTGE) method by incorporating temporal smoothness. At first, RTGE integrates a measure of temporal smoothness in the learning process of the time-aware graph embedding. Secondly, RTGE provides a general task-oriented negative sampling strategy associated with temporally-aware information.
  arXiv  Detail & Related papers  (2020-07-22T02:20:25Z)
• Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks [91.65637773358347]
  We propose a general graph neural network framework designed specifically for multivariate time series data. Our approach automatically extracts the uni-directed relations among variables through a graph learning module. Our proposed model outperforms the state-of-the-art baseline methods on 3 of 4 benchmark datasets.
  arXiv  Detail & Related papers  (2020-05-24T04:02:18Z)
• A Heterogeneous Graph with Factual, Temporal and Logical Knowledge for Question Answering Over Dynamic Contexts [81.4757750425247]
  We study question answering over a dynamic textual environment. We develop a graph neural network over the constructed graph, and train the model in an end-to-end manner.
  arXiv  Detail & Related papers  (2020-04-25T04:53:54Z)

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.