SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2408.06603 · ACL · 2024

Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion

Hang Gao, Ming Jiang, Mengting Hu, Jianfeng Wu, Yalan Xie, Renhong Cheng, Zhunheng Wang, Xiaoyi Liu, Rui Ying, Linlin Zhang, Iran Afghanistan, Obama Barack, and 1 more

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

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. TCom-poundE, 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/nkruiying/TCompoundE.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2408.06603")
get_code_for_paper("2408.06603")
have("2408.06603")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2408.06603.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2408.06603.svg)](https://syntology.ai/paper/2408.06603)

Connect an agent — have() is free.