In order to model the relation between the query entity pair, we assume that there exists an underlying latent variable (paths connecting two nodes) in the KG, which carries the equivalent semantics of their relations.
due to the intractability of connections in large KGs, we propose to use variation inference to maximize the evidence lower bound.