Page Rank Flashcards
(12 cards)
What is pagerank:
Algorithm that ranks pages according to the number of links directing to the page.
Pages with more links pointing to it have higher authority.
Hyperlink model inbounds
Suppose P(a) P(b) P(me)
My page rank = P(me) + BP(b) + YP(a)
B and Y weighted factor
P(me) inherits the page link portion of the pages directed to me )
Hyperlink model
Suppose P(a) P(b) P(me)
My page rank =
Outbounds
If a page has n outbound links the weight is split evenly by those N links
B = ½ if P(a) has 2 outbounds
Sinkpage problem
When a page has links referencing it but does not reference any other links
Sink page solution
The sinking page is weighted against the whole internet 1/N ( rank distributed over the internet)
Cycle problem
Pages may be linked to a closed cycle causing and infinite increase of authority score.
Cycle problem solution
Random surfer problem :
We have a damping factor d ( probability the surfer wills start a random session)
Pn + 1 = dH + (1 - d)
We iterate until the current probability of Pn is sufficiently close to the previous Pn
Pn = G^nP°
Complexity
O(MN²)
Example make the transition matrix of
C–>Bpage –> refences –> A page
A will have a transition matrix of [1(b) 0(c)]
If transition matrix is all Zeros than that page is a sink page
So the zeros for that pages matrix are transformed to
1/N ( ex 1/3 )
Calculate Google matrix with dampening factor 4/5
G = 4/5 * A + ( 1-4/5) *B