MADE: Multicurvature Adaptive Embedding for Temporal Knowledge Graph Completion

被引:1
|
作者
Wang, Jiapu [1 ]
Wang, Boyue [1 ]
Gao, Junbin [2 ]
Pan, Shirui [3 ]
Liu, Tengfei [1 ]
Yin, Baocai [1 ]
Gao, Wen [4 ,5 ]
机构
[1] Beijing Univ Technol, Beijing Artificial Intelligence Inst, Fac Informat Technol, Beijing Municipal Key Lab Multimedia & Intelligent, Beijing 100124, Peoples R China
[2] Univ Sydney, Univ Sydney Business Sch, Discipline Business Analyt, Sydney, NSW 2006, Australia
[3] Griffith Univ, Sch Informat & Commun Technol, Southport, Qld 4222, Australia
[4] Peking Univ, Inst Digital Media, Beijing 100871, Peoples R China
[5] Peking Univ, Shenzhen Grad Sch, Sch Elect & Comp Engn, Shenzhen 518055, Peoples R China
关键词
Adaptive embedding; multicurvature spaces; neural network; temporal knowledge graph completion (TKGC);
D O I
10.1109/TCYB.2024.3392957
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Temporal knowledge graphs (TKGs) are receiving increased attention due to their time-dependent properties and the evolving nature of knowledge over time. TKGs typically contain complex geometric structures, such as hierarchical, ring, and chain structures, which can often be mixed together. However, embedding TKGs into Euclidean space, as is typically done with TKG completion (TKGC) models, presents a challenge when dealing with high-dimensional nonlinear data and complex geometric structures. To address this issue, we propose a novel TKGC model called multicurvature adaptive embedding (MADE). MADE models TKGs in multicurvature spaces, including flat Euclidean space (zero curvature), hyperbolic space (negative curvature), and hyperspherical space (positive curvature), to handle multiple geometric structures. We assign different weights to different curvature spaces in a data-driven manner to strengthen the ideal curvature spaces for modeling and weaken the inappropriate ones. Additionally, we introduce the quadruplet distributor (QD) to assist the information interaction in each geometric space. Ultimately, we develop an innovative temporal regularization to enhance the smoothness of timestamp embeddings by strengthening the correlation of neighboring timestamps. Experimental results show that MADE outperforms the existing state-of-the-art TKGC models.
引用
收藏
页码:5818 / 5831
页数:14
相关论文
共 50 条
  • [1] Diachronic Embedding for Temporal Knowledge Graph Completion
    Goel, Rishab
    Kazemi, Seyed Mehran
    Brubaker, Marcus
    Poupart, Pascal
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 3988 - 3995
  • [2] An Improvement of Diachronic Embedding for Temporal Knowledge Graph Completion
    Thuy-Anh Nguyen Thi
    Viet-Phuong Ta
    Xuan Hieu Phan
    Quang Thuy Ha
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2023, PT II, 2023, 13996 : 111 - 120
  • [3] Specific Time Embedding for Temporal Knowledge Graph Completion
    Ni, Runyu
    Ma, Zhonggui
    Yu, Kaihang
    Xu, Xiaohan
    PROCEEDINGS OF 2020 IEEE 19TH INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS & COGNITIVE COMPUTING (ICCI*CC 2020), 2020, : 105 - 110
  • [4] Dynamic Embedding Graph Attention Networks for Temporal Knowledge Graph Completion
    Wang, Jingqi
    Zhu, Cui
    Zhu, Wenjun
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT I, 2022, 13368 : 722 - 734
  • [5] 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
  • [6] Temporal Knowledge Graph Completion Based on Time Series Gaussian Embedding
    Xu, Chenjin
    Nayyeri, Mojtaba
    Alkhoury, Fouad
    Yazdi, Hamed
    Lehmann, Jens
    SEMANTIC WEB - ISWC 2020, PT I, 2020, 12506 : 654 - 671
  • [7] Aggregation or separation? Adaptive embedding message passing for knowledge graph completion
    Li, Zhifei
    Chen, Lifan
    Jian, Yue
    Wang, Han
    Zhao, Yue
    Zhang, Miao
    Xiao, Kui
    Zhang, Yan
    Deng, Honglian
    Hou, Xiaoju
    INFORMATION SCIENCES, 2025, 691
  • [8] 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
  • [9] TPBoxE: Temporal Knowledge Graph Completion based on Time Probability Box Embedding
    Li, Song
    Wang, Qi
    Li, Zheng
    Zhang, Liping
    COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2025, 22 (01) : 153 - 180
  • [10] Along the Time: Timeline-traced Embedding for Temporal Knowledge Graph Completion
    Zhang, Fuwei
    Zhang, Zhao
    Ao, Xiang
    Zhuang, Fuzhen
    Xu, Yongjun
    He, Qing
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 2529 - 2538