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 , Xiangjie Kong , Kailun Ye , Shangfei Zheng , Qihong Pan , Guojiang Shen , 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.
期刊介绍:
Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.