A new paradigm for ranking pages on the world wide web
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
This paper describes a new paradigm for modeling traffic levels on the world wide web (WWW) using a method of entropy maximization. This traffic is subject to the conservation conditions of a circulation flow in the entire WWW, an aggregation of the WWW, or a subgraph of the WWW (such as an intranet or extranet). We specifically apply the primal and dual solutions of this model to the (static) ranking of web sites. The first of these uses an imputed measure of total traffic through a web page, the second provides an analogy of local "temperature", allowing us to quantify the "HOTness" of a page.
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×
“The analysis by Broder et al. [ 4 ] , discussing the so-called “bowtie” structure is a particularly good example.”
Method
Cited by
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
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
A Survey of Eigenvector Methods for Web Information Retrieval
Langville, A. N., & Meyer, C. D. (2005) · SIAM Review · doi:10.1137/s0036144503424786 · Cited by 430
The Sinkhorn–Knopp Algorithm: Convergence and Applications
Knight, P. A. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060659624 · Cited by 372
Link analysis ranking: algorithms, theory, and experiments
Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052942 · Cited by 308
Impact of search engines on page popularity
Cho, J., & Roy, S. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988676 · Cited by 281
Eiron, N., McCurley, K. S., & Tomlin, J. A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988714 · Cited by 209
“At this point it is convenient to observe [32] that solving the system (2) is equivalent to defining an additional, “virtual” node n + 1 , and defining an augmented system: (cid:18) (cid:19) (cid:18) (cid:19) (cid:18) (cid:19) It is easy to verify that the solutions of this system are in one-to-one…”
BackgroundSelf-citationEntropy in Urban and Regional Modelling: Retrospect and Prospect. 城市和区域建模中的熵:回顾与展望
Wilson, A. (2010) · Geographical Analysis · doi:10.1111/j.1538-4632.2010.00799.x · Cited by 147
Efficient PageRank approximation via graph aggregation
Broder, A. Z., Lempel, R., Maghoul, F., & Pedersen, J. (2006) · Information Retrieval · doi:10.1007/s10791-006-7146-1 · Cited by 72
Page quality: in search of an unbiased web ranking
Cho, J., Roy, S., & Adams, R. E. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066220 · Cited by 69
Metadata
- Authors
- Tomlin, J. A.
- Venue
- Proceedings of the twelfth international conference on World Wide Web - WWW '03
- Publisher
- ACM Press
- Published
- 2003
- Pages
- 350
- OpenAlex
- W1964579932
- Cited by
- 73
- References
- 1
- Type
- conference abstract
- 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.