A context-aware temporal knowledge graph completion method based on logical paths

IF 6.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Neurocomputing Pub Date : 2026-05-01 Epub Date: 2026-02-13 DOI:10.1016/j.neucom.2026.133049
Yuchao Zhang , Xiangjie Kong , Kailun Ye , Shangfei Zheng , Qihong Pan , Guojiang Shen , Jianxin Li
{"title":"A context-aware temporal knowledge graph completion method based on logical paths","authors":"Yuchao Zhang ,&nbsp;Xiangjie Kong ,&nbsp;Kailun Ye ,&nbsp;Shangfei Zheng ,&nbsp;Qihong Pan ,&nbsp;Guojiang Shen ,&nbsp;Jianxin Li","doi":"10.1016/j.neucom.2026.133049","DOIUrl":null,"url":null,"abstract":"<div><div>Temporal Knowledge Graph Completion (TKGC) plays a critical role in dynamic knowledge expansion by predicting entity relationships at specific time points based on existing facts. This enhances the performance of downstream applications. Existing TKGC methods mainly generate dynamic entity representations by capturing the structural characteristics of facts and the sequential properties of data. Some approaches also attempt to extract temporal logical rules from historical query data. However, these methods do not fully account for the contextual relevance of queries, which limits the accuracy of entity predictions. To address this gap, we propose a <strong>C</strong>ontext-<strong>A</strong>ware TKGC method based on <strong>L</strong>ogical <strong>P</strong>aths (LPCA). This method integrates embedding representations and logical rules to create an interpretable TKGC completion framework, improving both prediction transparency and accuracy. Our approach mines query-specific logical paths, incorporating a time-aware sampling mechanism that prioritizes temporally recent facts to enhance temporal relevance and adaptability. Additionally, we design a self-attention mechanism to capture enriched contextual features of these temporal logical paths, modeling dependencies among the head entity, tail entity, query relation, and associated path elements to strengthen semantic and structural relevance. Experimental results show that the proposed method improves MRR scores by 3.59%, 0.99%, and 2.67% on the ICEWS14, ICEWS18, and ICEWS05-15 datasets, respectively.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"676 ","pages":"Article 133049"},"PeriodicalIF":6.7000,"publicationDate":"2026-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231226004467","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/13 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Temporal Knowledge Graph Completion (TKGC) plays a critical role in dynamic knowledge expansion by predicting entity relationships at specific time points based on existing facts. This enhances the performance of downstream applications. Existing TKGC methods mainly generate dynamic entity representations by capturing the structural characteristics of facts and the sequential properties of data. Some approaches also attempt to extract temporal logical rules from historical query data. However, these methods do not fully account for the contextual relevance of queries, which limits the accuracy of entity predictions. To address this gap, we propose a Context-Aware TKGC method based on Logical Paths (LPCA). This method integrates embedding representations and logical rules to create an interpretable TKGC completion framework, improving both prediction transparency and accuracy. Our approach mines query-specific logical paths, incorporating a time-aware sampling mechanism that prioritizes temporally recent facts to enhance temporal relevance and adaptability. Additionally, we design a self-attention mechanism to capture enriched contextual features of these temporal logical paths, modeling dependencies among the head entity, tail entity, query relation, and associated path elements to strengthen semantic and structural relevance. Experimental results show that the proposed method improves MRR scores by 3.59%, 0.99%, and 2.67% on the ICEWS14, ICEWS18, and ICEWS05-15 datasets, respectively.
基于逻辑路径的上下文感知时态知识图补全方法
时间知识图补全(TKGC)通过预测特定时间点的实体关系,在知识的动态扩展中起着至关重要的作用。这提高了下游应用程序的性能。现有的TKGC方法主要通过捕获事实的结构特征和数据的顺序属性来生成动态实体表示。一些方法还尝试从历史查询数据中提取时间逻辑规则。然而,这些方法不能完全考虑查询的上下文相关性,这限制了实体预测的准确性。为了解决这一差距,我们提出了一种基于逻辑路径(LPCA)的上下文感知TKGC方法。该方法集成了嵌入表示和逻辑规则,创建了一个可解释的TKGC补全框架,提高了预测的透明度和准确性。我们的方法挖掘特定于查询的逻辑路径,结合时间感知抽样机制,优先考虑时间上最近的事实,以增强时间相关性和适应性。此外,我们设计了一个自关注机制来捕获这些时间逻辑路径的丰富上下文特征,建模头部实体、尾部实体、查询关系和相关路径元素之间的依赖关系,以加强语义和结构相关性。实验结果表明,该方法在ICEWS14、ICEWS18和ICEWS05-15数据集上的MRR分数分别提高了3.59%、0.99%和2.67%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书