Hierarchical Self-Attention Embedding for Temporal Knowledge Graph Completion
Xin Ren, Luyi Bai, Qianwen Xiao, Xiangxi Meng
Abstract
Temporal Knowledge Graph (TKG) is composed of a series of facts related to timestamps in the real world and has become the basis of many artificial intelligence applications. However, the existing TKG is usually incomplete. It has become a hot research task to infer missing facts based on existing facts in a TKG; namely, Temporal Knowledge Graph Completion (TKGC). The current mainstream TKGC models are embedded models that predict missing facts by representing entities, relations and timestamps as low-dimensional vectors. In order to deal with the TKG structure information, there are some models that try to introduce attention mechanism into the embedding process. But they only consider the structure information of entities or relations, and ignore the structure information of the whole TKG. Moreover, most of them usually treat timestamps as a general feature and cannot take advantage of the potential time series information of the timestamp. To solve these problems, wo propose a new Hierarchical Self-Attention Embedding (HSAE) model which inspired by self-attention mechanism and diachronic embedding technique. For structure information of the whole TKG, we divide the TKG into two layers: entity layer and relation layer, and then apply the self-attention mechanism to the entity layer and relation layer respectively to capture the structure information. For time series information of the timestamp, we capture them by combining positional encoding and diachronic embedding technique into the above two self-attention layers. Finally, we can get the embedded representation vectors of entities, relations and timestamps, which can be combined with other models for better results. We evaluate our model on three TKG datasets: ICEWS14, ICEWS05-15 and GDELT. Experimental results on the TKGC (interpolation) task demonstrate that our model achieves state-of-the-art results.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 681c46d7-bca9-4389-b7d3-21878aa6a394Cited by top-tier papers2
- HGE: Embedding Temporal Knowledge Graphs in a Product Space of Heterogeneous Geometric SubspacesJiaxin Pan, Mojtaba Nayyeri, Yinan Li, Steffen StaabAAAI 2024 · 22 citations
- Online Detection of Anomalies in Temporal Knowledge Graphs with InterpretabilityJiasheng Zhang, Rex Ying, Jie ShaoSIGMOD 2025 · 2 citations
Related papers
- Diachronic Embedding for Temporal Knowledge Graph CompletionRishab Goel, Seyed Mehran Kazemi, Marcus A. Brubaker, Pascal PoupartAAAI 2020 · 423 citations
- Temporal Knowledge Graph Completion Using Box EmbeddingsJohannes Messner, Ralph Abboud, Ismail Ilkan CeylanAAAI 2022 · 138 citations
- HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local LevelHaoran Luo, Haihong E, Yuhao Yang, Yikai Guo et al.ACL 2023 · 11 citations
- Time-dependent Entity Embedding is not All You Need: A Re-evaluation of Temporal Knowledge Graph Completion Models under a Unified FrameworkZhen Han, Gengyuan Zhang, Yunpu Ma, Volker TrespEMNLP 2021 · 18 citations
- Learning to Walk across Time for Interpretable Temporal Knowledge Graph CompletionJaehun Jung, Jinhong Jung, U KangKDD 2021 · 93 citations
