Distributed large-scale natural graph factorization

WWW 2013 - Proceedings of the 22nd International Conference on World Wide Web

Volumn , Issue , 2013, Pages 37-47

  Ahmed, Amr ^a   Shervashidze, Nino ^b   Narayanamurthy, Shravan ^c   Josifovski, Vanja ^a   Smola, Alexander J ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CNRS   (United States)

^c MICROSOFT   (United States)

Author keywords

Asynchronous algorithms; Distributed optimization; Graph algorithms; Graph factorization; Graph partitioning; Large scale machine learning; Matrix factorization

Indexed keywords

ELECTRONIC MAIL; FACTORIZATION; GRAPHIC METHODS; MACHINE LEARNING; WORLD WIDE WEB;

ASYNCHRONOUS ALGORITHMS; DISTRIBUTED OPTIMIZATION; GRAPH ALGORITHMS; GRAPH PARTITIONING; LARGE-SCALE MACHINE LEARNING; MATRIX FACTORIZATIONS;

GRAPH THEORY;

EID: 84893071858     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488388.2488393     Document Type: Conference Paper

References (26)

1. A. Ahmed, M. Aly, J. Gonzalez, S. Narayanamurthy, and A. Smola. Scalable inference in latent variable models. In WSDM, 2012.
2. A. Ahmed, Y Low, M. Aly, V. Josifovski, and A. Smola. Scalable Distributed Inference of Dynamic User Interests for Behavioral Targeting. In KDD, 2011.
3. D. Aldous. Representations for partially exchangeable arrays of random variables. Journal of Multivariate Analysis, 11(4):581-598, 1981.
4. R. Andersen, D. Gleich, and V. Mirrokni. Overlapping clusters for distributed computation. In WSDM, 2012.
5. K. Andreev and H. Räcke. Balanced graph partitioning. In Parallelism in algorithms and architectures, pages 120-124, 2004.
6. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, MA, 1995.
7. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, MA, second edition, 1999.
8. D. Blei, A. Ng, and M. Jordan. Latent Dirichlet allocation. JMLR, 3:993-1022, 2003.
9. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1-123, 2010.
10. M. Charikar. Similarity estimation techniques from rounding algorithms. In ACM Tymposium on Theory of Computing, pages 380-388, 2002.
11. R. Gemulla, E. Nijkamp, P. J. Haas, and Y. Sismanis. Large-scale matrix factorization with distributed stochastic gradient descent. In KDD, 69-77, 2011.
12. G. H. Golub and C. F. Van Loan. Matrix Computations. John Hopkins Press, 1996.
13. T. Grifiths and Z. Ghahramani. Infinite latent feature models and the Indian Buffet Process. NIPS 18, 475-482, 2006.
14. J. Gonzalez, Y. Low, H. Gu, D. Bickson and C. Guestrin. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. OSDI, October, 2012.
15. G. Karypis and V. Kumar. MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0, 1995.
16. Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 42(8):30-37, 2009.
17. C. Liu, H.-C. Yang, J. Fan, L.-W. He, and Y.-M. Wang. Distributed nonnegative matrix factorization for web-scale dyadic data analysis on mapreduce. In WWW, 681-690, 2010.
18. 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, 2010.
19. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In ACM ICDM, 135-146. 2010.
20. D. Newman, A. Asuncion, P. Smyth, and M. Welling. Distributed algorithms for topic models. Journal of Machine Learning Research, 10:1801-1828, 2009.
21. C. Olston, E. Bortnikov, K. Elmeleegy, F. Junqueira, and B. Reed. Interactive analysis of web-scale data. In CIDR, 2009.
22. B. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In NIPS, pages 693-701, 2011.
23. A. J. Smola and S. Narayanamurthy. An architecture for parallel topic models. In VLDB, 2010.
24. S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In WWW, 607-614. 2011.
25. K. Yu, S. Zhu, J. Lafferty, and Y. Gong. Fast nonparametric matrix factorization for large-scale collaborative filtering. In SIGIR, pages 211-218, 2009.
26. Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan. Large-scale parallel collaborative filtering for the Netix prize. In Algorithmic Aspects in Information and Management, pages 337-348, 2008.