ReFactorGNNs

Hence, each atomic term of the sum can be seen as a messagevectorbetween v andv'sneighbouringnode. In the paper, we chose DistMult and GD because of their mathematical simplicity,leading toeasier-to-read formulas. For example, here we offer a specific derivation for ComplEx[39]. For scalability w.r.t. the number of triplets/edges in the graph, we denote the entity set asE, the relation setasR,and the triplets asT. For inductive knowledge graph completion, we test the model on the new graph, where the relation vocabulary is shared with the training graph, while the entities are novel.