Cut-off Value According to the globally comparable trust scores, we can (i) rank all of the documents, and trade off the performance metrics by choosing an appropriate cut-off value γ for various applications, or (ii) rank the documents of an individual entity separately and obtain its top-k mentions.
considering that the propagation begins with document d i and that we are required to find all of its out-neighbors o(d i ) through a traversal of the entire dataset, then the complexity is O(n 2 ).