TY - GEN
T1 - HFTS
T2 - 31st International Conference on Database Systems for Advanced Applications, DASFAA 2026
AU - Huang, Wei
AU - Hao, Tianyong
AU - Wang, Fu Lee
AU - He, Jing
AU - Liu, Hai
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2026.
PY - 2026
Y1 - 2026
N2 - Existing methods for temporal knowledge graph completion (TKGC) often fail to effectively distinguish the latent temporal associations and sequential dependencies inherent in the temporal order of facts and have largely overlooked the impact of time intervals on the interaction information. To address these limitations, we propose a TKGC model HFTS that distinguishes between Historical and Future information and is sensitive to Time Spans. This model divides temporal knowledge graph subgraphs into historical and future temporal subgraphs, aiming to capture order-dependent associations among facts. We also introduce a time-sensitive factor to measure the effectiveness of both entity and relation interactions across varying time-span. Considering that entities typically change smoothly and slowly over time, exhibiting relatively static behavior in the short term compared to the long term, we further introduce a Smooth Self-Supervised Loss (S-SSL) to enforce temporal consistency in entity representations across adjacent timestamps. Experimental results demonstrate that HFTS achieves superior MRR performance on three benchmark datasets, improving by 12.70%, 12.33%, and 6.20% over existing methods. The code of our method has been released in https://github.com/yeezyzy/HFTS.git.
AB - Existing methods for temporal knowledge graph completion (TKGC) often fail to effectively distinguish the latent temporal associations and sequential dependencies inherent in the temporal order of facts and have largely overlooked the impact of time intervals on the interaction information. To address these limitations, we propose a TKGC model HFTS that distinguishes between Historical and Future information and is sensitive to Time Spans. This model divides temporal knowledge graph subgraphs into historical and future temporal subgraphs, aiming to capture order-dependent associations among facts. We also introduce a time-sensitive factor to measure the effectiveness of both entity and relation interactions across varying time-span. Considering that entities typically change smoothly and slowly over time, exhibiting relatively static behavior in the short term compared to the long term, we further introduce a Smooth Self-Supervised Loss (S-SSL) to enforce temporal consistency in entity representations across adjacent timestamps. Experimental results demonstrate that HFTS achieves superior MRR performance on three benchmark datasets, improving by 12.70%, 12.33%, and 6.20% over existing methods. The code of our method has been released in https://github.com/yeezyzy/HFTS.git.
KW - Knowledge Graph Embedding
KW - Link Prediction
KW - Temporal Knowledge Graph Completion
UR - https://www.scopus.com/pages/publications/105040625375
U2 - 10.1007/978-981-92-0375-8_18
DO - 10.1007/978-981-92-0375-8_18
M3 - Conference contribution
AN - SCOPUS:105040625375
SN - 9789819203741
T3 - Lecture Notes in Computer Science
SP - 289
EP - 304
BT - Database Systems for Advanced Applications - 31st International Conference, DASFAA 2026, Proceedings
A2 - Jung, Hyungsoo
A2 - Wang, Tianzheng
A2 - Toyoda, Masashi
A2 - Kwon, Hyuk-Yoon
A2 - Lee, Jae-woong
Y2 - 27 April 2026 through 30 April 2026
ER -