Surfing the Network for Ranking by Multidamping

IEEE Transactions on Knowledge and Data Engineering

Volumn 26, Issue 9, 2014, Pages 2323-2336

  Kollias, Giorgos ^a   Gallopoulos, Efstratios ^b   Grama, Ananth ^a  

^a Purdue University   (United States)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

and Visualization; Computing Methodologies; Database Applications; Database Management; Discrete Mathematics; Graph algorithms; Graph Theory; Information Technology and Systems; Markov processes; Mathematics of Computing; Mining methods and algorithms; Modeling; Monte Carlo; Personalization; Probability and Statistics; Ranking; Simulation; Types of Simulation; Web mining

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DAMPING; DATA MINING; DATABASE SYSTEMS; GRAPH THEORY; INFORMATION MANAGEMENT; MANAGEMENT INFORMATION SYSTEMS; MARKOV PROCESSES; MINING; MODELS; MONTE CARLO METHODS; STOCHASTIC SYSTEMS; TREES (MATHEMATICS);

COMPUTING METHODOLOGIES; DATABASE APPLICATIONS; DATABASE MANAGEMENT; DISCRETE MATHEMATICS; GRAPH ALGORITHMS; INFORMATION TECHNOLOGY AND SYSTEMS; MATHEMATICS OF COMPUTING; MINING METHODS AND ALGORITHMS; PERSONALIZATIONS; PROBABILITY AND STATISTICS; RANKING; SIMULATION; TYPES OF SIMULATION; WEB MINING;

MATRIX ALGEBRA;

EID: 84938940726     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2013.15     Document Type: Article

References (51)

1. L. Katz, "A new status index derived from sociometric analysis," Psychometrika, vol. 18, no. 1, pp. 39-43, 1953.
2. N. Friedkin, "Theoretical foundations for centrality measures," Amer. J. Sociol., vol. 96, no. 6, pp. 1478-1504, 1991.
3. S. Vigna. (2009). Spectral ranking. CoRR, vol. abs/0912.0238 [Online]. Available: http://arxiv.org/abs/0912.0238
4. R. Horn and S. Serra-Capizzano, "A general setting for the parametric Google matrix," Internet Math., vol. 3, no. 4, pp. 385-411, 2006.
5. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Comput. Netw. ISDN Syst., vol. 33, no. 1-7, pp. 107-117, 1998.
6. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank citation ranking: Bringing order to the web," Stanford Univ., Stanford, CA, USA, Tech. Rep. 1999-66, 1999.
7. S. Kamvar, Numerical Algorithms for Personalized Search in Large-Scale Self-Organizing Information Networks. Princeton, NJ, USA: Princeton University Press, 2010.
8. A. Langville and C. Meyer, Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton, NJ, USA: Princeton University Press, 2006.
9. R. Baeza-Yates, P. Boldi, and C. Castillo, "Generalizing PageRank: Damping functions for link-based ranking algorithms," in Proc. ACM SIGIR, 2006, pp. 308-315 [Online]. Available: citeseer.ist.psu.edu/baeza-yates06generalizing.html
10. R. Baeza-Yates, P. Boldi, and C. Castillo, "Generic damping functions for propagating importance in link-based ranking," Internet Math., vol. 3, no. 4, pp. 445-478, 2006.
11. N. Spirin and J. Han, "Survey on web spam detection: Principles and algorithms," ACM SIGKDD Explor. Newslett., vol. 13, no. 2, pp. 50-64, 2012.
12. L. Eldén, "A note on the eigenvalues of the Google matrix," Dep. Math., Linköping Univ., Linköping, Sweden, Tech. Rep. 0401177v1 [math.RA], 2004.
13. T. Haveliwala and S. Kamvar, "The second eigenvalue of the Google matrix," Stanford Univ., Stanford, CA, USA, Tech. Rep. 2003-20, Mar. 2003.
14. I. Ipsen and R. Wills, "Mathematical properties and analysis of Google's PageRank," Bol. Soc. Esp. Mat. Apl., vol. 34, pp. 191-196, Mar. 2006.
15. C. Brezinski and M. Redivo-Zaglia, "Rational extrapolation for the PageRank vector," Math. Comput., vol. 77, no. 263, pp. 1585-1598, 2008.
16. S. Serra-Capizzano, "Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation," SIAM J. Matrix Anal. Appl., vol. 27, no. 2, pp. 305-312, 2005.
17. K. Avrachenkov, N. Litvak, and K. Pham, "Distribution of PageRank mass among principle components of the web," in Proc. 5th WAW, Berlin, Germany, 2007.
18. P. Boldi, M. Santini, and S. Vigna, "PageRank as a function of the damping factor," in Proc. Int. Conf. WWW, Chiba, Japan, 2005, pp. 557-566.
19. P. Boldi, M. Santini, and S. Vigna, "PageRank: Functional dependencies," ACM Trans. Inf. Syst., vol. 27, pp. 19:1-19:23, Nov. 2009 [Online]. Available: http://doi.acm.org/10.1145/1629096.1629097
20. D. Gleich, P. Constantine, A. Flaxman, and A. Gunawardana, "Tracking the random surfer: Empirically measured teleportation parameters in PageRank," in Proc. 19th Int. Conf. WWW, Raleigh, NC, USA, 2010, pp. 381-390.
21. L. Festinger, "The analysis of sociograms using matrix algebra," Hum. Relat., vol. 2, no. 2, pp. 153-158, 1949.
22. M. Brinkmeier, "PageRank revisited," ACM TOIT, vol. 6, no. 3, pp. 282-301, 2006.
23. D. Fogaras, "Where to start browsing the web?" in Innovative Internet Community Systems, Berlin, Germany: Springer, 2003, LNCS 2877 [Online]. Available: http://www.springerlink.com/content/v3q5d15tp6mbdvd7
24. J. Miller et al., "Modifications of Kleinberg's HITS algorithm using matrix exponentiation and web log records," in Proc. 24th SIGIR, New Orleans, LA, USA, 2001, pp. 444-445.
25. M. Newman, S. Strogatz, and D. Watts, "Random graphs with arbitrary degree distributions and their applications," Phys. Rev. E, vol. 64, no. 2, pp. 1-17, 2001.
26. P. Boldi, "Total rank: Ranking without damping," in Proc. 14th Int. Conf. WWW, Chiba, Japan, 2005, pp. 898-899.
27. P. Boldi, M. Santini, and S. Vigna, "A deeper investigation of PageRank as a function of the damping factor," in Proc. Dagstuhl Seminar Web Information Retrieval Linear Algebra Algorithms, 2007.
28. D. Isaacson and R. Madsen, Markov Chains. Theory and Applications. New York, NY, USA: Wiley, 1976.
29. E. Seneta, Non-Negative Matrices and Markov Chains. New York, NY, USA: Springer-Verlag, 2006.
30. G. Kollias and E. Gallopoulos, "Multidamping simulation framework for link-based ranking," in Web Information Retrieval and Linear Algebra Algorithms, A. Frommer, M. Mahoney, and D. Szyld, Eds. Wadern, Germany: IBFI, Schloss Dagstuhl, 2007.
31. A. Brauer, "Limits for the characteristic roots of a matrix. IV: Applications to stochastic matrices," Duke Math. J., vol. 19, no. 1,pp. 75-91, 1952.
32. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, "Monte Carlo methods in PageRank computation: When one iteration is sufficient," SIAM J. Numer. Anal., vol. 45, no. 2, pp. 890-904, 2007.
33. K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol, "Quick detection of top-k personalized PageRank lists," in Proc. 8th Int. Conf. Algorithms Models Web Graph, Atlanta, GA, USA, 2011, pp. 50-61.
34. D. Nemirovski, "Monte Carlo methods and Markov chain based approaches for PageRank computation," Ph.D. dissertation, Univ. Nice, Sophia Antipolis, France, 2010.
35. M. Bianchini, M. Gori, and F. Scarselli, "Inside PageRank," ACM Trans. Internet Technol., vol. 5, pp. 92-128, Feb. 2005 [Online]. Available: http://doi.acm.org/10.1145/1052934.1052938
36. L. Breyer. (2002). Markovian Page Ranking Distributions: Some Theory and Simulations [Online]. Available: www.lbreyer.com/preprints.html
37. D. Fogaras and B. Rácz, "Towards scaling fully personalized PageRank," in Proc. Algorithms Models Web-Graph, Rome, Italy, 2004, pp. 105-117.
38. H. Ishii and R. Tempo, "Distributed randomized algorithms for the PageRank computation," IEEE Trans. Autom. Control, vol. 55, no. 9, pp. 1987-2002, Sept. 2010.
39. P. Boldi and S. Vigna, "The webgraph framework I: Compression techniques," in Proc. 13th Int. Conf. WWW, New York, NY, USA, 2004, pp. 595-601.
40. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "The web as a graph: Measurements, models, and methods," in Proc. 5th COCOON, vol. 1627. Tokyo, Japan, 1999, pp. 1-17.
41. A. Broder et al., "Graph structure in the web," Comput. Netw., vol. 33, no. 1, pp. 309-320, 2000.
42. M. Kendall, "A new measure of rank correlation," Biometrika, vol. 30, no. 1/2, pp. 81-93, 1938.
43. T. H. Haveliwala, "Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search," IEEE Trans. Knowl. Data Eng., vol. 15, no. 4, pp. 784-796, Jul./Aug. 2003.
44. G. Jeh and J. Widom, "Scaling personalized web search," in Proc. 12th Int. Conf. WWW, New York, NY, USA, May 2003.
45. J. Cho and U. Schonfeld, "RankMass crawler: A crawler with high personalized PageRank coverage guarantee," in Proc. 33rd Int. Conf. VLDB, 2007, pp. 375-386 [Online]. Available: http://dl.acm.org/citation.cfm?id=1325851.1325897
46. L. Becchetti, C. Castillo, D. Donato, S. Leonardi, and R. Baeza-Yates, "Using rank propagation and probabilistic counting for link-based spam detection," in Proc. WebKDD, 2006.
47. D. Sheldon, "Manipulation of PageRank and Collective Hidden Markov Models," Ph.D. dissertation, Cornell Univ., Ithaca, NY, USA, 2010.
48. D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós, "Towards scaling fully personalized PageRank: Algorithms, lower bounds, and experiments," Internet Math., vol. 2, no. 3, pp. 333-358, 2005.
49. B. Bahmani, A. Chowdhury, and A. Goel, "Fast incremental and personalized PageRank," Proc. VLDB, vol. 4, no. 3, pp. 173-184, Dec. 2010 [Online]. Available: http://dl.acm.org/citation.cfm?id=1929861.1929864
50. G. Wu and Y. Wei, "Arnoldi versus GMRES for computing PageRank: A theoretical contribution to Google's PageRank problem," ACM Trans. Inf. Syst., vol. 28, pp. 11:1-11:28, Jul. 2010 [Online]. Available: http://doi.acm.org/10.1145/1777432.1777434
51. D. Bernstein and C. Van Loan, "Rational matrix functions and rank-1 updates," SIAM J. Matrix Anal. Appl., vol. 22, no. 1, pp. 145-154, 2000.