{"title":"FTPComplEx: A flexible time perspective approach to temporal knowledge graph completion","authors":"Ngoc-Trung Nguyen , Thuc Ngo , Nguyen Hoang , Thanh Le","doi":"10.1016/j.engappai.2024.109717","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109717"},"PeriodicalIF":7.5000,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S095219762401875X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.