A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs
Table 4: Classification accuracy on selected queries.
['Label', 'Relation Path', 'ComplEx', 'BlockHolE']
The accuracies of BlockHolE and RESCAL on the path QA classification task were markedly better than those of DistMult and ComplEx. We analyzed the results further. We extracted all queries from G(F∗) of FB13 that consist of an interpretable relation path * /parents/ religion/* where ∗ denotes “can match any relation path”. For such queries (s,∗/parents/religion/∗,o), we also generated meaningless queries (s,∗/religion/parents/∗,o) as negatives. The results clearly show that ComplEx cannot correctly answer the negative queries at all due to the lack of the non-commutative property.