{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T14:12:42Z","timestamp":1780668762315,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T00:00:00Z","timestamp":1368403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,5,13]]},"DOI":"10.1145\/2488388.2488393","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:43:24Z","timestamp":1454705004000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":439,"title":["Distributed large-scale natural graph factorization"],"prefix":"10.1145","author":[{"given":"Amr","family":"Ahmed","sequence":"first","affiliation":[{"name":"Google Inc., Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nino","family":"Shervashidze","sequence":"additional","affiliation":[{"name":"INRIA, ENS, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shravan","family":"Narayanamurthy","sequence":"additional","affiliation":[{"name":"Microsoft, Banglore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vanja","family":"Josifovski","sequence":"additional","affiliation":[{"name":"Google Inc., Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander J.","family":"Smola","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124312"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020433"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(81)90099-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124330"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_3_2_1_6_1","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","year":"1995","unstructured":"D. P. Bertsekas . Nonlinear Programming . Athena Scientific , Belmont, MA , 1995 . D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, MA, 1995."},{"key":"e_1_3_2_1_7_1","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","year":"1999","unstructured":"D. P. Bertsekas . Nonlinear Programming . Athena Scientific , Belmont, MA , second edition, 1999 . D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, MA, second edition, 1999."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"e_1_3_2_1_12_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. Van Loan . Matrix Computations . John Hopkins Press , 1996 . G. H. Golub and C. F. Van Loan. Matrix Computations. John Hopkins Press, 1996."},{"key":"e_1_3_2_1_13_1","first-page":"475","article-title":"Infinite latent feature models and the Indian Buffet Process","volume":"18","author":"Griffiths T.","year":"2006","unstructured":"T. Griffiths and Z. Ghahramani . Infinite latent feature models and the Indian Buffet Process . NIPS 18 , 475 -- 482 , 2006 . T. Griffiths and Z. Ghahramani. Infinite latent feature models and the Indian Buffet Process. NIPS 18, 475--482, 2006.","journal-title":"NIPS"},{"key":"e_1_3_2_1_14_1","volume-title":"OSDI","author":"Gonzalez J.","year":"2012","unstructured":"J. Gonzalez , Y. Low , H. Gu , D. Bickson and C. Guestrin . PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs . OSDI , October , 2012 . J. Gonzalez, Y. Low, H. Gu, D. Bickson and C. Guestrin. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. OSDI , October, 2012."},{"key":"e_1_3_2_1_15_1","volume-title":"Version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System , Version 2.0 , 1995 . G. Karypis and V. Kumar. MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0, 1995."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772760"},{"key":"e_1_3_2_1_18_1","volume-title":"Conference on Uncertainty in Artificial Intelligence","author":"Low Y.","year":"2010","unstructured":"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 . 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."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755845"},{"key":"e_1_3_2_1_21_1","volume-title":"CIDR","author":"Olston C.","year":"2009","unstructured":"C. Olston , E. Bortnikov , K. Elmeleegy , F. Junqueira , and B. Reed . Interactive analysis of web-scale data . In CIDR , 2009 . C. Olston, E. Bortnikov, K. Elmeleegy, F. Junqueira, and B. Reed. Interactive analysis of web-scale data. In CIDR, 2009."},{"key":"e_1_3_2_1_22_1","first-page":"693","volume-title":"NIPS","author":"Recht B.","year":"2011","unstructured":"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 . 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."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920931"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571979"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"}],"event":{"name":"WWW '13: 22nd International World Wide Web Conference","location":"Rio de Janeiro Brazil","acronym":"WWW '13","sponsor":["NICBR Nucleo de Informatcao e Coordenacao do Ponto BR","CGIBR Comite Gestor da Internet no Brazil","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 22nd international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488388.2488393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:41Z","timestamp":1750236521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,13]]},"references-count":26,"alternative-id":["10.1145\/2488388.2488393","10.1145\/2488388"],"URL":"https:\/\/doi.org\/10.1145\/2488388.2488393","relation":{},"subject":[],"published":{"date-parts":[[2013,5,13]]},"assertion":[{"value":"2013-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}