Given a positive entity pair ⟨e head , e tail ⟩, we introduce a relational set R h which contains all relations directly connected to e head .
such evidential paths are obtained by random walks, which inevitably introduces inferior or even noisy paths.