Exploring relevant snapshots and neighboring entities for temporal knowledge graph reasoning

IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Rushan Geng , Cuicui Luo
{"title":"Exploring relevant snapshots and neighboring entities for temporal knowledge graph reasoning","authors":"Rushan Geng ,&nbsp;Cuicui Luo","doi":"10.1016/j.ipm.2025.104377","DOIUrl":null,"url":null,"abstract":"<div><div>Temporal Knowledge Graph Reasoning (TKGR) aims to predict missing entities at future timestamps based on evolving patterns in historical data. However, existing methods often over-rely on past events while neglecting the semantic evolution of future events, resulting in limited generalization to unseen facts. To address these challenges, we propose RSPED, a novel framework that enhances extrapolative reasoning by selecting relevant relational and temporal contexts. Specifically, we design: (1) a Relevant Relation Selector, which filters out irrelevant facts based on entity-relation dependencies and frequency-aware attention; and (2) a Potential Event Discovery module, which constructs auxiliary graphs to extract semantic dependencies among candidate entities. These two components enable the model to integrate both local and contextual signals across past and potential future snapshots. Extensive experiments on five public TKGR datasets demonstrate that RSPED consistently outperforms competitive baselines in terms of MRR (e.g., improving by 1.47%, 0.16%, 0.50%, 1.37%, and 3.88% on ICEWS14, ICEWS18, GDELT, YAGO, and WIKI, respectively), verifying its effectiveness and generalization in temporal reasoning tasks.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 2","pages":"Article 104377"},"PeriodicalIF":6.9000,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325003188","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Temporal Knowledge Graph Reasoning (TKGR) aims to predict missing entities at future timestamps based on evolving patterns in historical data. However, existing methods often over-rely on past events while neglecting the semantic evolution of future events, resulting in limited generalization to unseen facts. To address these challenges, we propose RSPED, a novel framework that enhances extrapolative reasoning by selecting relevant relational and temporal contexts. Specifically, we design: (1) a Relevant Relation Selector, which filters out irrelevant facts based on entity-relation dependencies and frequency-aware attention; and (2) a Potential Event Discovery module, which constructs auxiliary graphs to extract semantic dependencies among candidate entities. These two components enable the model to integrate both local and contextual signals across past and potential future snapshots. Extensive experiments on five public TKGR datasets demonstrate that RSPED consistently outperforms competitive baselines in terms of MRR (e.g., improving by 1.47%, 0.16%, 0.50%, 1.37%, and 3.88% on ICEWS14, ICEWS18, GDELT, YAGO, and WIKI, respectively), verifying its effectiveness and generalization in temporal reasoning tasks.
探索时序知识图推理的相关快照和相邻实体
时间知识图推理(TKGR)旨在根据历史数据的演化模式预测未来时间戳上缺失的实体。然而,现有的方法往往过度依赖过去的事件,而忽略了未来事件的语义演变,导致对看不见的事实的泛化有限。为了解决这些挑战,我们提出了RSPED,这是一个通过选择相关的关系和时间上下文来增强外推推理的新框架。具体来说,我们设计了:(1)一个相关关系选择器,它基于实体-关系依赖和频率感知关注过滤掉不相关的事实;(2)潜在事件发现模块,构建辅助图来提取候选实体之间的语义依赖关系。这两个组件使模型能够跨过去和潜在的未来快照集成本地和上下文信号。在5个公共TKGR数据集上的大量实验表明,RSPED在MRR方面始终优于竞争基准(例如,在ICEWS14、ICEWS18、GDELT、YAGO和WIKI上分别提高了1.47%、0.16%、0.50%、1.37%和3.88%),验证了其在时间推理任务中的有效性和泛化性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
×
引用
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学术官方微信