A Survey of Eigenvector Methods for Web Information Retrieval
The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Abstract
Web information retrieval is significantly more challenging than traditional well-controlled, small document collection information retrieval. One main difference between traditional information retrieval and Web information retrieval is the Web's hyperlink structure. This structure has been exploited by several of today's leading Web search engines, particularly Google and Teoma. In this survey paper, we focus on Web information retrieval methods that use eigenvector computations, presenting the three popular methods of HITS, PageRank, and SALSA.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Self-citationMatrix analysis and applied linear algebra
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5065 · Cited by 3,300
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×
“References [2, 16, 12, 25, 50] contain information about the graph structure of the Web and some suggestions for exploiting this structure.”
BackgroundLinked: The New Science of Networks
Barabási, A.-L., & Aldana-Gonzalez, M. (2003) · Physics Today · doi:10.1063/1.1570778 · Cited by 2,724
Introduction to the Numerical Solution of Markov Chains
Stewart, W. J. (1995) · Princeton University Press eBooks · doi:10.1515/9780691223384 · Cited by 1,750
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
Self-citationMatrices, Vector Spaces, and Information Retrieval
Berry, M. W., Drmac, Z., & Jessup, E. R. (1999) · SIAM Review · doi:10.1137/s0036144598347035 · Cited by 692
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
Improving the retrieval of information from external sources
Dumais, S. T. (1991) · Behavior Research Methods, Instruments, & Computers · doi:10.3758/bf03203370 · Cited by 579
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539 · cited 2×
“Several other ways of forcing irreducibility have been suggested and analyzed [40, 9, 59], but Google seems to favor the E = ev approach.”
BackgroundThe stochastic approach for link-structure analysis (SALSA) and the TKC effect
Lempel, R., & Moran, S. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00034-7 · Cited by 481
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
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
Richardson, M., & Domingos, P. (2001) · Cited by 356
(2003) · Cited by 312
The Second Eigenvalue of the Google Matrix
Haveliwala, T. H., & Kamvar, S. D. (2003) · Cited by 310
(1999) · Cited by 293
Stable algorithms for link analysis
Ng, A. Y., Zheng, A. X., & Jordan, M. I. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.384003 · Cited by 286
Adaptive methods for the computation of PageRank
Kamvar, S., Haveliwala, T., & Golub, G. (2004) · Linear Algebra and its Applications · doi:10.1016/j.laa.2003.12.008 · Cited by 271
Learning to Probabilistically Identify Authoritative Documents
Cohn, D. A., & Chang, H. (2000) · International Conference on Machine Learning · Cited by 269
Finding authorities and hubs from link structures on the World Wide Web
Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372096 · Cited by 230
Link Analysis, Eigenvectors and Stability
Ng, A. Y., Zheng, A. X., & Jordan, M. I. (2001) · Cited by 206
PageRank Computation and the Structure of the Web: Experiments and Algorithms
Arasu, A., Novak, J., Tomkins, A., & Tomlin, J. A. (2002) · Cited by 202
The quest for correct information on the Web: hyper search engines
Marchiori, M. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00036-6 · Cited by 191
Mining longitudinal web queries: Trends and patterns
Wang, P., Berry, M. W., & Yang, Y. (2003) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.10262 · Cited by 174
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
PageRank, HITS and a unified framework for link analysis
Ding, C., He, X., Husbands, P., Zha, H., & Simon, H. D. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564440 · Cited by 159
What is this page known for? Computing Web page reputations
Rafiei, D., & Mendelzon, A. O. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00078-5 · Cited by 126
Farahat, A., LoFaro, T., Miller, J. C., Rae, G., & Ward, L. A. (2006) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502412875 · Cited by 117
Link Analysis: Hubs and Authorities on the World Wide Web
Ding, C. H. Q., Hongyuan Zha, B., He, X., Husbands, P., & Simon, H. D. (2004) · SIAM Review · doi:10.1137/s0036144501389218 · Cited by 113
SearchPad: explicit capture of search context to support Web search
Bharat, K. A. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00047-5 · Cited by 107
A Reordering for the PageRank Problem
Langville, A. N., & Meyer, C. D. (2006) · SIAM Journal on Scientific Computing · doi:10.1137/040607551 · Cited by 100
Self-citationA new paradigm for ranking pages on the world wide web
Tomlin, J. A. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775202 · Cited by 73
Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
Dayar, T., & Stewart, W. J. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598338159 · Cited by 70
An efficient algorithm to rank Web resources
Zhang, D., & Dong, Y. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00056-6 · Cited by 58
Tsoi, A. C., Morini, G., Scarselli, F., Hagenbuchner, M., & Maggini, M. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775203 · Cited by 51
Numerical Experiments with Iteration and Aggregation for Markov Chains
Stewart, W. J., & Wu, W. B. (1992) · INFORMS journal on computing · doi:10.1287/ijoc.4.3.336 · Cited by 43
Application of threshold partitioning of sparse matrices to Markov chains
Choi, H., & Szyld, D. B. (2002) · doi:10.1109/ipds.1996.540217 · Cited by 33
Updating the stationary vector of an irreducible Markov chain
Langville, A. N., & Meyer, C. D. (2002) · NCSU Libraries Repository (North Carolina State University Libraries) · Cited by 8
Self-citation
Cited by
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
Self-citationScale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 474
Graph theory and networks in Biology
Mason, O., & Verwoerd, M. (2007) · IET Systems Biology · doi:10.1049/iet-syb:20060038 · Cited by 398
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
Metadata
- Authors
- Langville, A. N., & Meyer, C. D.
- Venue
- SIAM Review
- Published
- 2005-01
- Volume
- 47
- Issue
- 1
- Pages
- 135-161
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2145541974
- Cited by
- 430
- References
- 44
- FWCI
- 90.91
- Type
- journal article
- 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.