FTPComplEx: A flexible time perspective approach to temporal knowledge graph completion

被引:0
作者
Nguyen, Ngoc-Trung [1 ,2 ,3 ]
Ngo, Thuc [1 ,2 ]
Hoang, Nguyen [1 ,2 ]
Le, Thanh [1 ,2 ]
机构
[1] Univ Sci, Fac Informat Technol, Ho Chi Minh City, Vietnam
[2] Vietnam Natl Univ, Ho Chi Minh City, Vietnam
[3] Univ Technol & Educ, Fac Informat Technol, Ho Chi Minh City, Vietnam
关键词
Temporal knowledge graph reasoning; Tensor decomposition; Representation learning; Time perspective;
D O I
10.1016/j.engappai.2024.109717
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The dynamic nature of interconnected data evolving over time poses significant challenges for graph representation and reasoning, particularly as temporal knowledge graphs scale in size and complexity. Existing models like TPComplEx (Time Perspective Complex Embedding) leverage tensor decomposition techniques to capture temporal dynamics, but their static weighting approach often lacks the flexibility needed to adapt to the nuanced evolution of relationships and entities. This rigidity can lead to missed temporal dependencies and loss of valuable insights, especially in large-scale graphs comprising millions or even billions of factual entries. To overcome these limitations, we propose FTPComplEx (Flexible Time Perspective Complex Embedding), a novel embedding model that introduces adjustable weights to dynamically modulate the influence of temporal information. This flexibility enables FTPComplEx to more accurately capture the intricate interactions between entities, relations, and time, providing a more robust understanding of temporal dynamics within knowledge graphs. Our extensive evaluations on benchmark datasets, including YAGO15k, ICEWS, and GDELT, demonstrate that FTPComplEx achieves state-of-the-art results, outperforming TPComplEx and other existing models. Notably, on the YAGO15k dataset, FTPComplEx achieves a 9.04% improvement in Mean Reciprocal Rank (MRR) and an 11.35% increase in Hits@1, demonstrating its effectiveness in managing complex temporal relationships. Further analysis shows that FTPComplEx maintains strong performance even with lower-rank embeddings, significantly reducing computational costs while maintaining accuracy.
引用
收藏
页数:23
相关论文
共 87 条
  • [1] Abboud R, 2020, Arxiv, DOI arXiv:2007.06267
  • [2] Amin S., 2020, PR MACH LEARN RES, P257
  • [3] [Anonymous], 2020, Stardog Union
  • [4] [Anonymous], 2013, ISA ANN CONV
  • [5] DBpedia: A nucleus for a web of open data
    Auer, Soeren
    Bizer, Christian
    Kobilarov, Georgi
    Lehmann, Jens
    Cyganiak, Richard
    Ives, Zachary
    [J]. SEMANTIC WEB, PROCEEDINGS, 2007, 4825 : 722 - +
  • [6] RLAT: Multi-hop temporal knowledge graph reasoning based on Reinforcement Learning and Attention Mechanism
    Bai, Luyi
    Chai, Die
    Zhu, Lin
    [J]. KNOWLEDGE-BASED SYSTEMS, 2023, 269
  • [7] RoAN: A relation-oriented attention network for temporal knowledge graph completion
    Bai, Luyi
    Ma, Xiangnan
    Meng, Xiangxi
    Ren, Xin
    Ke, Yujing
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 123
  • [8] Temporal knowledge graphs reasoning with iterative guidance by temporal logical rules
    Bai, Luyi
    Yu, Wenting
    Chai, Die
    Zhao, Wenjun
    Chen, Mingzhuo
    [J]. INFORMATION SCIENCES, 2023, 621 : 22 - 35
  • [9] Multi-hop reasoning over paths in temporal knowledge graphs using reinforcement learning
    Bai, Luyi
    Yu, Wenting
    Chen, Mingzhuo
    Ma, Xiangnan
    [J]. APPLIED SOFT COMPUTING, 2021, 103
  • [10] Balazevic I, 2019, 2019 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING AND THE 9TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (EMNLP-IJCNLP 2019), P5185