Learning Latent Relations for Temporal Knowledge Graph Reasoning
Mengqi Zhang3,4; Yuwei Xia1,2; Qiang Liu3,4; Shu Wu3,4; Liang Wang3,4
2023
会议日期2023-7-9
会议地点Toronto, Canada
英文摘要

Temporal Knowledge Graph (TKG) reasoning aims to predict future facts based on historical data. However, due to the limitations in construction tools and data sources, many important associations between entities may be omitted in TKG. We refer to these missing associations as latent relations. Most of the existing methods have some drawbacks in explicitly capturing intra-time latent relations between co-occurring entities and inter-time latent relations between entities that appear at different times. To tackle these problems, we propose a novel Latent relations Learning method for TKG reasoning, namely L2TKG. Specifically, we first utilize a Structural Encoder (SE) to obtain representations of entities at each timestamp. We then design a Latent Relations Learning (LRL) module to mine and exploit the intra- and inter-time latent relations. Finally, we extract the temporal representations from the output of SE and LRL for entity prediction. Extensive experiments on four datasets demonstrate the effectiveness of L2TKG.

语种英语
内容类型会议论文
源URL[http://ir.ia.ac.cn/handle/173211/52300]  
专题自动化研究所_智能感知与计算研究中心
通讯作者Shu Wu
作者单位1.School of Cyber Security, University of Chinese Academy of Sciences
2.Institute of Information Engineering, Chinese Academy of Sciences
3.Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation, Chinese Academy of Sciences
4.School of Artificial Intelligence, University of Chinese Academy of Sciences
推荐引用方式
GB/T 7714
Mengqi Zhang,Yuwei Xia,Qiang Liu,et al. Learning Latent Relations for Temporal Knowledge Graph Reasoning[C]. 见:. Toronto, Canada. 2023-7-9.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace