Page rank: Functional dependencies

ACM Transactions on Information Systems

Volumn 27, Issue 4, 2009, Pages

  Boldi, Paolo ^a   Santini, Massimo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Damping factor; PageRank; Power method

Indexed keywords

ADJACENCY MATRICES; DAMPING FACTORS; FUNCTIONAL DEPENDENCY; PAGE RANKS; PAGERANK; POWER METHOD; RANKING TECHNIQUE; STATIONARY DISTRIBUTION; STOCHASTIC PROCESS; TRADE SECRETS; WEB GRAPHS;

DAMPING; INFORMATION RETRIEVAL; INTERCONNECTION NETWORKS; RANDOM PROCESSES; RESEARCH LABORATORIES; WORLD WIDE WEB;

SEARCH ENGINES;

EID: 75149152869     PISSN: 10468188     EISSN: 15582868     Source Type: Journal    
DOI: 10.1145/1629096.1629097     Document Type: Conference Paper

References (30)

1. AVRACHENKOV, K., LITVAK, N., AND PHAM, K. S. 2007. Distribution of PageRank mass among principle components of the Web. In Proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph (WAW'07), A. Bonato and F. R. K. Chung, Eds. Lecture Notes in Computer Science, vol.4863. Springer, 16-28.
2. BAEZA-YATES, R., BOLDI, P., AND CASTILLO, C. 2006. Generalizing PageRank: Damping functions for link-based ranking algorithms. In (SIGIR '06) Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM Press, New York, 308-315
3. BAO, Y. ANDLIU,Y. 2006. LimitofPageRank with damping factor.Dynam. Contin. Discr. Impulsive Syst. 13, 497-504.
4. BOLDI, P., CODENOTTI, B., SANTINI, M., AND VIGNA, S. 2004. Ubicrawler: A scalable fully distributed Web crawler. Softw. Pract. Exper. 34, 8, 711-726.
5. BOLDI, P., LONATI, V., SANTINI, M., AND VIGNA, S. 2006. Graph fibrations, graph isomorphism, and PageRank. RAIRO Inf. Théor. 40, 227-253.
6. BOLDI, P., POSENATO, R., SANTINI, M., AND VIGNA, S. 2008. Traps and pitfalls of topic-biased Page Rank. In Proceedings of the 4th Workshop on Algorithms and Models for the Web-Graph (WAW '06), W. Aiello, A. Broder, J. Janssen, and E. Milios, Eds. Lecture Notes in Computer Science, vol.4936. Springer, 107-116.
7. BOLDI, P., SANTINI, M., AND VIGNA, S. 2005. PageRank as a function of the damping factor. In Proceedings of the 14th International World Wide Web Conference. ACM Press, 557-566.
8. BOLDI, P. AND VIGNA, S. 2004. The WebGraph framework I: Compression techniques. In Proceedings of the 13th International World Wide Web Conference. ACM Press, 595-601.
9. BREZINSKI, C. AND REDIVO-ZAGLIA, M. 2006. The PageRank vector: Properties, computation, approximation, and acceleration. SIAM J. Matrix Anal. Appl. 28, 2, 551-575.
10. BRINKMEIER, M. 2006. PageRank revisited. ACM Trans. Internet Technol. 6, 3, 282-301.
11. DEL CORSO, G., GULL̀I, A., AND ROMANI, F. 2006. Fast PageRank computation via a sparse linear system. Internet Math. 2, 3, 251-273.
12. EIRON, N., MCCURLEY, K. S., AND TOMLIN, J. A. 2004. Ranking the Web frontier. In Proceedings of the 13th International World Wide Web Conference. ACM Press, 309-318.
13. FOGARAS, D. 2005. Personal communication
14. GOLUB, G. H. ANDGREIF,C. 2006. AnArnoldi-type algorithm for computing PageRank.BIT Numer. Math. 46, 4, 759-771.
15. HAVELIWALA, T. AND KAMVAR, S. 2003a. The condition number of the PageRank problem. Tech. rep. 36, Stanford University.
16. HAVELIWALA, T. H. 1999. Efficient computation of PageRank. Tech. rep. 31, Stanford University.
17. HAVELIWALA, T. H. AND KAMVAR, S. D. 2003b. The second eigenvalue of the Google matrix. Tech. rep. 20, Stanford University.
18. IOSIFESCU, M. 1980. Finite Markov Processes and Their Applications. John Wiley & Sons.
19. JEH, G. AND WIDOM, J. 2003. Scaling personalized Web search. In Proceedings of the 12th International World Wide Web Conference. ACM Press, 271-279.
20. KAMVAR, S. D., HAVELIWALA, T. H., MANNING, C. D., AND GOLUB, G. H. 2003. Extrapolation methods for accelerating PageRank computations. In Proceedings of the 12th International World Wide Web Conference. ACM Press, 261-270.
21. KATZ, L. 1953. Anew status index derived from sociometric analysis.Psychometrika 18, 1, 39-43.
22. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., SIVAKUMAR, D., TOMPKINS, A., AND UPFAL, E. 2000. The Web as a graph. In Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '00). ACM Press, 1-10.
23. LANGVILLE, A. N. AND MEYER, C. D. 2004. Deeper inside PageRank. Internet Math. 1, 3, 355-400.
24. PAGE, L., BRIN, S., MOTWANI, R., AND WINOGRAD, T. 1999. The PageRank citation ranking: Bringing order to the Web. Tech. rep. 66, Stanford University.
25. PINSKI, G. AND NARIN, F. 1976. Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics. Inf. Proces. Manag. 12, 5, 297-312.
26. PRETTO, L. 2002a. A theoretical analysis of Google's PageRank. In Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE '02), A. H. F. Laender and A. L. Oliveira, Eds. Lecture Notes in Computer Science, vol.2476. Springer, 125-136.
27. PRETTO, L. 2002b. A theoretical approach to link analysis algorithms. Ph.D. thesis.
28. SERRA-CAPIZZANO, S. 2005. Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation. SIAM J. Matrix Anal. Appl. 27, 2, 305-312.
29. VIGNA, S. 2005. TruRank: Taking PageRank to the limit. In Proceedings of the 14th International World Wide Web Conference (WWW 2005), Special Interest Tracks & Posters. ACM Press, 976-977.
30. VIGNA, S. 2007. Stanford matrix considered harmful. In Web Information Retrieval and Linear Algebra Algorithms, A. Frommer, M. W. Mahoney, and D. B. Szyld, Eds. Number 07071 in Dagstuhl Seminar Proceedings. Internationales Begegnungs-und Forschungszentrum für Infor-matik (IBFI), Schloss Dagstuhl, Germany.