h and t, as a transition, due to the hierarchical structure of knowledge graphs.
we use D r (h, r, t) as follows to denote the plausibility of a triplet (h, r, t) illustrated by Figure 1(a): where the closer h + r is to t, the more likely the triplet (h, r, t) exists.