The probability cannot be too high to avoid generating negative samples that are actually correct, since there are generally a lot of facts missing in KBs.
let M H r = {h | ∃t(h, r, t) ∈ P } and M T r = {t | ∃h(h, r, t) ∈ P } denote the head or tail domain of relation r. Suppose N r = {(h, r, t) ∈ P } is the induced set of edges with relation r. We define the probability p r as Our motivation of such a formulation is as follows: Suppose O r is the set that contains all truthful fact triples on relation r, i.e., all triples in training set and all other missing correct triples.