The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Adaptive methods for the computation of PageRank
Open accessOverview
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Self-citation(1999) · Cited by 12,854
Probability and Random Processes
(2004) · Elsevier eBooks · doi:10.1016/b978-0-12-172651-5.x5000-3 · Cited by 2,535
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Self-citationFocused crawling: a new approach to topic-specific Web resource discovery
Chakrabarti, S., van den Berg, M., & Dom, B. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00052-3 · Cited by 1,486
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195
Automatic resource compilation by analyzing hyperlink structure and associated text
Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., & Kleinberg, J. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00087-7 · Cited by 697
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
Bharat, K., & Henzinger, M. R. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130367 · Cited by 676
Extrapolation methods for accelerating PageRank computations
Kamvar, S. D., Haveliwala, T. H., Manning, C. D., & Golub, G. H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775190 · Cited by 407
Self-citation
Research works printed but not linked: 1
- S.D. Kamvar, T.H. Haveliwala, C.D. Manning, G.H. Golub, Extrapolation methods for accelerating PageRank computations, in: Proceedings of the 12th International World Wide Web Conference, 2003 · DOI
Cited by
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
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
Fast incremental and personalized PageRank
Bahmani, B., Chowdhury, A., & Goel, A. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1929861.1929864 · Cited by 327
Graph-based keyword extraction for single-document summarization
Litvak, M., & Last, M. (2008) · Proceedings of the Workshop on Multi-source Multilingual Information Extraction and Summarization - MMIES '08 · doi:10.3115/1613172.1613178 · Cited by 272
The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
Bryan, K., & Leise, T. (2006) · SIAM Review · doi:10.1137/050623280 · Cited by 260
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
Avrachenkov, K., Litvak, N., Nemirovsky, D., & Osipova, N. (2007) · SIAM Journal on Numerical Analysis · doi:10.1137/050643799 · Cited by 250
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
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
Updating pagerank with iterative aggregation
Langville, A. N., & Meyer, C. D. (2004) · Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04 · doi:10.1145/1013367.1013491 · Cited by 64
Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
Ipsen, I. C. F., & Kirkland, S. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479804439808 · Cited by 60
Metadata
- Authors
- Kamvar, S., Haveliwala, T., & Golub, G.
- Venue
- Linear Algebra and its Applications
- Publisher
- Elsevier BV
- Published
- 2004-07
- Volume
- 386
- Pages
- 51-65
- ISSN
- 0024-3795 (ISSN-L)
- OpenAlex
- W2108272874
- Cited by
- 271
- References
- 20
- FWCI
- 21.77
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 3303 d)
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.