Pages

Wednesday, August 23, 2017

How does the Google PageRank algorithm deal with cyclic links?

How does the Google PageRank algorithm deal with cyclic links?


A simplified version of page rank can be
PR(u) = ∑ Pr(v)/N(v)
where u represents the webpageB (u) is the set of pages that point to u, PR (u) and PR (v) are rank scores of page u and v respectively, N(v) indicates the number of outgoing links of page v, c is a factor applied for normalization. In Page Rank, The values assigned to the outgoing links of page p are in turn used to calculate the ranks of the pages to which page p is pointing.

Your question somewhat nears to the problem called as rank sink. The problem of rank sink is present in general PageRank algorithm which led the user to less relevant pages while searching queries & will bring him back to the original page because the rank will sink and increase by forming the loop. The improved PageRank algorithm is achieved by removing the rank sink problem in which the different web pages forms a loop and distribute rank unnecessarily to the web pages by the help of which more accurate importance of the web pages is retrieved.

No comments:

Post a Comment