Explainable reasoning over temporal knowledge graphs by pre-trained language model

被引:3
作者
Li, Qing [1 ]
Wu, Guanzhong [1 ]
机构
[1] Northwestern Polytech Univ, Sch Comp Sci, Xian 710000, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Knowledge graph reasoning; Pre-trained language model; Logical reasoning; Temporal knowledge graph; Multi-hop paths; Graph representation learning;
D O I
10.1016/j.ipm.2024.103903
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Temporal knowledge graph reasoning (TKGR) has been considered as a crucial task for modeling the evolving knowledge, aiming to infer the unknown connections between entities at specific times. Traditional TKGR methods try to aggregate structural information between entities and evolve representations of entities over distinct snapshots, while some other methods attempt to extract temporal logic rules from historical interactions. However, these methods fail to address the continuously emerging unseen entities over time and ignore the historical dependencies between entities and relations. To overcome these limitations, we propose a novel method, termed TPNet, which introduces historical information completion strategy (HICS) and pre-trained language model (PLM) to conduct explainable inductive reasoning over TKGs. Specifically, TPNet extracts reliable temporal logical paths from historical subgraphs using a temporal-correlated search strategy. For unseen entities, we utilize HICS to sample or generate paths to supplement their historical information. Besides, a PLM and a time-aware encoder are introduced to jointly encode the temporal paths, thereby comprehensively capturing dependencies between entities and relations. Moreover, the semantic similarity between the query quadruples and the extracted paths is evaluated to simultaneously optimize the representations of entities and relations. Extensive experiments on entity and relation prediction tasks are conducted to evaluate the performance of TPNet. The experimental results on four benchmark datasets demonstrate the superiority of TPNet over state-of-the-art TKGR methods, achieving improvements of 14.35%, 23.08%, 6.75% and 5.38% on MRR, respectively.
引用
收藏
页数:15
相关论文
共 56 条
[1]   Graph-based data management system for efficient information storage, retrieval and processing [J].
Aldwairi, Monther ;
Jarrah, Moath ;
Mahasneh, Naseem ;
Al-khateeb, Baghdad .
INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (02)
[2]   Multi-hop temporal knowledge graph reasoning with temporal path rules guidance [J].
Bai, Luyi ;
Chen, Mingzhuo ;
Zhu, Lin ;
Meng, Xiangxi .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 223
[3]  
Bi W., 2023, arXiv
[4]   Boosting question answering over knowledge graph with reward integration and policy evaluation under weak supervision [J].
Bi, Xin ;
Nie, Haojie ;
Zhang, Guoliang ;
Hu, Lei ;
Ma, Yuliang ;
Zhao, Xiangguo ;
Yuan, Ye ;
Wang, Guoren .
INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (02)
[5]  
Bordes A., 2013, Advances in Neural Information Processing Systems, V26
[6]   Incorporating Structured Sentences with Time-enhanced BERT for Fully-inductive Temporal Relation Prediction [J].
Chen, Zhongwu ;
Xu, Chengjin ;
Su, Fenglong ;
Huang, Zhen ;
Dou, Yong .
PROCEEDINGS OF THE 46TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, SIGIR 2023, 2023, :889-899
[7]   Reinforcement learning with dynamic completion for answering multi-hop questions over incomplete knowledge graph [J].
Cui, Hai ;
Peng, Tao ;
Han, Ridong ;
Zhu, Beibei ;
Bi, Haijia ;
Liu, Lu .
INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (03)
[8]  
Dasgupta SS, 2018, 2018 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2018), P2001
[9]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171
[10]  
Gao YF, 2022, PROCEEDINGS OF THE THIRTY-FIRST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2022, P2044