Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion

Rui Ying, Mengting Hu, Jianfeng Wu, Yalan Xie, Xiaoyi Liu +5 more
8/13/2024
cs.AI

Official code: nk-ruiying/TCompoundE (16 stars, last commit 2024-09-09).

Abstract

Temporal knowledge graph completion aims to infer the missing facts in temporal knowledge graphs. Current approaches usually embed factual knowledge into continuous vector space and apply geometric operations to learn potential patterns in temporal knowledge graphs. However, these methods only adopt a single operation, which may have limitations in capturing the complex temporal dynamics present in temporal knowledge graphs. Therefore, we propose a simple but effective method, i.e. TCompoundE, which is specially designed with two geometric operations, including time-specific and relation-specific operations. We provide mathematical proofs to demonstrate the ability of TCompoundE to encode various relation patterns. Experimental results show that our proposed model significantly outperforms existing temporal knowledge graph embedding models. Our code is available at https://github.com/nk-ruiying/TCompoundE.

View on arXivView PDF

Code Implementations(1)

166PythonFeb 16, 20242 years ago

Similar Papers

Cite this paper

@article{ying2024simple,
  title  = {Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion},
  author = {Rui Ying and Mengting Hu and Jianfeng Wu and Yalan Xie and Xiaoyi Liu and Zhunheng Wang and Ming Jiang and Hang Gao and Linlin Zhang and Renhong Cheng},
  year   = {2024},
  eprint = {2408.06603},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.06603v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.06603.svg)](https://codeofpaper.com/paper/2408.06603)

Discussion