For each triple (h, r, t) in KG, we employ vectors to represent the entity pair and the relation.
h∈R d denotes the head entity h, t∈R d denotes the tail entity t and r∈R d indicates the relation r. We assume the paths connecting two entities contain indicative information for the direct relation between these two entities.