Temporal Knowledge Graph Completion: A Survey

被引:0
|
作者
Cai, Borui [1 ]
Xiang, Yong [1 ]
Gao, Longxiang [2 ]
Zhang, He [3 ]
Li, Yunfeng [3 ]
Li, Jianxin [1 ]
机构
[1] Deakin Univ, Sch Informat Technol, Geelong, Australia
[2] Qilu Univ Technol, Jinan, Peoples R China
[3] CNPIEC KEXIN Ltd, Beijing, Peoples R China
基金
澳大利亚研究理事会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Knowledge graph completion (KGC) predicts missing links and is crucial for real-life knowledge graphs, which widely suffer from incompleteness. KGC methods assume a knowledge graph is static, but that may lead to inaccurate prediction results because many facts in the knowledge graphs change over time. Emerging methods have recently shown improved prediction results by further incorporating the temporal validity of facts; namely, temporal knowledge graph completion (TKGC). With this temporal information, TKGC methods explicitly learn the dynamic evolution of the knowledge graph that KGC methods fail to capture. In this paper, for the first time, we comprehensively summarize the recent advances in TKGC research. First, we detail the background of TKGC, including the preliminary knowledge, benchmark datasets, and evaluation metrics. Then, we summarize existing TKGC methods based on how the temporal validity of facts is used to capture the temporal dynamics. Finally, we conclude the paper and present future research directions of TKGC.
引用
收藏
页码:6545 / 6553
页数:9
相关论文
共 50 条
  • [31] Sparse temporal knowledge graph completion based on path imitation
    Hu, Jiahui
    Bai, Luyi
    Shang, Xuemeng
    Feng, Guangchen
    Gao, Yang
    NEUROCOMPUTING, 2025, 624
  • [32] Tucker decomposition-based temporal knowledge graph completion
    Shao, Pengpeng
    Zhang, Dawei
    Yang, Guohua
    Tao, Jianhua
    Che, Feihu
    Liu, Tong
    KNOWLEDGE-BASED SYSTEMS, 2022, 238
  • [33] Tucker Decomposition with Frequency Attention for Temporal Knowledge Graph Completion
    Xiao, Likang
    Zhang, Richong
    Chen, Zijie
    Chen, Junfan
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2023), 2023, : 7286 - 7300
  • [34] Temporal Knowledge Graph Completion using a Linear Temporal Regularizer and Multivector Embeddings
    Xu, Chengjin
    Chen, Yung-Yu
    Nayyeri, Mojtaba
    Lehmann, Jens
    2021 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL-HLT 2021), 2021, : 2569 - 2578
  • [35] RTFE: A Recursive Temporal Fact Embedding Framework for Temporal Knowledge Graph Completion
    Xu, Youri
    E, Haihong
    Song, Meina
    Song, Wenyu
    Lv, Xiaodong
    Wang Haotian
    Yang Jinrui
    2021 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL-HLT 2021), 2021, : 5671 - 5681
  • [36] Hyperplane-based time-aware knowledge graph embedding for temporal knowledge graph completion
    He, Peng
    Zhou, Gang
    Liu, Hongbo
    Xia, Yi
    Wang, Ling
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2022, 42 (06) : 5457 - 5469
  • [37] Temporal Knowledge Graph Completion Based on Entity Multi-encoding and Temporal Awareness
    Wei, Qian
    PROCEEDINGS OF 2024 INTERNATIONAL CONFERENCE ON COMPUTER AND MULTIMEDIA TECHNOLOGY, ICCMT 2024, 2024, : 6 - 10
  • [38] Geometric Algebra Based Embeddings for Static and Temporal Knowledge Graph Completion
    Xu, Chengjin
    Nayyeri, Mojtaba
    Chen, Yung-Yu
    Lehmann, Jens
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (05) : 4838 - 4851
  • [39] Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion
    Jung, Jaehun
    Jung, Jinhong
    Kang, U.
    KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, : 786 - 795
  • [40] Multi-timescale History Modeling for Temporal Knowledge Graph Completion
    Peng, Chenchen
    Shi, Xiaochuan
    Yu, Rongwei
    Ma, Chao
    Wu, Libing
    Zhang, Dian
    2022 18TH INTERNATIONAL CONFERENCE ON MOBILITY, SENSING AND NETWORKING, MSN, 2022, : 477 - 484