The KB is then encoded as a graph G, with entities represented as nodes, and triple (h, r, t) a directed edge from node h to node t. We formally define KB completion as a binary classification problem.
given a particular relation r, for any entity pair (h, t) such that (h, r, t) / ∈ O, we would like to judge whether h and t should be linked by r, by exploiting the graph structure of G. Let R ⊆ R denote a set of relations to be predicted.