Reinforcement learning with time intervals for temporal knowledge graph reasoning

被引:2
作者
Liu, Ruinan [1 ]
Yin, Guisheng [1 ]
Liu, Zechao [1 ]
Tian, Ye [2 ]
机构
[1] Harbin Engn Univ, Coll Comp Sci & Technol, Harbin 150001, Peoples R China
[2] Xidian Univ, Hangzhou Inst Technol, Xian 710000, Peoples R China
基金
国家重点研发计划;
关键词
Temporal knowledge graph; Multi-hop reasoning; Reinforcement learning; Time interval; Temporal logic;
D O I
10.1016/j.is.2023.102292
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:12
相关论文
共 54 条
  • [11] Goel R, 2020, AAAI CONF ARTIF INTE, V34, P3988
  • [12] Unleashing the power of querying streaming data in a temporal database world: A relational algebra approach
    Grandi, Fabio
    Mandreoli, Federica
    Martoglia, Riccardo
    Penzo, Wilma
    [J]. INFORMATION SYSTEMS, 2022, 103
  • [13] Han Z., 2021, INT C LEARN REPR
  • [14] Han Z, 2021, 2021 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2021), P8352
  • [15] Jiang T, 2016, P 2016 C EMP METH NA, P2350, DOI DOI 10.18653/V1/D16-1260
  • [16] Jin W, 2020, PROCEEDINGS OF THE 2020 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP), P6669
  • [17] Kingma DP., 2014, ARXIV, DOI DOI 10.48550/ARXIV.1412.6980
  • [18] Lacroix T., 2020, ICLR, P1
  • [19] Deriving Validity Time in Knowledge Graph
    Leblay, Julien
    Chekol, Melisachew Wudage
    [J]. COMPANION PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2018 (WWW 2018), 2018, : 1771 - 1776
  • [20] Lei DR, 2020, PROCEEDINGS OF THE 2020 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP), P8541