Finally, the total score for the node e is score(e) = coh(e) + P P R avg • iSim(e) where total coherence coh(e) of node e to the graph is computed with respect to aggregation constraints, and initial similarity score iSim(e) is weighted by an average value of P P R weights used in coherence computation.
this approach often ranks higher a popular candidate connected to many nodes in a graph over the correct but less popular one.