{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:46Z","timestamp":1775638486326,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306116, 62272170"],"award-info":[{"award-number":["62306116, 62272170"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"?Digital Silk Road? Shanghai International Joint Lab of Trust- worthy Intelligent Software","award":["22510750100"],"award-info":[{"award-number":["22510750100"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671819","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:54:55Z","timestamp":1724561695000},"page":"3896-3906","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Matrix Multiplication over Sliding Windows"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5651-1831","authenticated-orcid":false,"given":"Ziqi","family":"Yao","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7150-9513","authenticated-orcid":false,"given":"Lianzhi","family":"Li","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3922-0989","authenticated-orcid":false,"given":"Mingsong","family":"Chen","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9566-7814","authenticated-orcid":false,"given":"Xian","family":"Wei","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9094-0869","authenticated-orcid":false,"given":"Cheng","family":"Chen","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"International Conference on Machine Learning. PMLR, 102--110","author":"Agarwal Naman","year":"2019","unstructured":"Naman Agarwal, Brian Bullins, Xinyi Chen, Elad Hazan, Karan Singh, Cyril Zhang, and Yi Zhang. 2019. Efficient full-matrix adaptive regularization. In International Conference on Machine Learning. PMLR, 102--110."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055598"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543615"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.820069"},{"key":"e_1_3_2_2_5_1","volume-title":"International Conference on Machine Learning. PMLR, 992--1004","author":"Blalock Davis","year":"2021","unstructured":"Davis Blalock and John Guttag. 2021. Multiplying matrices without multiplying. In International Conference on Machine Learning. PMLR, 992--1004."},{"key":"e_1_3_2_2_6_1","volume-title":"Sliding window algorithms for k-clustering problems. Advances in Neural Information Processing Systems 33","author":"Borassi Michele","year":"2020","unstructured":"Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, and Morteza Zadimoghaddam. 2020. Sliding window algorithms for k-clustering problems. Advances in Neural Information Processing Systems 33 (2020)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00055"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"e_1_3_2_2_9_1","volume-title":"Optimal approximate matrix product in terms of stable rank. arXiv preprint arXiv:1507.02268","author":"Cohen Michael B","year":"2015","unstructured":"Michael B Cohen, Jelani Nelson, and David P Woodruff. 2015. Optimal approximate matrix product in terms of stable rank. arXiv preprint arXiv:1507.02268 (2015)."},{"key":"e_1_3_2_2_10_1","series-title":"SIAM journal on computing 31, 6","volume-title":"Maintaining stream statistics over sliding windows","author":"Datar Mayur","year":"2002","unstructured":"Mayur Datar, Aristides Gionis, Piotr Indyk, and Rajeev Motwani. 2002. Maintaining stream statistics over sliding windows. SIAM journal on computing 31, 6 (2002), 1794--1813."},{"key":"e_1_3_2_2_11_1","volume-title":"Data Stream Management: Processing High-Speed Data Streams","author":"Datar Mayur","unstructured":"Mayur Datar and Rajeev Motwani. 2016. The sliding-window computation model and results. In Data Stream Management: Processing High-Speed Data Streams. Springer, 149--165."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"e_1_3_2_2_14_1","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi John","year":"2011","unstructured":"John Duchi, Elad Hazan, and Yoram Singer. 2011. Adaptive subgradient methods for online learning and stochastic optimization. The Journal of Machine Learning Research 12, 7 (2011).","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009718"},{"key":"e_1_3_2_2_16_1","volume-title":"Relations between two sets of variates. Biometrika","author":"Hotelling Harold","year":"1936","unstructured":"Harold Hotelling. 1936. Relations between two sets of variates. Biometrika (1936)."},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of machine translation summit x: papers. 79--86","author":"Koehn Philipp","year":"2005","unstructured":"Philipp Koehn. 2005. Europarl: A parallel corpus for statistical machine translation. In Proceedings of machine translation summit x: papers. 79--86."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244002.1244108"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17065"},{"key":"e_1_3_2_2_21_1","article-title":"Robust frequent directions with application in online learning","volume":"20","author":"Luo Luo","year":"2019","unstructured":"Luo Luo, Cheng Chen, Zhihua Zhang, Wu-Jun Li, and Tong Zhang. 2019. Robust frequent directions with application in online learning. The Journal of Machine Learning Research 20, 1 (2019).","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.109"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"e_1_3_2_2_24_1","unstructured":"Youssef Mroueh Etienne Marcheret and Vaibahava Goel. 2017. Co-occurring directions sketching for approximate matrix multiply. In Artificial Intelligence and Statistics. PMLR 567--575."},{"key":"e_1_3_2_2_25_1","volume-title":"Randomized block krylov methods for stronger and faster approximate singular value decomposition. Advances in Neural Information Processing Systems 28","author":"Musco Cameron","year":"2015","unstructured":"Cameron Musco and Christopher Musco. 2015. Randomized block krylov methods for stronger and faster approximate singular value decomposition. Advances in Neural Information Processing Systems 28 (2015)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.128"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0380-7"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10579-009-9114-z"},{"key":"e_1_3_2_2_29_1","unstructured":"Martin Potthast Benno Stein Alberto Barr\u00f3n-Cede\u00f1o and Paolo Rosso. 2010. An evaluation framework for plagiarism detection. In Coling 2010: Posters. 997--1005."},{"key":"e_1_3_2_2_30_1","volume-title":"Proceedings of the 48th annual meeting of the association for computational linguistics. 1118--1127","author":"Prettenhofer Peter","year":"2010","unstructured":"Peter Prettenhofer and Benno Stein. 2010. Cross-language text classification using structural correspondence learning. In Proceedings of the 48th annual meeting of the association for computational linguistics. 1118--1127."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17207"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3096880"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915228"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"David P Woodruff et al. 2014. Sketching as a tool for numerical linear algebra. Foundations and Trends\u00ae in Theoretical Computer Science 10 1--2 (2014) 1--157.","DOI":"10.1561\/0400000060"},{"key":"e_1_3_2_2_36_1","first-page":"2","article-title":"Frequent direction algorithms for approximate matrix multiplication with applications in CCA","volume":"1","author":"Ye Qiaomin","year":"2016","unstructured":"Qiaomin Ye, Luo Luo, and Zhihua Zhang. 2016. Frequent direction algorithms for approximate matrix multiplication with applications in CCA. Computational Complexity 1, m3 (2016), 2.","journal-title":"Computational Complexity"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.133"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:14Z","timestamp":1750291454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":37,"alternative-id":["10.1145\/3637528.3671819","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671819","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}