TY - GEN
T1 - A Temporal Knowledge Graph Completion Model Based on Contrastive Learning and Relation Dependency Enhancement Method
AU - Huang, Wei
AU - Liu, Hai
AU - Yan, Enliang
AU - Wang, Fu Lee
AU - Hao, Tianyong
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
PY - 2025
Y1 - 2025
N2 - Temporal Knowledge Graphs (TKG) store events that evolve dynamically over time. Due to the inherent incompleteness of TKGs, Temporal Knowledge Graph Completion (TKGC) is required to predict missing facts and complete the knowledge graph. Existing TKGC methods overlook the structural similarities between different entities and fail to fully exploit the structural dependencies of relations. Therefore, this paper proposes a relation-symmetric structure contrastive learning with relation-aware masking for temporal knowledge graph completion (SyM-TKGC). The method identifies semantically similar entities through relation-symmetry patterns and enhances their representations via contrastive learning. Additionally, we employ relation co-occurrence graphs to capture structural dependencies while applying stochastic edge masking to suppress irrelevant connections, thereby preventing over-reliance on non-causal relation patterns. Experimental results demonstrate that the SyM-TGKC model achieves superior MRR performance on three benchmark datasets, with improvements of 1.84%, 1.47%, and 23.7% over existing methods, thereby achieving state-of-the-art performance.
AB - Temporal Knowledge Graphs (TKG) store events that evolve dynamically over time. Due to the inherent incompleteness of TKGs, Temporal Knowledge Graph Completion (TKGC) is required to predict missing facts and complete the knowledge graph. Existing TKGC methods overlook the structural similarities between different entities and fail to fully exploit the structural dependencies of relations. Therefore, this paper proposes a relation-symmetric structure contrastive learning with relation-aware masking for temporal knowledge graph completion (SyM-TKGC). The method identifies semantically similar entities through relation-symmetry patterns and enhances their representations via contrastive learning. Additionally, we employ relation co-occurrence graphs to capture structural dependencies while applying stochastic edge masking to suppress irrelevant connections, thereby preventing over-reliance on non-causal relation patterns. Experimental results demonstrate that the SyM-TGKC model achieves superior MRR performance on three benchmark datasets, with improvements of 1.84%, 1.47%, and 23.7% over existing methods, thereby achieving state-of-the-art performance.
KW - Contrastive Learning
KW - Link Prediction
KW - Temporal Knowledge Graph Completion
UR - https://www.scopus.com/pages/publications/105022684238
U2 - 10.1007/978-981-95-3739-6_1
DO - 10.1007/978-981-95-3739-6_1
M3 - Conference contribution
AN - SCOPUS:105022684238
SN - 9789819537389
T3 - Communications in Computer and Information Science
SP - 3
EP - 17
BT - Neural Computing for Advanced Applications - 6th International Conference, NCAA 2025, Proceedings
A2 - Zhang, Haijun
A2 - Tsang, Kim Fung
A2 - Wang, Fu Lee
A2 - Hung, Kevin
A2 - Hao, Tianyong
A2 - Wang, Zenghui
A2 - Wu, Zhou
A2 - Zhang, Zhao
T2 - 6th International Conference on Neural Computing for Advanced Applications, NCAA 2025
Y2 - 4 July 2025 through 6 July 2025
ER -