{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:26:51Z","timestamp":1768591611420,"version":"3.49.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":24,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T00:00:00Z","timestamp":1431907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["IIS-1408924"],"award-info":[{"award-number":["IIS-1408924"]}]},{"name":"National Science Foundation","award":["CNS-1314632"],"award-info":[{"award-number":["CNS-1314632"]}]},{"name":"National Science Foundation","award":["DGE-1252522"],"award-info":[{"award-number":["DGE-1252522"]}]},{"name":"Google Inc."},{"name":"Facebook Inc.","award":["Facebook Fellowship"],"award-info":[{"award-number":["Facebook Fellowship"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,18]]},"DOI":"10.1145\/2736277.2741091","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:37:12Z","timestamp":1454704632000},"page":"119-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["ACCAMS"],"prefix":"10.1145","author":[{"given":"Alex","family":"Beutel","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Amr","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Google Strategic Technologies, Mountain View, CA, USA"}]},{"given":"Alexander J.","family":"Smola","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442798"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014111"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568040"},{"key":"e_1_3_2_1_4_1","first-page":"567","volume-title":"ICML (3)","author":"Gittens A.","year":"2013","unstructured":"A. Gittens and M. W. Mahoney . Revisiting the nystrom method for improved large-scale machine learning . In ICML (3) , pages 567 -- 575 , 2013 . A. Gittens and M. W. Mahoney. Revisiting the nystrom method for improved large-scale machine learning. In ICML (3), pages 567--575, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143890"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021039"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_3_2_1_8_1","volume-title":"Direct clustering of a data matrix. Journal of the american statistical association, 67(337):123--129","author":"Hartigan J. A.","year":"1972","unstructured":"J. A. Hartigan . Direct clustering of a data matrix. Journal of the american statistical association, 67(337):123--129 , 1972 . J. A. Hartigan. Direct clustering of a data matrix. Journal of the american statistical association, 67(337):123--129, 1972."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_11_1","first-page":"91","volume-title":"VOG: Summarizing and Understanding Large Graphs","author":"Koutra D.","year":"2014","unstructured":"D. Koutra , U. Kang , J. Vreeken , and C. Faloutsos . VOG: Summarizing and Understanding Large Graphs , chapter 11, pages 91 -- 99 . SIAM , 2014 . D. Koutra, U. Kang, J. Vreeken, and C. Faloutsos. VOG: Summarizing and Understanding Large Graphs, chapter 11, pages 91--99. SIAM, 2014."},{"key":"e_1_3_2_1_12_1","volume-title":"OSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . GraphChi: Large-scale graph computation on just a pc . In OSDI , Hollywood, CA , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-scale graph computation on just a pc. In OSDI, Hollywood, CA, 2012."},{"key":"e_1_3_2_1_13_1","first-page":"82","volume-title":"Proceedings of The 30th International Conference on Machine Learning","author":"Lee J.","year":"2013","unstructured":"J. Lee , S. Kim , G. Lebanon , and Y. Singer . Local low-rank matrix approximation . In Proceedings of The 30th International Conference on Machine Learning , pages 82 -- 90 , 2013 . J. Lee, S. Kim, G. Lebanon, and Y. Singer. Local low-rank matrix approximation. In Proceedings of The 30th International Conference on Machine Learning, pages 82--90, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-009-0137-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.22"},{"key":"e_1_3_2_1_16_1","first-page":"1134","volume-title":"Advances in Neural Information Processing Systems","author":"Mackey L. W.","year":"2011","unstructured":"L. W. Mackey , M. I. Jordan , and A. Talwalkar . Divide-and-conquer matrix factorization . In Advances in Neural Information Processing Systems , pages 1134 -- 1142 , 2011 . L. W. Mackey, M. I. Jordan, and A. Talwalkar. Divide-and-conquer matrix factorization. In Advances in Neural Information Processing Systems, pages 1134--1142, 2011."},{"key":"e_1_3_2_1_17_1","volume-title":"International Conference on Machine Learning","author":"Palla K.","year":"2012","unstructured":"K. Palla , D. Knowles , and Z. Ghahramani . An infinite latent attribute model for network data . In International Conference on Machine Learning , 2012 . K. Palla, D. Knowles, and Z. Ghahramani. An infinite latent attribute model for network data. In International Conference on Machine Learning, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2225052"},{"key":"e_1_3_2_1_19_1","first-page":"1487","volume-title":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence","author":"Porteous I.","year":"2008","unstructured":"I. Porteous , E. Bart , and M. Welling . Multi-HDP: A non parametric bayesian model for tensor factorization. In D. Fox and C. Gomes, editors , Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence , pages 1487 -- 1490 . AAAI Press , 2008 . I. Porteous, E. Bart, and M. Welling. Multi-HDP: A non parametric bayesian model for tensor factorization. In D. Fox and C. Gomes, editors, Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, pages 1487--1490. AAAI Press, 2008."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.91"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1991.139758"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0202-x"},{"key":"e_1_3_2_1_24_1","first-page":"331","volume-title":"SDM","author":"Wang P.","year":"2011","unstructured":"P. Wang , K. B. Laskey , C. Domeniconi , and M. I. Jordan . Nonparametric bayesian co-clustering ensembles . In SDM , pages 331 -- 342 . SIAM , 2011 . P. Wang, K. B. Laskey, C. Domeniconi, and M. I. Jordan. Nonparametric bayesian co-clustering ensembles. In SDM, pages 331--342. SIAM, 2011."}],"event":{"name":"WWW '15: 24th International World Wide Web Conference","location":"Florence Italy","acronym":"WWW '15","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 24th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741091","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736277.2741091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:37Z","timestamp":1750227397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741091"}},"subtitle":["Additive Co-Clustering to Approximate Matrices Succinctly"],"short-title":[],"issued":{"date-parts":[[2015,5,18]]},"references-count":24,"alternative-id":["10.1145\/2736277.2741091","10.5555\/2736277"],"URL":"https:\/\/doi.org\/10.1145\/2736277.2741091","relation":{},"subject":[],"published":{"date-parts":[[2015,5,18]]},"assertion":[{"value":"2015-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}