Reinforcement learning with time intervals for temporal knowledge graph reasoning

IF 3 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Systems Pub Date : 2023-10-07 DOI:10.1016/j.is.2023.102292
Ruinan Liu , Guisheng Yin , Zechao Liu , Ye Tian
{"title":"Reinforcement learning with time intervals for temporal knowledge graph reasoning","authors":"Ruinan Liu ,&nbsp;Guisheng Yin ,&nbsp;Zechao Liu ,&nbsp;Ye Tian","doi":"10.1016/j.is.2023.102292","DOIUrl":null,"url":null,"abstract":"<div><p>Temporal reasoning methods have been successful in temporal knowledge graphs (TKGs) and are widely employed in many downstream application areas. Most existing TKG reasoning models transform time intervals into continuous time snapshots, with each snapshot representing a subgraph of the TKG. Although such processing can produce satisfactory outcomes, it ignores the integrity of a time interval and increases the amount of data. Meanwhile, many previous works focuses on the logic of sequentially occurring facts, disregarding the complex temporal logics of various time intervals. Consequently, we propose a <strong>R</strong>einforcement Learning-based Model for <strong>T</strong>emporal Knowledge Graph Reasoning with <strong>T</strong>ime <strong>I</strong>ntervals (RTTI), which focuses on time-aware multi-hop reasoning arising from complex time intervals. In RTTI, we construct the time learning part to obtain the time embedding of the current path. It simulates the temporal logic with relation historical encoding and compute the time interval between two facts through the temporal logic feature matrix. Furthermore, we propose a new method for representing time intervals that breaks the original time interval embedding method, and express the time interval using median and embedding changes of two timestamps. We evaluate RTTI on four public TKGs for the link prediction task, and experimental results indicate that our approach can still perform well on more complicated tasks. Meanwhile, our method can search for more interpretable paths in the broader space and improve the reasoning ability in sparse spaces.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.0000,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030643792300128X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Temporal reasoning methods have been successful in temporal knowledge graphs (TKGs) and are widely employed in many downstream application areas. Most existing TKG reasoning models transform time intervals into continuous time snapshots, with each snapshot representing a subgraph of the TKG. Although such processing can produce satisfactory outcomes, it ignores the integrity of a time interval and increases the amount of data. Meanwhile, many previous works focuses on the logic of sequentially occurring facts, disregarding the complex temporal logics of various time intervals. Consequently, we propose a Reinforcement Learning-based Model for Temporal Knowledge Graph Reasoning with Time Intervals (RTTI), which focuses on time-aware multi-hop reasoning arising from complex time intervals. In RTTI, we construct the time learning part to obtain the time embedding of the current path. It simulates the temporal logic with relation historical encoding and compute the time interval between two facts through the temporal logic feature matrix. Furthermore, we propose a new method for representing time intervals that breaks the original time interval embedding method, and express the time interval using median and embedding changes of two timestamps. We evaluate RTTI on four public TKGs for the link prediction task, and experimental results indicate that our approach can still perform well on more complicated tasks. Meanwhile, our method can search for more interpretable paths in the broader space and improve the reasoning ability in sparse spaces.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
时态知识图推理的时间间隔强化学习
时态推理方法在时态知识图(TKG)中取得了成功,并在许多下游应用领域得到了广泛应用。大多数现有的TKG推理模型将时间间隔转换为连续的时间快照,每个快照代表TKG的一个子图。尽管这种处理可以产生令人满意的结果,但它忽略了时间间隔的完整性,并增加了数据量。同时,以往的许多著作都侧重于顺序发生的事实的逻辑,而忽略了各种时间间隔的复杂时间逻辑。因此,我们提出了一种基于强化学习的时间间隔时态知识图推理模型(RTTI),该模型专注于复杂时间间隔下的时间感知多跳推理。在RTTI中,我们构造时间学习部分来获得当前路径的时间嵌入。它通过关系历史编码模拟时间逻辑,并通过时间逻辑特征矩阵计算两个事实之间的时间间隔。此外,我们提出了一种新的时间间隔表示方法,打破了原来的时间间隔嵌入方法,并使用两个时间戳的中值和嵌入变化来表示时间间隔。对于链路预测任务,我们在四个公共TKG上评估了RTTI,实验结果表明,我们的方法仍然可以在更复杂的任务上执行良好。同时,我们的方法可以在更宽的空间中搜索更多可解释的路径,并提高稀疏空间中的推理能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Systems
Information Systems 工程技术-计算机:信息系统
CiteScore
9.40
自引率
2.70%
发文量
112
审稿时长
53 days
期刊介绍: Information systems are the software and hardware systems that support data-intensive applications. The journal Information Systems publishes articles concerning the design and implementation of languages, data models, process models, algorithms, software and hardware for information systems. Subject areas include data management issues as presented in the principal international database conferences (e.g., ACM SIGMOD/PODS, VLDB, ICDE and ICDT/EDBT) as well as data-related issues from the fields of data mining/machine learning, information retrieval coordinated with structured data, internet and cloud data management, business process management, web semantics, visual and audio information systems, scientific computing, and data science. Implementation papers having to do with massively parallel data management, fault tolerance in practice, and special purpose hardware for data-intensive systems are also welcome. Manuscripts from application domains, such as urban informatics, social and natural science, and Internet of Things, are also welcome. All papers should highlight innovative solutions to data management problems such as new data models, performance enhancements, and show how those innovations contribute to the goals of the application.
期刊最新文献
Effective data exploration through clustering of local attributive explanations Data Lakehouse: A survey and experimental study Temporal graph processing in modern memory hierarchies Bridging reading and mapping: The role of reading annotations in facilitating feedback while concept mapping A universal approach for simplified redundancy-aware cross-model querying
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1