IMF: Interpretable Multi-Hop Forecasting on Temporal Knowledge Graphs
Open Access
Abstract
Temporal knowledge graphs (KGs) have recently attracted increasing attention. The temporal KG forecasting task, which plays a crucial role in such applications as event prediction, predicts future links based on historical facts. However, current studies pay scant attention to the following two aspects. First, the interpretability of current models is manifested in providing reasoning paths, which is an essential property of path-based models. However, the comparison of reasoning paths in these models is operated in a black-box fashion. Moreover, contemporary models utilize separate networks to evaluate paths at different hops. Although the network for each hop has the same architecture, each network achieves different parameters for better performance. Different parameters cause identical semantics to have different scores, so models cannot measure identical semantics at different hops equally. Inspired by the observation that reasoning based on multi-hop paths is akin to answering questions step by step, this paper designs an Interpretable Multi-Hop Reasoning (IMR) framework based on consistent basic models for temporal KG forecasting. IMR transforms reasoning based on path searching into stepwise question answering. In addition, IMR develops three indicators according to the characteristics of temporal KGs and reasoning paths: the question matching degree, answer completion level, and path confidence. IMR can uniformly integrate paths of different hops according to the same criteria; IMR can provide the reasoning paths similarly to other interpretable models and further explain the basis for path comparison. We instantiate the framework based on common embedding models such as TransE, RotatE, and ComplEx. While being more explainable, these instantiated models achieve state-of-the-art performance against previous models on four baseline datasets.Keywords
This publication has 21 references indexed in Scilit:
- Diachronic Embedding for Temporal Knowledge Graph CompletionProceedings of the AAAI Conference on Artificial Intelligence, 2020
- Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs2020
- TuckER: Tensor Factorization for Knowledge Graph Completion2019
- Incorporating Graph Attention Mechanism into Knowledge Graph Reasoning Based on Deep Reinforcement Learning2019
- DIVINE: A Generative Adversarial Imitation Learning Framework for Knowledge Graph Reasoning2019
- A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization2019
- A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network2018
- Deriving Validity Time in Knowledge Graph2018
- YAGO: A Large Ontology from Wikipedia and WordNetJournal of Web Semantics, 2008
- WordNetCommunications of the ACM, 1995