Exploiting the Block Structure of the Web for Computing PageRank

@inproceedings{citeulike:2650491, abstract = {The web link graph has a nested block structure: the vast majority of hyperlinks link pages on a host to other pages on the same host, and many of those that do not link pages within the same domain. We show how to exploit this structure to speed up the computation of PageRank by a 3-stage algorithm whereby (1) the local PageRanks of pages for each host are computed independently using the link structure of that host, (2) these local PageRanks are then weighted by the "importance" of...}, author = {Kamvar, Sepandar and Haveliwala, Taher and Manning, Christopher and Golub, Gene }, citeulike-article-id = {2650491}, keywords = {ranking}, posted-at = {2008-04-10 20:58:25}, priority = {2}, title = {Exploiting the Block Structure of the Web for Computing PageRank}, url = {http://citeseer.ist.psu.edu/567308.html}, year = {2003} }

TY - CONF ID - citeulike:2650491 L3 - citeulike-article-id:2650491 TI - Exploiting the Block Structure of the Web for Computing PageRank N2 - The web link graph has a nested block structure: the vast majority of hyperlinks link pages on a host to other pages on the same host, and many of those that do not link pages within the same domain. We show how to exploit this structure to speed up the computation of PageRank by a 3-stage algorithm whereby (1) the local PageRanks of pages for each host are computed independently using the link structure of that host, (2) these local PageRanks are then weighted by the "importance" of... KW - ranking AU - Kamvar, Sepandar AU - Haveliwala, Taher AU - Manning, Christopher AU - Golub, Gene PY - 2003/// UR - http://citeseer.ist.psu.edu/567308.html ER -