arrow
Return

Temporal knowledge graph completion via local–global contrastive embedding learning

delete2026-07-14
delete0
delete
OA
AI
B
Bo Zhu
R
Rong Yuan
C
Chao Deng
Y
Yanlei Yin *
R
Raymond Chiong *
DOI:10.1016/j.neucom.2026.134499delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Temporal knowledge graphs (TKGs) consist of timestamped facts and serve as a core substrate for many AI applications; their completeness directly influences downstream performance. However, real-world TKGs are typically incomplete, making the inference of missing facts from observed ones a central research problem. Current temporal knowledge graph completion (TKGC) methods predominantly rely on embedding-based models that map entities, relations, and timestamps into low-dimensional vector spaces to predict missing facts. Although attention mechanisms have been employed to encode structural information, most approaches focus on local neighborhoods around entities or relations, thereby overlooking the global graph structure and under-exploiting temporal patterns at multiple time scales. To address these limitations, a new TKGC model based on local-global contrastive embedding is introduced. At the global level, self-attention is used to encode entities and relations to capture long-range structural dependencies across the graph. At the local level, positional encodings and temporal-duration embeddings are integrated with self-attention layers to mine fine-grained temporal signals carried by timestamps, enabling a comprehensive characterization of how entities and relations evolve over time. In addition, inspired by contrastive learning, global structural representations are contrasted and fused with local temporal representations, which effectively align and strengthen entity and relation embeddings. Evaluations on three widely used benchmarks—ICEWS14, ICEWS05-15, and GDELT—demonstrate consistently strong performance across metrics, confirming the robustness of the proposed approach for TKGC.
Keywords:
Temporal knowledge graphs
Knowledge graph completion
Contrastive learning
Self-attention

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

U
university of new england
Scholars:
691
Papers: 389
Citations: 0
K
kunming university of science and technology
Scholars:
5.8K
Papers: 1.6K
Citations: 0
Cited Papers

Cited Papers

From co-occurrence to coherence: Quantum-informed representation learning for knowledge graph completion
err2026-01-24
err0
PREAI
errMankun Zhao; Bingtao Xu; Jiujiang Guo; Jian Yu; Tianyi Xu; Mei Yu
errShare
errSave
HCKGL: Hyperbolic collaborative knowledge graph learning for recommendation
err2025-06-14
err0
PREAI
errHu, Huijuan; He, Chaobo; Chen, Xinran; Guan, Quanlong
errShare
errSave
errShare
errSave
Tucker decomposition-based temporal knowledge graph completion
err2022-02-01
err61
errOAAI
errShao, Pengpeng; Zhang, Dawei; Yang, Guohua; Tao, Jianhua; Che, Feihu; Liu, Tong
errShare
errSave
Sparse temporal knowledge graph completion based on path imitation
err2025-04-01
err0
PREAI
errHu, Jiahui; Bai, Luyi; Shang, Xuemeng; Feng, Guangchen; Gao, Yang
errShare
errSave
researcher View more