Scribd
Upload
121 views2 pages

Pageranking Numerical

Uploaded by

Flash X
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
121 views2 pages

Pageranking Numerical

Uploaded by

Flash X
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SNA – OE IV

Module 2

Page Ranking Algorithm

 PageRank (PR) is an algorithm used by Google Search to rank websites in their search
engine results. PageRank was named after Larry Page, one of the founders of Google.
PageRank is a way of measuring the importance of website pages.
 According to Google: PageRank works by counting the number and quality of links to a
page to determine a rough estimate of how important the website is. The underlying
assumption is that more important websites are likely to receive more links from other
websites.
 It is not the only algorithm used by Google to order search engine results, but it is the
first algorithm that was used by the company, and it is the best-known.
 The PageRank computations require several passes, called “iterations”, through the
collection to adjust approximate PageRank values to more closely reflect the theoretical
true value.

 Assume a small universe of four web pages: A, B, C, and D.


 The probability distribution of values is between 0 and 1
 In the 0th iteration, PageRank is initialized to the same value for all pages.
 Hence in 0th Iteration, we use the formula 1/total no. pages, so that we get an equal distribution
as follows:

Pages Iteration 0
A 0.25
B 0.25
C 0.25
D 0.25
 Calculation for 1+ i iterations are as follows:
Page Rank distribution value of a page A = sum of all pages that are pointing to page A
(last iteration of that page/no. of outgoing links of that particular page)
Let’s continue with iteration 1st Iteration of above example

For Page A:
Pages pointing to A = C
PR distribution value of A = last iteration value of C/no. of outgoing links of C
= 0.25/3 = 0.0833333

Similarly for Page B:


Pages pointing to B = A and C
PR distribution value of B = (last iteration value of A/ no.of outgoing links of A) + (last
iteration value of C/ no.of outgoing links of C)
= 0.25/2+0.25/3 = 0.2083333
Thus we can find for all pages until iteration 2.

Pages Iteration 0 Iteration 1 Iteration 2


A 0.25 0.0833333 0.125
B 0.25 0.2083333 0.1666667
C 0.25 0.375 0.375
D 0.25 0.3333333 0.3333333

 Based on Iteration 2 values, PR can be found.


 Higher the value of PR distribution value, higher the PR value can be assigned as
follows:

Pages Iteration 0 Iteration 1 Iteration 2 Page Rank


A 0.25 0.0833333 0.125 1
B 0.25 0.2083333 0.1666667 2
C 0.25 0.375 0.375 4
D 0.25 0.3333333 0.3333333 3

 Thus we can see, Page C is the most “voted” or followed page found by calculations.

You might also like