Given a correct triplet (h, r, t), we aim at pushing all the possible corrupt triplets with wrong relations {r |r ∈ R & r = r} away.
we adopt a margin-based ranking loss function with a block α to separate all the negative triplets in the corrupted base K from all the positives in the correct knowledge base K: in which [ ] + is a hinge loss function, i.e.