Specifically, for each positive entity pair, we use bi-directional breadth-first search to explore the shortest path between two entities.
since the shorter paths incline to characterize more direct correlations between two entities, we prefer to use them for initialization to ensure the quality of demonstration candidates.