Ranking the web frontier
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Using PageRank to Characterize Web Structure
Pandurangan, G., Raghavan, P., & Upfal, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45655-4_36 · Cited by 164
I/O-efficient techniques for computing pagerank
Chen, Y.-Y., Gan, Q., & Suel, T. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584882 · Cited by 59
Cited by
Gleich, D. F. (2015) · SIAM Review · doi:10.1137/140976649 · Cited by 646
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 474
Can social bookmarking improve web search?
Heymann, P., Koutrika, G., & Garcia-Molina, H. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341558 · Cited by 434
Know your neighbors: web spam detection using the web topology
Castillo, C., Donato, D., Gionis, A., Murdock, V., & Silvestri, F. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277814 · Cited by 310
Survey on web spam detection: principles and algorithms
Spirin, N., & Han, J. (2012) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2207243.2207252 · Cited by 252
Distributed PageRank computation based on iterative aggregation-disaggregation methods
Zhu, Y., Ye, S., & Li, X. (2005) · Proceedings of the 14th ACM international conference on Information and knowledge management · doi:10.1145/1099554.1099705 · Cited by 65
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
Litvak, N., Scheinhardt, W. R. W., & Volkovich, Y. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129293 · Cited by 62
Determining Factors Behind the PageRank Log-Log Plot
Volkovich, Y., Litvak, N., & Donato, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_9 · Cited by 31
“It is however a common belief that dangling nodes are important [17] whereas out-degrees (almost) do not affect the PageRank [18].”
BackgroundInfluentialDistribution of PageRank Mass Among Principle Components of the Web
Avrachenkov, K., Litvak, N., & Pham, K. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_2 · Cited by 29
“Since dangling nodes typically constitute more than 25% of the graph [19], and p1 is usually close to one, the condition 1 − β < p1 seems to be comfortably satisfied in Web samples.”
BackgroundWhat's really new on the web?: identifying new pages from a series of unstable web snapshots
Toyoda, M., & Kitsuregawa, M. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135815 · Cited by 21
Metadata
- Authors
- Eiron, N., McCurley, K. S., & Tomlin, J. A.
- Venue
- Proceedings of the 13th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2004-05-17
- Pages
- 309-318
- OpenAlex
- W2169263924
- Cited by
- 209
- References
- 3
- FWCI
- 20.65
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.