Ranking the Web Frontier
Source:
WWW2004, ACM Press, New York, NY, p.309 - 318 (2004)
URL:
http://mccurley.org/papers/1p309.pdf
Keywords:
Ranking, PageRank, Hypertext
Abstract:
The celebrated PageRank algorithm has proved to be a very effective
paradigm for ranking results of web search algorithms. In this
paper we refine this basic paradigm to take into account several
evolving prominent features of the web, and propose several algorithmic
innovations. First, we analyze features of the rapidly growing
“frontier” of the web, namely the part of the web that crawlers
are unable to cover for one reason or another. We analyze the effect
of these pages and find it to be significant. We suggest ways to
improve the quality of ranking by modeling the growing presence
of “link rot” on the web as more sites and pages fall out of maintenance.
Finally we suggest new methods of ranking that are motivated
by the hierarchical structure of the web, are more efficient
than PageRank, and may be more resistant to direct manipulation.
Download:
ACM COPYRIGHT NOTICE. Copyright © 2008 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or
permissions@acm.org.
