E XPLAINABLE S UBGRAPH R EASONING FOR F ORECASTING ON T EMPORAL K NOWLEDGE G RAPHS
A BSTRACT
Modeling time-evolving knowledge graphs (KGs) has gained increasing interest recently.
In particular, graph representation learning approaches have be - come the dominant paradigm for link prediction on temporal KGs
However, the embedding-based approaches largely operate in a black- box fashion, lacking the ability to interpret their predictions.
This paper provides a link forecasting framework that reasons over query-relevant subgraphs of temporal KGs and jointly models the structural dependencies and the temporal dynamics.
Especially, we propose a temporal relational attention mechanism and a novel reverse representation update scheme to guide the extraction of an enclosing subgraph around the query.
The subgraph is expanded by an iterative sampling of temporal neighbors and by an attention propagation.
As a result, our approach provides humanunderstandable evidence explaining the forecast.
We evaluate our model on four benchmark temporal knowledge graphs for the link forecasting task.
While being more explainable, our model obtains a relative improvement of up to 20 % on
Hits@1 compared to the previous best KG forecasting method.
We also conduct a survey with 53 respondents, and the results show that the evidence extracted by the model for knowledge forecasting is aligned with human understanding
I NTRODUCTION
Reasoning, a process of inferring new knowledge from available facts, has long been considered an essential topic of research.
Recently, reasoning on knowledge graphs (KG) has gained increasing interest (Das et al., 2017; Ren et al., 2020; Han et al., 2020b).
A knowledge graph is a graphstructured knowledge base that store factual information in the form of triples ( s, p, o ), e.g., ( Alice, livesIn, Toronto ).
In particular, s (subject) and o (object) are expressed as nodes and p (predicate) as an edge type.
Most knowledge graph models assume that the underlying graph is static.
However, in the real world, facts and knowledge always change with time.
For example, ( Alice, livesIn, Toronto ) becomes invalid after Alice moves to Vancouver.
To accommodate time-evolving multi-relational data, temporal KGs have been introduced (Boschee et al., 2015), where a temporal fact is represented as a quadruple by extending the static triplet with a timestamp t indicating the triple is valid at t , i.e.
( Barack Obama, visit, India , 2010-11-06).
In this work, we focus on forecasting on temporal KGs, where we infer future events based on past events.
Forecasting on temporal KGs can improve a plethora of downstream applications such as decision support in personalized health care and ﬁnance.
The use cases often require the predictions made by the learning models to be interpretable, such that users can understand and rely on the predictions.
However, current machine learning approaches (Trivedi et al., 2017; Jin et al., 2019) for temporal KG forecasting operate in a black-box fashion, where they design an embedding-based score function to estimate the plausibility of a quadruple.
These models cannot clearly show which evidence contributes to prediction and lack explainability to the forecasting, making them less suitable for real-world applications.
Explainable approaches can generally be categorized into post-hoc interpretable methods and integrated transparent methods (Doˇsilovi´c et al., 2018).
Post-hoc interpretable approaches (Ying et al., 2019; Montavon et al., 2017) aim to interpret the results of a black-box model, while integrated transparent approaches (Das et al., 2017;
Qiu et al., 2019; Wang et al., 2019) have an explainable internal mechanism.
In particular, most integrated transparent (Lin et al., 2018; Hildebrandt et al., 2020) models employ path-based methods and sometimes employ reinforcement learning, to derive an explicit reasoning path and demonstrate a transparent reasoning process.
The path-based methods focus on ﬁnding the answer to a query within a single reasoning chain.
However, many complicated queries require multiple supporting reasoning chains rather than just one reasoning path.
Recent work (Xu et al., 2019; Teru et al., 2019) has shown that reasoning over local subgraphs substantially boosts performance while maintaining interpretability.
However, these explainable models cannot be applied to temporal graph-structured data because they do not take time information into account.
This work aims to design a transparent forecasting mechanism on temporal KGs that can generate informative explanations of the predictions.
In this paper, we propose an e x plainabl e r easoning framework for forecasting future links on t emporal knowl
e dge graphs, xERTE, which employs a sequential reasoning process over local subgraphs.
To answer a query in the form of (subject e q , predicate p q , ?, timestamp t q ), xERTE starts from the query subject, iteratively samples relevant timestamped edges of existing entities and propagates attention along the sampled edges.
After several rounds of expansion and pruning, the missing object is predicted from entities in the subgraph.
Thus, the extracted subgraph can be seen as a concise and compact graphical explanation of the prediction.
To guide the subgraph to expand in the direction of the query’s interest, we propose a temporal relational graph attention mechanism.
We pose temporal constraints on passing messages to preserve the causal nature of the temporal data.
Speciﬁcally, we update the time-dependent hidden representation of an entity e i at a timestamp t by attentively aggregating messages from its temporal neighbors that were linked with e i before t .
We call such temporal neighbors as prior neighbors of e i .
Additionally, we use an embedding layer consisting of stationary entity embeddings and functional time encoding, enabling the model to capture both global structural information and temporal dynamics.
Besides mimicking human reasoning behavior, we develop a novel representation update mechanism.
When humans perform a reasoning process, their perceived proﬁle of observed entities will update as new clues have been found.
Thus, it is necessary to ensure that all entities in a subgraph can receive messages from newly added prior neighbors.
To this end, the proposed representation update mechanism enables every entity to receive messages from its farthest prior neighbors in the subgraph by performing message passing along each edge only once.
The major contributions of this work are as follows.
(1) We develop xERTE, the ﬁrst explainable model for forecasting future links on temporal KGs.
The model is based on a temporal relational attention mechanisms that preserves the causal nature of the temporal multi-relational data.
Unlike most black-box embedding-based models, xERTE visualizes the reasoning process and provides an interpretable inference graph to emphasize important evidence.
The dynamical pruning procedure enables our model to perform reasoning on large-scale temporal knowledge graphs with millions of edges.
(4) We apply our model for forecasting future links on four benchmark temporal knowledge graphs. The results show that our method achieves on average a better performance than current state-of-the-art methods, thus providing a new baseline.
(5) We conduct a survey withrespondents to evaluate whether the extracted evidence is aligned with human understanding.
R ELATED W ORK
Representation learning is an expressive and popular paradigm underlying many KG models.
The embedding-based approaches for knowledge graphs can generally be categorized into bilinear models (Nickel et al., 2011;
Yang et al., 2014; Ma et al., 2018a), translational models (Bordes et al., 2013;
Lv et al., 2018; Sun et al., 2019;
Hao et al., 2019), and deep-learning models (Dettmers et al., 2017; Schlichtkrull et al., 2018).
However, the above methods are not able to use rich dynamics available on temporal knowledge graphs.
To this end, several studies have been conducted for temporal knowledge graph reasoning (Garc´ıa-Dur´an et al., 2018; Ma et al., 2018b; Jin et al., 2019; Goel et al., 2019; Lacroix et al., 2020; Han et al., 2020a; Zhu et al., 2020).
Nevertheless, the methods are largely black-box, lacking the ability to interpret their predictions.
Recently, several explainable reasoning methods for knowledge graphs have been proposed (Das et al., 2017; Xu et al., 2019; Hildebrandt et al., 2020; Teru et al., 2019).
However, the above explainable methods can only deal with static KGs, while our model is designed for interpretable forecasting on temporal KGs.
P RELIMINARIES
Let E and P represent a ﬁnite set of entities and predicates, respectively.
A temporal knowledge graph is a collection of timestamped facts written as quadruples.
A quadruple q = ( e s , p, e o , t ) represents a timestamped and labeled edge between a subject entity e s ∈ E and an object entity e o ∈ E , where p ∈ P denotes the edge type (predicate).
The temporal knowledge graph forecasting task aims to predict unknown links at future timestamps based on observed past events.
Deﬁnition 1 (Temporal KG forecasting).
Let F represent the set of all ground-truth quadruples, and let ( e q , p q , e o ,
t q ) ∈
F denote the target quadruple.
Given a query ( e q , p q , ? , t q ) derived from the target quadruple and a set of observed facts O = { ( e i , p k , e j ,
t l ) ∈
F| t l < t q } , the temporal
KG forecasting task is to predict the missing object entity e o .
Speciﬁcally, we consider all entities in the set E as candidates and rank them by their likelihood to form a true quadruple together with the given subject-predicate-pair at timestamp t q 1 .
For a given query q = ( e q , p q , ? , t q ) , we build an inference graph G inf to visualize the reasoning process.
Unlike in temporal KGs, where a node represents an entity, each node in G inf is an entitytimestamp pair.
The inference graph is a directed graph in which a link points from a node with an earlier timestamp to a node with a later timestamp.
Deﬁnition 2 (Node in Inference Graph and its Temporal Neighborhood).
Let E represents all entities, F denotes all ground-truth quadruples, and t represents a timestamp.
A node in an inference graph G inf is deﬁned as an entity-timestamp pair v =
( e i , t ) , e i ∈ E .
We deﬁne the set of one-hop prior neighbors of v as N v =( e i ,t ) =
{ ( e j , t (cid:48) ) | ( e i , p k , e j , t (cid:48) )
∈ F ∧ ( t (cid:48) < t ) } 2 .
For simplicity, we denote one-hop prior neighbors as N v .
Similarly, we deﬁne the set of one-hop posterior neighbors of v as N v =( e i ,t ) =
{ ( e j , t (cid:48) ) | ( e j , p k , e i , t )
∈ F ∧ ( t (cid:48) > t ) } .
We denote them as N v for short.
We initialize G inf with a node v q = ( e q , t q ) consisting of the query subject and the query time.
Then we expand G inf by adding prior neighbors of e q in the temporal KG.
For example, suppose that ( e q , p k , e j , t (cid:48) ) is a valid quadruple where t (cid:48) <
t q , we add the node ( e j , t (cid:48) ) into G inf and link it with v q where the link is labeled with p k .
We provide an example in Figure 4 in the appendix to illustrate the inference graph.
O UR M ODEL
The key contribution of this paper is a novel explainable subgraph reasoning model for temporal knowledge graph forecasting.
We describe our model in a top-down fashion where we provide an overview in Section 4.1 and then explain each module from Section 4.2 to 4.7.
4. S UBGRAPH R EASONING P ROCESS
Our model conducts the reasoning process on a dynamically expanded inference graph G inf extracted from the temporal KG.
Given a query q = ( e q , p q , ? , t q ) , we initialize G inf with the query entity e q and deﬁne the tuple of ( e q , t q ) as the ﬁrst node in G inf .
The inference graph expands by sampling prior neighbors that linked with e q prior to t q .
To let the model access global information about the graph structure to get a broad view before focusing on the local subgraph, we feed the nodes into an embedding layer to obtain their query-invariant global embeddings.
The temporal relational attention (TGRA) layer takes embeddings of subgraph entities and predicates as the input, updates their hidden representations, and computes a query-dependent attention score for each edge.
We then propagate the attention from existing nodes to newly sampled nodes by means of the edge attention scores, as shown in Equation 6.
Next, we further expand G inf by sampling the prior neighbors of the nodes in G inf .
In general, the expansion will grow rapidly and cover almost all nodes after a few steps.
To prevent the inference graph from exploding, we reduce the node amount by pruning the nodes with small plausibility scores associated with the query.
As the expansion and pruning iterate, G inf allocates more and more information from the temporal KG.
Additionally, we add self-loop edges to allow xERTE to stop at a node if it believes to have reached ground-truth.
After running L inference steps, the model selects the entity with the highest plausibility score in G inf as the prediction of the missing query object, where the inference graph itself serves as a graphical explanation.
4. N EIGHBORHOOD S AMPLING
We deﬁne the set of edges between node v =
( e i , t ) and its prior neighbors N v as Q v , where q ∈ Q v is a prior edge of v .
To reduce the scope and complexity, we sample a subset of prior edges ˆ
Q v ∈ Q v at each inference step.
We denote the remaining prior neighbors and posterior neighbors of node v after the sampling as ˆ N v and ˆ N v , respectively.
The sampling can be uniform if there is no bias, it can also be temporally biased using a non-uniform distribution.
For instance, we may want to sample more edges closer to the current time point as the events that took place long ago may have less impact on the current structure and, thus, the inference.
Speciﬁcally, we propose three different sampling strategies: (1) Uniform sampling .
Each prior edge q v ∈ Q v of node v has the same probability of being selected: P ( q v )
= 1 / |Q v | .
(2) Time-aware exponentially weighted sampling .
We temporally bias the neighborhood sampling using an exponential distribution and assign the probability P ( q v = ( e i , p k , e j , t (cid:48) ))
=
exp( t (cid:48) − t ) / (cid:80) ( e i ,p l ,e m ,t (cid:48)(cid:48) ) ∈Q v exp( t (cid:48)(cid:48) − t ) to each prior neighbor, which negatively correlates with the time difference between node v and its prior neighbor ( e j , t (cid:48) ) .
(3) Time-aware linearly weighted sampling .
We use a linear function to bias the sampling.
Compared to the second strategy, the quadruples occurred in early stages have a higher probability of being sampled.
We have empirically found that the second strategy is most beneﬁcial to our framework and provide a detailed ablation study in Section 5.2.
4. E MBEDDING L AYER
In temporal knowledge graphs, graph structures are no longer static as entities and their links evolve over time. Thus, entity features may change and exhibit temporal patterns. In this work, the embeddings of an entity e i ∈ E at time t consist of a static low-dimensional vector and a functional representation of time.
The time-aware entity embeddings are deﬁned as e i =
[ ¯e i , Φ ( t )] T ∈ R d S + d T .
Here, ¯e i ∈ R d S represents the static embeddings that captures time-invariant features and global dependencies over the temporal KG.
Φ ( t ) ∈ R d T denotes a functional time encoding that represent temporal dependencies between entities (Xu et al., 2020).
We provide more details about Φ ( t ) in
Appendix I. d S and d T represent the dimensionality of static embeddings and time embeddings, which can be tuned according to the temporal fraction of the given dataset.
We also tried the temporal encoding presented in Goel et al.
(2019), which has signiﬁcantly more parameters.
But we did not see considerable improvements.
Besides, we assume that predicate features do not evolve and learn a stationary embedding vector p k for each predicate
4. T EMPORAL R ELATIONAL G RAPH A TTENTION L AYER
Here, we propose a temporal relational graph attention (TRGA) layer for identifying the relevant evidence in the inference graph related to a given query q .
The input to the TRGA layer is a set of embeddings of entities and predicates in an inference graph. The layer produces a query-dependent attention score for each edge and a new set of hidden representations as its output.
Similar to GraphSAGE (Hamilton et al., 2017) and GAT (Veliˇckovi´c et al., 2017), the TRGA layer performs a local representation aggregation.
To avoid misusing future information, we only allow message passing from prior neighbors to posterior neighbors.
Speciﬁcally, for each node v in the inference graph, the aggregation function fuses the representation of node v and the sampled prior neighbors ˆ N v to output a time-aware representation for v .
Since entities may play different roles depending on the predicate they are associated with, we incorporate the predicate embeddings in the attention function to exploit relation information.
Instead of treating all prior neighbors with equal importance, we take the query information into account and assign varying importance levels to each prior neighbor
u ∈ ˆ N v by calculating a query-dependent attention score using
[Equation]
where e l vu ( q, p k ) is the attention score of the edge ( v, p k , u ) regarding the query q
= ( e q , p q , ? , t q ) , p k corresponds to the predicate between node u and node v , p k and p q are predicate embeddings.
h lv denotes the hidden representation of v at the l th inference step, W lsub and W lobj are two weight matrices for capturing the dependencies between query features and node features.
|| denotes the concatenation operator.
Then, we compute the normalized attention score α lvu ( q, p k ) using the softmax function as follows
[Equation]
where P vw represents the set of observed predicates connecting nodes v and w .
Once obtained, we aggregate the representations of prior neighbors and weight them using the normalized attention scores, which is written as
[Equation]
Similar to (Hamilton et al., 2017), we combine the hidden representation h l − 1 v ( q ) of node v with the aggregated neighborhood representation (cid:101)
h lv ( q ) and feed them into a fully connected layer with a LeakyReLU activation function σ ( · ) , as shown below
[Equation]
where h l v ( q ) denotes the representation of node v at the l th inference step, and γ is a hyperparameter.
Further, we update the relation embeddings as follows,
[Equation]
Thus, we project the relations to the same embedding space as nodes and allow them to be utilized in the next inference step.
4. A TTENTION P ROPAGATION AND S UBGRAPH P RUNING
After having the attention score of each edge in the inference graph, we compute the plausibility score a le i ,q of an entity e i regarding the query q as follows:
[Equation]
where v ( e ) represents the entity included in node v , a lv,q denotes the plausibility score of node v at the l th inference step, and g ( · ) represents a score aggregation function.
As stated in Deﬁnition 2, each node in inference graph is an entity-timestamp pair.
To assign each entity a unique score, we aggregate the plausibility scores of nodes where their entities are the same.
We try two score aggregation functions g ( · ) , i.e., summation and mean.
We conduct an ablation study and ﬁnd that the summation aggregation performs better.
Detailed results are shown in Section 5.2.
We prune the inference graph at each inference step and keep the edges with K largest edge scores, where the score of an edge is deﬁned as the product of the attention score α lvu ( q, p k ) and the plausibility score a lv,q of the source node.
K is a preﬁxed parameter.
To reduce the time complexity, we recalculate attention scores and plausibility scores on the pruned inference graph.
Thus, the scores of removed edges do not involve into the softmax denominator, signiﬁcantly speeding up the backpropagation, which refers to the loss function of Equation 7.
We set the plausibility score of entities the inference graph does not include to zero.
We then rank all entity candidates according to their plausibility scores and choose the entity with the highest score as our prediction.
4. R EVERSE R EPRESENTATION U PDATE M ECHANISM
When humans perform a reasoning process, the perceived proﬁle of an entity during the inference may change as new evidence joins the reasoning process.
For example, we want to predict the proﬁtability of company A.
We knew that A has the largest market portion, which gives us a high expectation about A’s proﬁtability.
However, a new evidence shows that conglomerate B enters this market as a strong competitor.
Although the new evidence is not directly related to A, it indicates that there will be a high competition between A and B, which lowers our expectation about A’s proﬁtability.
To mimic human reasoning behavior, we should ensure that all existing nodes in an inference graph G inf can receive messages from a new node when this node is added to G inf .
However, since G inf expands once at each inference step, it might include l -hop neighbors of the query subject at the l th step.
The vanilla solution is to iterate the message passing l times at the l th inference step, which means that we need to run the message passing (1 + L ) · L/ 2 times in total, for L inference steps.
To avoid the quadratic increase of message passing iterations, we propose a novel reverse representation update mechanism for subgraph reasoning.
Recall that, to avoid violating temporal constraints, we use prior neighbors to update nodes’ representations.
And at each inference step, we expand G inf by adding prior neighbors of existing nodes.
For example, assuming that we are at the fourth inference step, for a node that has been added at the second step, we only need to aggregate messages from nodes added at the third and fourth steps.
Hence, we can update the representations of nodes in reverse order as they have been added in G inf .
Speciﬁcally, at the l th inference step, we ﬁrst update the representations of nodes added at the ( l − 1) th inference step, then the nodes added at ( l − 2) th , and so forth until l = 0 , as shown in Algorithm 1 in the appendix.
In this way, we compute messages along each edge in G inf only once and ensure that every node can receive messages from its farthest prior neighbor.
4. L EARNING
We split quadruples of a temporal KG into train , validation , and test sets by timestamps, ensuring (timestamps of training set) <
(timestamps of validation set) <
(timestamps of test set).
We use the binary cross-entropy as the loss function, which is deﬁned as
[Equation]
where E infq represents the set of entities in the inference graph of the query q , y e i ,q represents the binary label that indicates whether e i is the answer for q , and Q denotes the set of training quadruples.
a Le i ,q denotes the plausibility score of e i at the ﬁnal inference step.
We use Adam optimizer (Kingma & Ba, 2014) to learn model parameters.
E XPERIMENTS 5. D ATASETS AND B ASELINES
Integrated Crisis Early Warning System (ICEWS)
(Boschee et al., 2015) and YAGO (Mahdisoltani et al., 2013) have established themselves in the research community as benchmark datasets of temporal KGs.
The ICEWS dataset contains information about political events with time annotations, e.g., ( Barack Obama, visit, Malaysia, 2014-02-19).
We evaluate our model on three subsets of the ICEWS dataset, i.e., ICEWS14, ICEWS18, and ICEWS05-15, that contain event facts in 2014, 2018, and the facts from 2005 to 2015, respectively.
The YAGO dataset is a temporal knowledge base that fuses information from Wikipedia with the English WordNet dataset (Miller, 1995).
Following the experimental settings of HyTE (Dasgupta et al., 2018), we use a subset and only deal with year level granularity by dropping the month and date information.
We compare our approach and baseline methods by performing the link prediction task on the ICEWS14, ICEWS18, ICEWS0515, and YAGO datasets.
The statistics of the datasets are provided in Appendix C.
We compare xERTE with benchmark temporal KG and static KG reasoning models.
From the temporal KG reasoning models, we compare our model with several state-of-the-art methods, including TTransE (Leblay & Chekol, 2018), TA-DistMult/TA-TransE
(Garc´ıa-Dur´an et al., 2018),
DE-SimplE(Goel et al., 2019), TNTComplEx (Lacroix et al., 2020), CyGNet(Zhu et al., 2020), and
RE-Net (Jin et al., 2019).
From the static KG reasoning models, we choose TransE (Bordes et al., 2013), DistMult (Yang et al., 2014), and ComplEx (Trouillon et al., 2016) where we compress temporal knowledge graphs into a static, cumulative graph by ignoring the time information.
5. E XPERIMENTAL R ESULTS AND A BLATION S TUDY
[Figure]
[Table]
Comparison results Table 1 summarizes the time-aware ﬁltered results of the link prediction task on the ICEWS and YAGO datasets.
The time-aware ﬁltering scheme only ﬁlters out triples that are genuine at the query time while the ﬁltering scheme applied in prior work (Jin et al., 2019;
Zhu et al., 2020) ﬁlters all triples that occurred in history.
A detailed explanation is provided in
Appendix D. Overall, xERTE outperforms all baseline models on ICEWS14/05-15/18 in MRR and
Hits@1/3/10 while being more interpretable.
Compared to the strongest baseline RE-Net, xERTE obtains a relative improvement of 5% and 9% in MRR and Hits@1, which are averaged on these three datasets.
Especially, xERTE achieves more gains in Hits@1 than in Hits@10.
It conﬁrms the assumption that subgraph reasoning helps xERTE make a sharp prediction by exploiting local structures.
On the YAGO dataset, xERTE achieves comparable results with RE-Net.
To assess the importance of each component, we conduct several ablation studies and show their results in the following.
Representation update analysis We train a model without the reverse representation update mechanism to investigate how this mechanism contributes to our model.
Since the reverse representation update ensures that each node can receive messages from all its prior neighbors in the inference graph, we expect this mechanism could help nodes mine available information.
This update mechanism should be especially important for nodes that only have been involved in a small number of events.
Since the historical information of such nodes is quite limited, it is very challenging to forecast their future behavior.
In Figure 2a and 2b we show the metrics of Hits@1 and Hits@10 against the number of nodes in the inference graph.
It can be observed the model with the reverse update mechanism performs better in general.
In particular, this update mechanism significantly improves the performance if the query subject only has a small number of neighbors in the subgraph, which meets our expectation.
[Figure]
Time-aware representation analysis To verify the importance of the time components
, we evaluate the performance of a model without time encoding.
It can be observed in Figure 2c, removing the time-dependent part from entity representations sacriﬁces the model’s performance signiﬁcantly.
Recall that each node in the inference graph G inf is associated with a timestamp, the same entity might appear several times in G inf with different timestamps.
To get a uniﬁed score for each entity, we aggregate the plausibility scores of nodes where their entities are the same.
Figure 2d shows that the summation aggregator brings a considerable gain on ICEWS14.
Sampling analysis We run experiments with different sampling strategies proposed in Section 4.2.
To assess the necessity of the time-aware weighted sampling, we propose a deterministic version of time-aware weighted sampling, where we chronologically sort the prior edges of node v in terms of their timestamps and select the last N edges to build the subset ˆ Q v .
The experimental results are provided in Table 2 in Appendix.
We ﬁnd that the sampling strategy has a considerable inﬂuence on model’s performance.
Sampling strategies that bias towards recent quadruples perform better.
Speciﬁcally, the exponentially time-weighted strategy performs better than the linear time-weighted strategy and the deterministic last-N-edges strategy.
Time cost analysis The time cost of xERTE is affected not only by the scale of a dataset but also by the number of inference steps L .
Thus, we run experiments of inference time and predictive power regarding different settings of L and show the results in Figures 2e and 2f.
We can see that the model achieves the best performance with L = 3 while the training time signiﬁcantly increases as L goes up.
To make the computation more efﬁcient, we develop a series of segment operations for subgraph reasoning.
Please see Appendix G for more details.
5. G RAPHICAL E XPLANATION AND H UMAN E VALUATION
The extracted inference graph provides a graphical explanation for model’s prediction.
To demonstrate which facts are important for the reasoning process, we assign each edge in the inference graph a contribution score.
Speciﬁcally, the contribution score is deﬁned as c uv ( q, p k ) =
e uv ( q, p k )
α v (see
Equation 1 and 6 for e uv and α v ), where node u is a prior neighbor of node v in terms of the predicate p k .
Thus, users can trace back the important evidence that the prediction mainly depends on.
We study a query chosen from the test set, where we predict whom will Catherine Ashton visit on
Nov. 9, 2014 and show the ﬁnal inference graph in Figure 3.
In this case, the model’s prediction is Oman.
And ( Catherine Ashton, express intent to meet or negotiate, Oman, 2014-11-04) is the most important evidence to support this answer.
To assess whether the evidence is informative for users in an objective setting, we conducted a survey where respondents judge the relevance of the extracted evidence to the prediction.
More concretely, we set up an online quiz consisting of 7 rounds.
Each round is centered around a query sampled from the test set of ICEWS14/ICEWS0515.
Along with the query statement and the ground-truth answer, we present the human respondents with two facts in the inference graph with high contribution scores and two facts with low contribution scores in a randomized order.
Speciﬁcally, each evidence is based on a chronological reasoning path that connects the query subject with an object candidate.
For example, given a query ( police, arrest, ?, 2014-12-28), an extracted evidence is that police made statements to lawyers on 2014-12-08, then lawyers were criticized by citizens on 2014-12-10.
In each round, we set up three questions to ask the participants to choose the most relevant evidence, the most irrelevant evidence, and sort the evidences according to their relevance.
Then we rank the evidences according to their contribution scores computed by our model and check whether the relevance order classiﬁed by the respondents matches that estimated by our models.
We surveyed 53 participants, and the average accuracy of all questions is 70.5%.
Moreover, based on a majority vote, 18 out of 21 questions were answered correctly, indicating that the extracted inference graphs are informative, and the model is aligned with human intuition.
The complete survey and a detailed evaluation are reported in Appendix H.
C ONCLUSION
We proposed an explainable reasoning approach for forecasting links on large-scale temporal knowledge graphs.
For each query, the model extracts a speciﬁc subgraph that can be seen as a graphical explanation of the prediction.
Extensive experiments on four benchmark datasets of temporal knowledge graphs demonstrate the effectiveness of our method.
We also conducted a survey about the evidence included in the extracted subgraph.
The results indicate that the evidence is informative for humans.
A PPENDIX
[Table]
Input: Inference graph G inf , nodes in the inference graph V , nodes that have been added into G inf at the l th inference step V l , sampled prior neighbors ˆ N v , hidden representation at the ( l - 1) th step h l − 1 v , entity embeddings e i , weight matrices W lsub , W lobj , and W lh , query q = ( e q , p q , ? , t q ) , update ratio γ .
Output: Hidden representations h lv at the l th inference step, ∀ v ∈ V .
1: for t = l − 1 , ..., 0 do 2: for v ∈ V t do 3: for u ∈ ˆ N v do 4:
[Equation]
5: α
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
6: end for 7: (cid:101)
[Equation]
o z ∈P vu α lvu ( q, p k ) h
l − 1 u ( q ) , 8: h lv ( q ) =
σ ( W lh ( γ h l − 1 v ( q ) + (1 − γ ) (cid:101) h lv ( q ) + b lh )) 9: end for 10: end for 11: Return h lv , ∀ v ∈ V .
The entity at an Speciﬁcally, the true quadruple in this graph are as follows: { ( e 0 , p 1 , e 1 , t 1 ) , ( e 0 , p 2 , e 1 , t 2 ) , ( e 0 , p 3 , e 2 , t 2 ) , ( e 0 , p 1 , e 2 , t 0 ) } .
Note that t 3 is posterior to t 0 , t 1 , t 2 .
A R ELATED W ORK A. K NOWLEDGE G RAPH M ODELS
Representation learning is an expressive and popular paradigm underlying many KG models.
The key idea is to embed entities and relations into a low-dimensional vector space.
The embedding- based approaches for knowledge graphs can generally be categorized into bilinear models (Nickel et al., 2011; Balaˇzevi´c et al., 2019), translational models (Bordes et al., 2013; Sun et al., 2019), and deep-learning models (Dettmers et al., 2017; Schlichtkrull et al., 2018).
Besides, several studies (Hao et al., 2019; Lv et al., 2018; Ma et al., 2017) explore the ontology of entity types and relation types and utilize type-based semantic similarity to produce better knowledge embedding.
However, the above methods lack the ability to use rich temporal dynamics available on temporal knowledge graphs.
To this end, several studies have been conducted for link prediction on temporal knowledge graphs (Leblay & Chekol, 2018;
Garc´ıa-Dur´an et al., 2018; Ma et al., 2018b; Dasgupta et al., 2018;
Trivedi et al., 2017; Jin et al., 2019;
Goel et al., 2019; Lacroix et al., 2020).
Ma et al.
(2018b) developed extensions of static knowledge graph models by adding a timestamp embedding to their score functions.
Besides, Garc´ıa-Dur´an et al.
(2018) suggested a straight forward extension of some existing static knowledge graph models that utilize a recurrent neural network (RNN) to encode predicates with temporal tokens derived by decomposing given timestamps.
Also, HyTE (Dasgupta et al., 2018) embeds time information in the entity-relation space by arranging a temporal hyperplane to each timestamp.
However, these models cannot generalize to unseen timestamps because they only learn embeddings for observed timestamps.
In contrast, Know-Evolve (Trivedi et al., 2017) learns evolving entity representations using point processes, being able to infer embeddings at a future timestamp.
Nevertheless, the methods are largely black box, lacking the ability to interpret their prediction results while our main focus is to employ an integrated transparency mechanism for archiving human-understandable results.
A. E XPLAINABLE REASONING ON K NOWLEDGE G RAPHS
Recently, several explainable reasoning methods for knowledge graphs have been proposed (Das et al., 2017; Xu et al., 2019; Hildebrandt et al., 2020) .
Das et al.
(2017) proposed a reinforcement learning based path searching approach to display the query subject and predicate to the agents and let them perform a policy guided walk to the correct object entity.
The reasoning paths produced by the agents can explain the prediction results to some degree.
Also, Hildebrandt et al.
(2020) framed the link prediction task as a debate game between two reinforcement learning agents that extract evidence from knowledge graphs and allow users to understand the decision the agents.
Besides, and more related to our work, Xu et al.
(2019) models a sequential reasoning process by dynamically constructing an input-dependent sub-graph.
The difference here is that these explainable methods can only deal with static KGs, while our model is designed for interpretable forecasting on temporal
KGs.
B W ORKFLOW
We show the workﬂow of the subgraph reasoning process in Figure 5.
The model conducts the reasoning process on a dynamically expanding inference graph G inf extracted from the temporal KG.
This inference graph gives an interpretable graphical explanation about the ﬁnal prediction.
Given a query q = ( e q , p q , ? , t q ) , we initialize the inference graph with the query entity e q and deﬁne the tuple of ( e q , t q ) as a node in the inference graph (Figure 5a).
The inference graph expands by sample neighbors that have been linked with e q before t q , as shown in Figure 5b.
The expansion would go rapidly that it covers almost all nodes after a few steps.
To prevent the inference graph from exploding, we constrain the number of nodes by pruning the nodes that are less related to the query (Figure 5c) .
Here, we propose a query-dependent temporal relational attention mechanism in Section 4. to identify the nodes’ importance in the inference graph for query q and aggregate information from nodes’ local neighbors.
Next, we sample the past neighbors of the remaining nodes in the inference graph to expand it further, as shown in Figure 5d.
As this process iterates, the inference graph incrementally gains more and more information from increasingly larger neighborhoods of the temporal
KG.
After running L inference steps, the model predicts the missing entity in the query based on the entities in the inference graph, where the inference graph serves as a graphical explanation for the prediction. [Figure] [Table] [Table]
[Table]
[Table] |E [Table] | |E
[Table]
| / |E| |E
[Table]
| |E|
[Table]
C D ATASET S TATISTICS
We provide the statistics of datasets in Table 3.
Since we split each dataset into subsets by timestamps, ensuring (timestamps of training set) <
(timestamps of validation set) <
(timestamps of test set), a considerable amount of entities in test sets are new.
We report the number of entities in each subset in Table 4.
Besides
[Table] since we focus local neighbors [Table] it is necessary to answer the question of ”what is the accuracy of the prediction if we randomly choose an entity from the one-hop or two-hop neighbors?”.
It is equivalent to the ratio of the number of ground truth entities to the number of prior neighbors.
We show the results regarding the one-hop neighborhood in Table 5 and the results regarding the two-hop neighborhood in Table 6.
[Table]
[Table]
number of all two-hop prior neighbors. |N s ( p,t q ) | denotes the averaged number of ground truth objects that are two-hop prior neighbors of s . Ratio means the ratio of |N s ( p,t q ) | to |N s ( t<t q ) | .
D E VALUATION PROTOCOL
For each quadruple q = ( e s , p, e o , t ) in the test set G test , we create two queries: ( e s , p, ? , t ) and ( e o , p − 1 , ? , t ) , where p − 1 denotes the reciprocal relation of p .
For each query, the model ranks all entities E inf q in the ﬁnal inference graph according to their scores.
If the ground truth entity does not appear in the ﬁnal subgraph, we set its rank as |E| (the number of entities in the dataset).
Let ψ e s and ψ e o represent the rank for e s and e o of the two queries respectively.
We evaluate our models using standard metrics across the link prediction literature: mean reciprocal rank (MRR) :2 ·|G test | (cid:80) q ∈G test ( 1 ψ es + 1 ψ eo ) and Hits @
k ( k ∈ { 1 , 3 , 10 } ) : the percentage of times that the true entity candidate appears in the top k of the ranked candidates.
In this paper, we consider two different ﬁltering settings.
The ﬁrst one is following the ranking technique described in Bordes et al.
(2013), where we remove from the list of corrupted triplets all the triplets that appear either in the training, validation, or test set.
We name it static ﬁltering .
Trivedi et al.
(2017) and Jin et al.
(2019) use this ﬁltering setting for reporting their results on temporal KG forecasting.
However, this ﬁltering setting is not appropriate for evaluating the link prediction on temporal KGs.
For example, there is a test quadruple (Barack Obama, visit, India, Jan.
and we perform the object prediction (Barack Obama, visit, ?, Jan. 25, 2015).
Besides, we have observed the quadruple (Barack Obama, visit, Germany, Jan. 18, 2013) in the training set.
According to the static ﬁltering, (Barack Obama, visit, Germany) will be considered as a genuine triplet at the timestamp of Jan. 25, 2015 and will be ﬁltered out since the triplet (Barack Obama, visit, Germany) appears in the training set in the quadruple (Barack Obama, visit, Germany, Jan.
However, the triplet (Barack Obama, visit, Germany) is only temporally valid on Jan.
18, 2013 but not on Jan. 25, 2015.
Therefore, we apply another ﬁltering scheme, which is more appropriate for the link forecasting task on temporal KGs.
We name it time-aware ﬁltering .
In this case, we only ﬁlter out the triplets that are genuine at the timestamp of the query.
In other words, if the triplet (Barack Obama, visit, Germany) does not appear at the query time of Jan. 25, 2015, the quadruple (Barack Obama, visit, Germany, Jan. 25, 2015) is considered as corrupted and will be ﬁltered out.
We report the time-aware ﬁltered results of baselines and our model in Table 1.
E I MPLEMENTATION
We implemented our model and all baselines in PyTorch (Paszke et al., 2019).
Besides, we use the datasets augmented with reciprocal relations to train all baseline models.
We tune hyperparameters of our models using a grid search.
We set the learning rate to be 0.0002, the batch size to be 128, the inference step L to be 3, the static embedding dimensions d S to be 256, and time embedding dimensions d T to be 256.
We implement TTransE, TA-TransE/TA-DistMult, and RE-Net based on the code § provided in (Jin et al., 2019).
We use the released code to implement DE-SimplE ¶ , TNTComplEx (cid:107) , and CyGNet ∗∗ .
We use the binary cross-entropy loss to train these baselines and optimize hyperparameters by early stopping according to MRR on the validation set.
F R EVERSE REPRESENTATION UPDATE MECHANISM FOR SUBGRAPH REASONING
In this section, we explain an additional reason why we have to update node representations along edges selected in previous inference steps.
We show our intuition by a simple query in Figure 6 with two inference steps.
We do not apply the pruning procedure.
First, we check the equations without updating node representations along previously selected edges.
First inference step: h 10 =
f
( h 00 , h 01 , h 02 , h 03 ) h
= hh 
 = hh
= h
Second inference step: h 20 = f
( h 10 , h 11 , h 12 , h 13 )
=
f ( h 10 , h 01 , h 02 , h 03 ) h
= f ( h 11 , h 04 , h 05 )
=
f {+( h 01 , h 04 , h 05 ) h 
 = f ( h 13 , h 06 ) = f ( h 03 , h 06 ) h 
 = f ( h 12 , h 07 , h 08 )+}
= f ( h 02 , h 07 , h 08 )
Note that h 20 is updated with h 01 , h 02 , h 03 and has nothing to do with h 04 , h 05 , h 06 , h 07 , h 08 , i.e., two-hop neighbors.
In comparison, if we have full access to the graph all the time, we are able to aggregate information of two-hop neighbors in the second layer.
If we update the node representations along previously selected edges, the update in second layer changes to:
Second inference step part a: h 24 = hh 25 = hh 26 = hh
= hh
= h
Second inference step part b: h 21 =
f ( h 11 , h 24 , h 25 )
h
= f ( h 12 , h 27 , h 28 ) h
=
f
( h 13 , h 26 )
Second inference step part c: h 20 = f ( h 10 , h 21 , h 22 , h 23 )
Thus, the node 1 ∼ 3 receive messages from node 4 ∼ 8, i.e. h {+
+}
= f ( h 11 , h 24 , h 25 ) .
And they can pass the information to the query subject (node 0), i.e., h 20 = f ( h 10 , h 21 , h 22 , h 23 ) .
G S EGMENT O PERATIONS
The degree of entities in temporal KGs, i.e., ICEWS, varies from thousands to a single digit.
Thus, the size of inference graphs of each query is also different.
To optimize the batch training, we deﬁne an array to record all nodes in inference graphs for a batch of queries.
Each node is represented by (inference graph index, entity index, timestamp, node index).
The node index is the unique index to distinguish the same node in different inference graphs.
Note that the inference graphs of two queries may overlap, which means they have the same node in their inference graphs.
But the query-dependent node representations would be distinct in different inference graphs.
To avoid mixing information across different queries, we need to make sure that tensor operations can be applied separately to nodes in different inference graphs.
Instead of iterating through each inference graph, we develop a series of segment operations based on matrix multiplication.
The segment operations signiﬁcantly improve time efﬁciency and reduce the time cost.
We report the improvement of time efﬁciency on ICEWS14 in Table 7.
Additionally, we list two examples of segment operations in the following.
[Table] Segment Sum Given a vector x ∈ R d and another vector s ∈ R d that indicates the segment index of each element in x , the segment sum operator returns the summation for each segment.
For example, we have x = [3 , 1 , 5] T and s = [0 , 0 , 1] T , which means the ﬁrst two element of x belong to the 0 th segment and the last elements belongs to the ﬁrst segment.
The segment sum operator returns [4 , 5] T as the output.
It is realized by creating a sparse matrix Y ∈ R n × d , where n denotes the number of segments.
We set 1 in positions { ( s [ i ] , i ) , ∀ i ∈ { 0 , ..., d }} of Y and pad other positions with zeros.
Finally, we multiply Y with x to get the sum of each segment.
Segment Softmax The standard softmax function σ : R K → R K is deﬁned as:
[Equation]
The segment softmax function has two inputs: z ∈ R K contains elements to normalize and s ∈ R K denotes the segment index of each element.
It is then deﬁned as:
[Equation]
, where s i denotes the segment that z
i is in.
The segment softmax function can be calculated by the following steps:
We apply the exponential function to each element of z and then apply the segment sum operator to get a denominator vector d .
We need broadcast d such that it aligns with z , which means d [ i ] is the summation of segment s [ i ] .
We apply element-wise division between d and z .
H S URVEY
In this section, we provide the online survey (see Section 5.3 of the main body) and the evaluation statistics based on 53 respondents.
To avoid biasing the respondents, we did not inform them about the type of project that we have been working on.
Further, all questions are permuted at random.
We set up the quiz consisting of 7 rounds.
In each round, we sample a query from the test set of
ICEWS14/ICEWS0515.
Along with the query statement and the ground-truth object, we present the users two facts extracted from the inference graph with high contribution scores and two facts with low contribution scores in randomized order.
The respondents are supposed to judge the relevance of the statements to the query in two levels, namely relevant or less relevant.
There are three questions in each round that ask the participants to give the most relevant statement, the most irrelevant statement, and rank the statements according to their relevance.
The answer to the ﬁrst question is classiﬁed as correct if a participant gives one of the two relevant statements as the most relevant statement.
Similarly, the answer to the second question is classiﬁed as correct if the participant gives one of the two removed statements as the most irrelevant statement.
For the relevance ranking task, the answer is right if the participant ranks the two relevant statements higher than the removed statements.
H. P OPULATION
We provide the information about gender, age, education level of the respondents in Figure 7. [Figure]
H. AI Q UIZ
You will participate in a quiz consisting of eight rounds.
Each round is centered around an international event.
Along with the event, we also show you four reasons that argue why the given event happened.
While some evidence may be informative and explain the occurrence of this event, others may irrelevant to this event.
Your task is to ﬁnd the most relevant evidence and most irrelevant evidence, and then sort all four evidences according to their relevance.
Don’t worry if you feel that you cannot make an informed decision: Guessing is part of this game!
Additional Remarks: Please don’t look for external information (e.g., Google, Wikipedia) or talk to other respondents about the quiz.
But you are allowed to use a dictionary if you need vocabulary clariﬁcations.
Example
Given an event, please rank the followed evidences according to their relevance to the given event.
Especially, please select the most relevant reason, the most irrelevant reason, and rank the relevance from high to low.
Event: French government made an optimistic comment about China on 2014-11-24.
A. First, on 2014-11-20, South Africa engaged in diplomatic cooperation with Morocco.
Later, on 2014-11-21, a representative of the Morocco government met a representative of the French government.
B. First, on 2014-11-18, the Chinese government engaged in negotiation with the Iranian government.
Later, on 2014-11-21, a representative of the French government met a representative of the Chinese government.
C. On 2014-11-23, the French hosted a visit by Abdel Fattah Al-Sisi.
D. A representative of the French government met a representative of the Chinese government on 2014-11-21.
Correct answer
Most relevant: D
Most irrelevant: A
Relevance ranking: D B C A
Tasks
Event:
On 2014-12-17, the UN Security Council accused South Sudan.
A. South Africa engaged in diplomatic cooperation with South Sudan on 2014-12-11.
B. First, on 2014-11-17, Uhuru Muigai Kenyatta accused UN Security Council.
Later, on 2014-1126, the UN Security Council provided military protection to South Sudan.
C. On 2014-12-16, UN Security Council threatened South Sudan with sanctions.
D. South Sudan hosted the visit of John Kerry on 2014-12-16.
Most relevant: Most irrelevant: Relevance ranking: 2.
Event: Indonesia police arrested and retained an Indonesia citizen at 2014-12-28.
A.
The Indonesia police claimed that an attorney denounced the citizen on 2014-12-10.
B. Zaini Abdullah endorsed the Indonesia citizen on 2014-12-25.
C. The Indonesia police made an optimistic comment on the citizen on 2014-12-14.
D. The Indonesia police investigated the citizen on 2014-12-08.
Most relevant: Most irrelevant: Relevance ranking: 3.
Event:
A citizen from Greece protested violently against the police of Greece on 2014-11-17 .
A.
The Greek head of government accused the political party “Coalition of the Radical Left” on 2014-05-25.
B. Greek police refused to surrender to the Greek head of government on 2014-10-15.
C. Greek citizens gathered support on behalf of John Kerry on 2014-11-17.
D. Greek police arrested and detained another Greek police ofﬁcer on 2014-11-04.
Most relevant: Most irrelevant: Relevance ranking: 4.
Event: Ra´ul Castro signed a formal agreement with Barack Obama on 2014-12-17.
A. First, on 2009-01-28, Dmitry A. Medvedev made statements to Barack Obama.
Later, on 200901-30, Ra ´ ul Castro negotiated with Dmitry A. Medvedev.
B. Ra ´ ul Castro visited Angola on 2009-07-22.
C. Ra ´ ul Castro hosted a visit of Evo Morales on 2011-09-19.
D. First, on 2008-11-05, Evo Morales hosted a visit of Barack Obama.
Later, on 2011-09-19, Ra ´ ul Castro appeal for de-escalation of military engagement to Evo Morales.
Most relevant: Most irrelevant: Relevance ranking: 5.
Event:
The head of the government of Ukraine considered to make a policy option with Angela Merkel on 2015-07-10.
A First on 2014-07-04, the armed rebel in Ukraine used unconventional violence to the military of Ukraine.
Later, on 2014-07-10, the head of government of Ukraine made statements to the armed rebel in Ukraine.
B. The head of the government of Ukraine expressed intent to meet with Angela Merkel on 201410-30.
C. First, on 2014-07-04, the armed rebel in Ukraine used unconventional violence to the military of Ukraine.
Later, on 2014-07-19, the head of government of Ukraine made statements to the armed rebel in Ukraine.
D. The head of the government of Ukraine consulted with Angela Merkel on 2015-06-06.
[Table]
irrelevant: Relevance ranking: 6.
Event:
On 2014-08-09, Ukraine police arrested a member of the Ukraine military.
A. First, on 2014-07-23, a member of Ukraine parliament consulted the head of the Ukraine government.
Later, on 2014-07-24, the head of government made a statement to the Ukraine police.
B. First, on 2014-06-25, the military of Ukraine used violence to an armed rebel that occurred in Ukraine.
Later, on 2014-07-10, the armed rebel used violence to the Ukraine police.
C. First, on 2005-02-20, the military of Ukraine made a statement to the head of the government of Ukraine.
Later, on 2005-07-18, the head of government of Ukraine appealed for a change in leadership of the Ukraine police.
D. On 2014-07-31, the head of the Ukraine government praised the Ukraine police.
Most relevant: Most irrelevant: Relevance ranking:
Event:
The Ofﬁce of Business Affairs of Bahrain negotiated with the Labor and Employment Ministry of Bahrain on 2015- A First
, on 2014- 27, the undersecretary of Bahrain made statements to
the
Labor
and
Employment Ministry
of
Bahrain.
Later
, on
21, an ofﬁcer of Business Affairs of Bahrain signed a formal agreement with the undersecretary of
Bahrain.
B. On
the ofﬁce of Business Affairs of Bahrain expressed intent to provide policy support to the employees in Bahrain.
C.
First
, on 2006-11- , the employees in Bahrain made statements with the special Rapporteurs of the United Nation
Later, on
the
ofﬁce
of Business Affairs of Bahrain reduced relations with the employees in Bahrain
D. A representative of the Labor and Employment Ministry of Bahrain consulted with a representa tive of the Ofﬁce of Business Affairs of Bahrain on 2014-
Most relevant: Most irrelevant: Relevance ranking:
H. G ROUND T RUTH A NSWERS
Question 1 :
Most relevant: B/C
Most irrelevant: A/D
Relevance ranking: BCAD/BCDA/CBAD/CBDA
Question 2 :
Most relevant: A/D
Most irrelevant: B/C
Relevance ranking: ADBC/ADCB/DABC/DACB
Question 3 :
Most relevant: B/D
Most irrelevant: A/C
Relevance ranking: BDAC/BDCA/DBAC/DBCA
Question 4 :
Most relevant: A/D
Most irrelevant: B/C
Relevance ranking: ADBC/ADCB/DABC/DACB
Question 5 :
Most relevant: B/D
Most irrelevant: A/C
Relevance ranking: BDAC/BDCA/DBAC/DBCA
Question 6 :
Most relevant: B/C.
Most irrelevant: A/D
Relevance ranking: BCAD/BCDA/CBAD/CBDA
Question 7 :
Most relevant: A/D
Most irrelevant: B/C
Relevance ranking: ADBC/ADCB/DABC/DACB
H. E VALUATION
The evaluation results of 53 respondents are shown in Figure 8.
I A DDITIONAL ANALYSIS OF TIME - AWARE ENTITY REPRESENTATIONS
We use a generic time encoding (Xu et al., 2020) deﬁned as Φ ( t )
= (cid:113)
d [cos( ω 1 t ) , ...., cos( ω d t )] to generate the time-variant part of entity representations (please see Section 4.2 for more details).
As shown in Figure 2c in the main paper, removing the time-dependent part from entity representations sacriﬁces the model’s performance signiﬁcantly.
Moreover, time-aware representations have considerable inﬂuence on the temporal attention mechanism.
To make our point, we conduct a case study and extract the edges’ attention scores from the ﬁnal inference graph.
Speciﬁcally, we study the attention scores of the interactions between military and student at different timestamps in terms of the query ( student , criticize , ?, Nov. 17, 2014).
We list the results of the model with time encoding in Table 8 and the results of the model with stationary embeddings in Table 9.
As shown in Table 8, by means of the time-encoding, quadruples that even have the same subject, predicate, and object have different attention scores.
Speciﬁcally, quadruples that occurred recently tend to have higher attention scores.
This makes our model more interpretable and effective.
For example, given three quadruples { ( country A, accuse, country B, t 1 ) , ( country A, express intent to negotiate with, country B, t 2 ) , ( country A, cooperate with, country B, t 3 ) } , country
A probably has a good relationship with B at t if ( t 1 < t 2 < t 3 < t ) holds.
However, there would be a strained relationship between A and B at t if ( t > t 1 > t 2 > t 3 ) holds.
Thus, we can see that the time information is crucial to the reasoning, and attention values should be time-dependent.
In comparison, Table 9 shows that the triple (military, use conventional military force, student) has randomly different contribution scores at different timestamps, which is less interpretable.
[Table]
[Table]