Frog wild! - Fast PageRank approximations on graph engines

Proceedings of the VLDB Endowment

Volumn 8, Issue 8, 2015, Pages 874-885

  Mitliagkas, Ioannis ^a   Borokhovich, Michael ^a   Dimakis, Alexandros G ^a   Caramanis, Constantine ^a  

^a ECE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COST REDUCTION; ITERATIVE METHODS; RANDOM PROCESSES; SYNCHRONIZATION;

FAST APPROXIMATION; NETWORK COSTS; NETWORK TRAFFIC; NOVEL ALGORITHM; PAGE RANKS; PAGERANK ALGORITHM; PARTIAL SYNCHRONIZATION; POWER; QUANTIZED VERSION; RANDOM WALK;

DIRECTED GRAPHS;

EID: 84965095709     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2757807.2757812     Document Type: Conference Paper

References (33)

1. Teradata. http://www.teradata.com/Resources/ Videos/Grow-Loyalty-of-Influential-Customers. Accessed: 2014-11-30.
2. A. Agarwal and S. Chakrabarti. Learning random walks to rank nodes in graphs. In Proceedings of the 24th international conference on Machine learning, pages 9-16. ACM, 2007.
3. Amazon web services. http://aws.amazon.com, 2014.
4. R. Andersen, C. Borgs, J. Chayes, J. Hopcraft, V. S. Mirrokni, and S.-H. Teng. Local computation of pagerank contributions. In Algorithms and Models for the Web-Graph, pages 150-165. Springer, 2007.
5. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. Monte carlo methods in pagerank computation: When one iteration is sufficient. SIAM J. Numer. Anal., 45(2):890-904, Feb. 2007.
6. K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol. Monte carlo methods for top-k personalized pagerank lists and name disambiguation. CoRR, abs/1008.3775, 2010.
7. J. Batson, D. A. Spielman, N. Srivastava, and S.-H. Teng. Spectral sparsification of graphs: Theory and algorithms. Commun. ACM, 56(8):87-94, Aug. 2013.
8. L. Becchetti and C. Castillo. The distribution of pagerank follows a power-law only for particular values of the damping factor. In Proceedings of the 15th international conference on World Wide Web, pages 941-942. ACM, 2006.
9. A. A. Benczúr and D. R. Karger. Approximating s-t minimum cuts in Õ(n2) time. In Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, STOC '96, pages 47-55, New York, NY, USA, 1996. ACM.
10. P. Berkhin. A survey on pagerank computing. Internet Mathematics, 2(1):73-120, 2005.
11. M. Borokhovich and I. Mitliagkas. FrogWild! code repository. https://github.com/michaelbor/frogwild, 2014. Accessed: 2014-10-30.
12. P. Bremaud. Markov chains: Gibbs fields, Monte Carlo simulation, and queues, volume 31. springer, 1999.
13. A. Z. Broder, R. Lempel, F. Maghoul, and J. Pedersen. Efficient pagerank approximation via graph aggregation. Information Retrieval, 9(2):123-138, 2006.
14. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Distributed random walks. Journal of the ACM (JACM), 60(1):2, 2013.
15. S. Fortunato and A. Flammini. Random walks on directed networks: the case of pagerank. International Journal of Bifurcation and Chaos, 17(07):2343-2353, 2007.
16. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI, volume 12, page 2, 2012.
17. J. Heidemann, M. Klier, and F. Probst. Identifying key users in online social networks: A pagerank based approach. In ICIS'10, 2010.
18. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In WWW '10: Proceedings of the 19th international conference on World wide web, pages 591-600, New York, NY, USA, 2010. ACM.
19. J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.
20. P. Lofgren, S. Banerjee, A. Goel, and C. Seshadhri. Fast-ppr: Scaling personalized pagerank estimation for large graphs. arXiv preprint arXiv:1404.3181, 2014.
21. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new parallel framework for machine learning. In Conference on Uncertainty in Artificial Intelligence (UAI), July 2010.
22. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pages 135-146. ACM, 2010.
23. R. Mihalcea and P. Tarau. Textrank: Bringing order into texts. Association for Computational Linguistics, 2004.
24. I. Mitliagkas, M. Borokhovich, A. G. Dimakis, and C. Caramanis. FrogWild! -Long Technical Version. http://mitliagkas.github.io/papers/FrogWild.pdf, 2015. Accessed: 2015-03-04.
25. M. E. Newman. Power laws, pareto distributions and zipf's law. Contemporary physics, 46(5):323-351, 2005.
26. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. 1999.
27. D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC '87, pages 77-85, New York, NY, USA, 1987. ACM.
28. B. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In Advances in Neural Information Processing Systems, pages 693-701, 2011.
29. A. D. Sarma, S. Gollapudi, and R. Panigrahy. Estimating pagerank on graph streams. Journal of the ACM (JACM), 58(3):13, 2011.
30. N. Satish, N. Sundaram, M. A. Patwary, J. Seo, J. Park, M. A. Hassaan, S. Sengupta, Z. Yin, and P. Dubey. Navigating the maze of graph analytics frameworks using massive graph datasets.
31. D. Spielman and N. Srivastava. Graph sparsication by effective resistances. SIAM Journal on Computing, 40(6):1913-1926, 2011.
32. VirtualBox 4.3. www.virtualbox.org, 2014.
33. R. S. Xin, J. E. Gonzalez, M. J. Franklin, and I. Stoica. Graphx: A resilient distributed graph system on spark. In First International Workshop on Graph Data Management Experiences and Systems, page 2. ACM, 2013.