FUNDAMENTALS OF COMPUTER

Previous
Next

DATABASE FUNDAMENTALS

BASICS OF BIG DATA

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
is the PageRank score of vertex ‘B’ after the second iteration? (Without damping factor)Hint:-The basic PageRank formula is:Where, PRt+1(u)PRt+1(u):page rank of node uu under consideration, PRt(v)PRt(v):previous page rank of node ‘vv’ pointing to node ‘uu’, C(v)C(v):outgoing degree of vertex ‘vv’
A
1/6/
B
1.5/12
C
2.5/12
D
1/3/
Explanation: 

Detailed explanation-1: -So to calculate the PageRank of given page A, we first take 1 minus the damping factor (d). D is typically set as . 85, as seen in their original paper. We then take the PageRanks of all pages that point to and from page A, add them up, and multiply by the damping factor of 0.85.

Detailed explanation-2: -Damping factor. The PageRank theory holds that an imaginary surfer who is randomly clicking on links will eventually stop clicking. The probability, at any step, that the person will continue following links is a damping factor d. The probability that they instead jump to any random page is 1-d.

Detailed explanation-3: -PageRank is an algorithm designed by Google to help assess the authority of a Web page and website overall (1). One of several quality metrics Google uses to determine the authority of a website, PageRank assigns a score between 0 and 10 to a website to determine its relative value to users.

Detailed explanation-4: -With DAMPING-FACTOR = 1, there is no damping of the effect of link structure, meaning that pages with no inbound hyperlinks will receive 0 for PageRanks.

There is 1 question to complete.
Previous
Next