Inside PageRank

ACM Transactions on Internet Technology

Volumn 5, Issue 1, 2005, Pages 92-128

  Bianchini, Monica ^a   Gori, Marco ^a   Scarselli, Franco ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

Information retrieval; Markov chains; PageRank; Search engines; Searching the Web; Web page scoring

Indexed keywords

PAGERANK; PROBLEM COMPLEXITY; SEARCHING THE WEB; WEB PAGE SCORING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; INFORMATION RETRIEVAL; MARKOV PROCESSES; SEARCH ENGINES;

WEBSITES;

EID: 16244392071     PISSN: 15335399     EISSN: None     Source Type: Journal    
DOI: 10.1145/1052934.1052938     Document Type: Article

References (28)

1. BHAHAT, K. AND HENZINGER, M. R. 1998. Improved algorithms for topic distillation in hyperlinked environments. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York, 104-111.
2. BIANCHINI, M., FANELLI, S., AND GORI, M. 2001. Optimal algorithms for well-conditioned nonlinear systems of equations. IEEE Trans. Comput. 50, 7, 689-698.
3. BJÖKCK, A. 1996. Numerical Methods for Least Squares Problems. Society for Industrial and Applied Mathematics.
4. BOMZE, I. AND GUTJAHR, W. 1994. The dinamics of self-evaluation. Appl. Math. Comput. 64, 47-63.
5. BOMZE, I. AND GUTJAHR, W. 1995. Estimating qualifications in a self-evaluating group. Qual. Quant. 29, 241-250.
6. BORODIN, A., ROBERTS, G. O., ROSENTHAL, J. S., AND TSAPARAS, P. 2001. Finding authorities and hubs from link structures on the world wide web. In Proceedings of the 10th International World Wide Web Conference.
7. BRIN, S., MOTWANI, R., PAGE, L., AND WINOGRAD, T. 1998. What can you do with a web in your pocket? IEEE Bulle. Techn. Comm. Data Eng., IEEE Comput. Soc. 21, 2, 37-47.
8. BRIN, S. AND PAGE, L. 1998. The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the 7th World Wide Web Conference (WWW7).
9. BRIN, S., PAGE, L., MOTWANI, R., AND WINOGRAD, T. 1999. The PageRank citation ranking: Bringing order to the Web. Tech. Rep. 1999-66, Stanford University. Available on the Internet at http://dbpubs.stanford.edu:8090/pub/ 1999-66.
10. COHN, D. AND CHANG, H. 2000. Learning to probabilistically identify authoritative documents. In Proceedings of 17th International Conference on Machine Learning. Morgan Kaufmann, San Francisco, Calif., 167-174.
11. COHN, D. AND HOFMANN, T. 2001. The missing link - A probabilistic model of document content and hypertext connectivity. In Neural Inf. Proc. Syst. 13.
12. DILIGENTI, M., GORI, M., AND MAGGINI, M. 2002. Web page scoring systems for horizontal and vertical search. In Proceedings of the 11th World Wide Web Conference (WWW11).
13. GOLUB, G. H. AND VAN LOAN, C. F. 1993. Matrix computation. The Johns Hopkins University Press.
14. HAVELIWALA, T. H. 1999. Efficient computation of pagerank. Tech. Rep. 1999-66, Stanford University. Available on the Internet at http://dbpubs. stanford.edu:8090/pub/1999-66.
15. HAVELIWALA, T. H. 2002. Topic sensitive pagerank. In Proceedings of the 11th World Wide Web Conference (WWW11). Available on the Internet at http://dbpubs.stanford.edu:8090/pub/2002-6.
16. HENZINGER, M. 2001. Hyperlink analysis for the Web. IEEE Internet Computing 5, 1, 45-50.
17. KLEINBERG, J. 1999. Authoritative sources in a hyperlinked environment. J. ACM 46, 5, 604-632.
18. LEMPEL, R. AND MORAN, S. 2000. The stochatic approach for link-structure analysis (SALSA) and the TKC effect. In Proceedings of the 9th World Wide Web Conference (WWW9). Elsevier Science, 387-401.
19. MARCHIORI, M. 1997. The quest for correct information on the Web: Hyper search engines. Computer Networks and ISDN Systems 29, 1225-1235.
20. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized algorithms. Cambridge University Press.
21. NG, A. Y., ZHENG, A. X., AND JORDAN, M. I. 2001a. Link analysis, eigenvectors and stability. In Proceedings of International Conference on Research and Development in Information Retrieval (SIGIR 2001). ACM, New York.
22. NG, A. Y., ZHENG, A. X., AND JORDAN, M. I. 2001b. Stable algorithms for link analysis. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI'2001).
23. PRINGLE, G., ALLISON, L., AND DOWE, D. L. 1998. What is tall poppy among the Web pages? Comput. Netwo. ISDN Syst. 30, 369-377.
24. RICHARDSON, M. AND DOMINGOS, P. 2002. The intellingent surfer: probabilistic combination of link and content information in pagerank. In Advances in Neural Information Processing Systems, 14. MIT Press, Cambridge, Mass.
25. RUMELHART, D., HINTON, G., AND WILLIAMS, R. 1986. Learning representations by back-propagating errors. Nature 323, 533-536.
26. SENETA, E. 1981. Non-negative matrices and Markov chains. Springer-Verlag, New York, Chap. 4, pp. 112-158.
27. VARGA, R. S. 1962. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, N.J.
28. ZHANG, D. AND DONG, Y. 2000. An efficient algorithm to rank web resources. In Proceedings of the 9th International World Wide Web Conference (WWW9). Elsevier Science, Amsterdam, The Netherlands.