Choose the damping, choose the ranking?

Journal of Discrete Algorithms

Volumn 8, Issue 2, 2010, Pages 199-213

  Bressan, Marco ^a   Peserico, Enoch ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

CiteSeer; Damping factor; Graph; Link analysis; PageRank; Ranking; Web

Indexed keywords

ANALYTICAL TOOL; CITATION GRAPHS; CITESEER; DAMPING FACTORS; FINITE SET; IN-DEGREE; LINK ANALYSIS; PAGERANK; QUALITY OF RESULTS; RANDOM SURFER MODELS; RANKING ALGORITHM; TIME VARIANT; WEB DOMAINS;

INTERCONNECTION NETWORKS; SET THEORY;

DAMPING;

EID: 77649233703     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2009.11.001     Document Type: Article

References (30)

1. Avrachenkov K., Litvak N., and Son Pham K. A singular perturbation approach for choosing PageRank damping factor. ArXiv Mathematics e-prints. arXiv:math/0612079
2. M. Bacchin, N. Ferro, M. Melucci, The effectiveness of a graph-based algorithm for stemming, in: Proceedings of International Conference on Asian Digital Libraries (ICADL), 2002
3. R. Baeza-Yates, P. Boldi, C. Castillo, Generalizing PageRank: Damping functions for link-based ranking algorithms, in: Proceedings of the ACM Special Interest Group on Information Retrieval (SIGIR) Conference, 2006
4. Berry M.W. Survey of Text Mining (2003), Springer-Verlag
5. P. Boldi, M. Santini, S. Vigna, PageRank as a function of the damping factor, in: Proceedings of the ACM World Wide Web Conference (WWW), 2005
6. P. Boldi, S. Vigna, The WebGraph framework I: Compression techniques, in: Proceedings of the ACM World Wide Web Conference (WWW), 2004
7. S. Chakrabarti, B.E. Dom, D. Gibson, R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, Experiments in topic distillation, in: Proceedings of the ACM Special Interest Group on Information Retrieval (SIGIR) Workshop on Hypertext IR on the Web, 1998
8. Cho J., García-Molina H., and Page L. Efficient crawling through URL ordering. Computer Networks and ISDN Systems 30 1-7 (1998) 161-172
9. CiteSeer metadata, http://citeseer.ist.psu.edu/oai.html
10. Erkan G., and Radev D.R. LexRank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research (JAIR) 22 (2004) 457-479
11. R. Fagin, R. Kumar, D. Sivakumar, Comparing top k lists, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003
12. D. Gleich, P.W. Glynn, G.H. Golub, C. Greif, Three results on the PageRank vector: Eigenstructure, sensitivity, and the derivative, in: Web Information Retrieval and Linear Algebra Algorithms, 2007
13. T.H. Haveliwala, Efficient computation of PageRank, Technical report, 1999
14. Hook D.G., and McAree P.R. Using Sturm Sequences to Bracket Real Roots of Polynomial Equations (1990), Academic Press Professional, Inc., San Diego, CA, USA
15. X.M. Jiang, G.R. Xue, H.J. Zeng, Z. Chen, W.-G. Song, W.-Y. Ma, Exploiting PageRank at different block level, in: Proceedings of the Web Information Systems Engineering (WISE), 2004
16. S.D. Kamvar, T.H. Haveliwala, C.D. Manning, G.H. Golub, Extrapolation methods for accelerating PageRank computations, in: Proceedings of the ACM World Wide Web Conference (WWW), 2003
17. S.D. Kamvar, M.T. Schlosser, H. Garcia-Molina, The EigenTrust algorithm for reputation management in P2P networks, in: Proceedings of the ACM World Wide Web Conference (WWW), 2003
18. Kleinberg J.M. Authoritative sources in a hyperlinked environment. Journal of the ACM 46 5 (1999) 604-632
19. Knuth D.E. Art of Computer Programming, vol. 2: Seminumerical Algorithms. 3rd edition (1997), Addison-Wesley Professional
20. Langville A.N., and Meyer C.D. Deeper inside PageRank. Internet Mathematics 1 3 (2004) 335-380
21. Langville A.N., and Meyer C.D. Google's PageRank and Beyond: The Science of Search Engine Rankings (2006), Princeton University Press
22. M. Melucci, L. Pretto, PageRank: When order changes, in: Proceedings of the European Conference on Information Retrieval (ECIR), 2007
23. L. Page, S. Brin, R. Motwani, T. Winograd, The PageRank citation ranking: Bringing order to the Web, Technical report, Stanford Digital Library Technologies Project, 1998
24. E. Peserico, L. Pretto, What does it mean to converge in rank?, in: Proceedings of the International Conference on the Theory of Information Retrieval (ICTIR), 2007
25. L. Pretto, A theoretical analysis of Google's PageRank, in: Proceedings of the International Symposium on String Processing and Information Retrieval (SPIRE), 2002
26. P. Tarau, R. Mihalcea, E. Figa, Semantic document engineering with WordNet and PageRank, in: Proceedings of the ACM Symposium on Applied Computing (SAC), 2005
27. University Milano, and Laboratory for Web Algorithmics. http://law.dsi.unimi.it/
28. K.W. Wangk, Item selection by 'hub-authority' profit ranking, in: Proceedings of the ACM Special Interest Group on Knowledge Discovery and Data Mining (SIGKDD) Conference, 2002
29. Wilkinson J.H. Rounding Errors in Algebraic Processes (1994), Dover Publications, Inc.
30. Wills R., and Ipsen I. Ordinal ranking for Google's PageRank. SIAM Journal on Matrix Analysis and Applications (SIMAX) 30 4 (2009) 1677-1696