They first proposed a search enginebased method to evaluate the relatedness between every pair of triples, and then an iterative propagation algorithm was introduced to select the most relevant triples to a given source document (see Section 2), which achieved a good performance.
in the original representation, there are no edges between two bk-nodes because they treat the bk-nodes as recipients of relevance weight only.