And we believe that the disambiguation performance can be greatly improved by designing algorithms which can exploit these knowledge sources at best.
the recursive form of the structural semantic relatedness S ij between the node i and the node j can be written as: where λ and μ control the relative importance of the two components and N i ={j | A ij > 0} is the set of the immediate neighbors of node i; is the degree of node i.