{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:42:55Z","timestamp":1763458975115,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1251019","ACI-1443046","CCF-1350888","CNS-1514520"],"award-info":[{"award-number":["IIS-1251019","ACI-1443046","CCF-1350888","CNS-1514520"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939800","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T14:33:46Z","timestamp":1470666826000},"page":"845-854","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Frequent Directions Algorithm for Sparse Matrices"],"prefix":"10.1145","author":[{"given":"Mina","family":"Ghashami","sequence":"first","affiliation":[{"name":"University of Utah, Salt lake city, UT, USA"}]},{"given":"Edo","family":"Liberty","sequence":"additional","affiliation":[{"name":"Yahoo Research, New York City, NY, USA"}]},{"given":"Jeff M.","family":"Phillips","sequence":"additional","affiliation":[{"name":"University of Utah, Salt lake city, UT, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Nick Asendorf Madison McGaffin Matt Prelee and Ben Schwartz. Algorithms for completing a user ratings matrix."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.21"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496875"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591819"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645315.649157"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"e_1_3_2_1_7_1","volume-title":"Improved practical matrix sketching with guarantees. arXiv preprint arXiv:1501.06561","author":"Desai Amey","year":"2015","unstructured":"Amey Desai, Mina Ghashami, and Jeff M Phillips. Improved practical matrix sketching with guarantees. arXiv preprint arXiv:1501.06561, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"e_1_3_2_1_9_1","volume-title":"Concept decompositions for large sparse text data using clustering. Machine learning, 42(1--2):143--175","author":"Dhillon Inderjit S","year":"2001","unstructured":"Inderjit S Dhillon and Dharmendra S Modha. Concept decompositions for large sparse text data using clustering. Machine learning, 42(1--2):143--175, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644147"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442702"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509922"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"e_1_3_2_1_17_1","volume-title":"Frequent directions: Simple and deterministic matrix sketching. arXiv preprint arXiv:1501.01711","author":"Ghashami Mina","year":"2015","unstructured":"Mina Ghashami, Edo Liberty, Jeff M Phillips, and David P Woodruff. Frequent directions: Simple and deterministic matrix sketching. arXiv preprint arXiv:1501.01711, 2015."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634127"},{"key":"e_1_3_2_1_19_1","volume-title":"Matrix computations","author":"Golub Gene H","year":"2012","unstructured":"Gene H Golub and Charles F Van Loan. Matrix computations, volume 3. JHUP, 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.12.29"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/83.855432"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709640104"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1400123.1400129"},{"key":"e_1_3_2_1_29_1","volume-title":"Stronger approximate singular value decomposition via the block lanczos and power methods. arXiv preprint arXiv:1504.05477","author":"Musco Cameron","year":"2015","unstructured":"Cameron Musco and Christopher Musco. Stronger approximate singular value decomposition via the block lanczos and power methods. arXiv preprint arXiv:1504.05477, 2015."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.21"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275505"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1899353.1899359"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0075-7"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_3_2_1_36_1","volume-title":"The random projection method","author":"Vempala Santosh S","year":"2004","unstructured":"Santosh S Vempala. The random projection method, volume 65. American Mathematical Soc., 2004."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9891-7"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2007.12.002"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"San Francisco California USA","acronym":"KDD '16"},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939800","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:38:11Z","timestamp":1763458691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":38,"alternative-id":["10.1145\/2939672.2939800","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939800","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}