{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:28:55Z","timestamp":1742988535170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_44","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"528-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symmetric Norm Estimation and\u00a0Regression on Sliding Windows"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Braverman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viska","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"issue":"1","key":"44_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"44_CR2","unstructured":"Andoni, A., Lin, C., Sheng, Y., Zhong, P., Zhong, R.: Subspace embedding and linear regression with Orlicz norm. In: Proceedings of the 35th International Conference on Machine Learning, ICML, pp. 224\u2013233 (2018)"},{"key":"44_CR3","unstructured":"Argyriou, A., Foygel, R., Srebro, N.: Sparse prediction with the $$k$$-support norm. In: Advances in Neural Information Processing Systems 25: Annual Conference on Neural Information Processing Systems, pp. 1466\u20131474 (2012)"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 1\u201316 (2002)","DOI":"10.1145\/543613.543615"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Blasiok, J., Braverman, V., Chestnut, S.R., Krauthgamer, R., Yang, L.F.: Streaming symmetric norms via measure concentration. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC, pp. 716\u2013729 (2017)","DOI":"10.1145\/3055399.3055424"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Borassi, M., Epasto, A., Lattanzi, S., Vassilvitskii, S., Zadimoghaddam, M.: Better sliding window algorithms to maximize subadditive and diversity objectives. In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS, pp. 254\u2013268 (2019)","DOI":"10.1145\/3294052.3319701"},{"key":"44_CR7","unstructured":"Borassi, M., Epasto, A., Lattanzi, S., Vassilvitskii, S., Zadimoghaddam, M.: Sliding window algorithms for k-clustering problems. In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems, NeurIPS (2020)"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Braverman, V., et al.: Near optimal linear algebra in the online and sliding window models. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 517\u2013528 (2020)","DOI":"10.1109\/FOCS46700.2020.00055"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2014.06.008","volume":"554","author":"V Braverman","year":"2014","unstructured":"Braverman, V., Gelles, R., Ostrovsky, R.: How to catch $$\\text{ L}_2$$-heavy-hitters on sliding windows. Theor. Comput. Sci. 554, 82\u201394 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"44_CR10","unstructured":"Braverman, V., Grigorescu, E., Lang, H., Woodruff, D.P., Zhou, S.: Nearly optimal distinct elements and heavy hitters on sliding windows. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM, pp. 7:1\u20137:22 (2018)"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Braverman, V., Lang, H., Levin, K., Monemizadeh, M.: Clustering on sliding windows in polylogarithmic space. In: 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS, pp. 350\u2013364 (2015)","DOI":"10.1137\/1.9781611974331.ch95"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Braverman, V., Lang, H., Levin, K., Monemizadeh, M.: Clustering problems on sliding windows. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1374\u20131390 (2016)","DOI":"10.1137\/1.9781611974331.ch95"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Braverman, V., Ostrovsky, R.: Smooth histograms for sliding windows. In: Proceedings of 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 283\u2013293 (2007)","DOI":"10.1109\/FOCS.2007.55"},{"key":"44_CR14","unstructured":"Braverman, V., Ostrovsky, R., Roytman, A.: Zero-one laws for sliding windows and universal sketches. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM, pp. 573\u2013590 (2015)"},{"issue":"1","key":"44_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.jcss.2011.04.004","volume":"78","author":"V Braverman","year":"2012","unstructured":"Braverman, V., Ostrovsky, R., Zaniolo, C.: Optimal sampling from sliding windows. J. Comput. Syst. Sci. 78(1), 260\u2013272 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"44_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/15427951.2006.10129117","volume":"3","author":"A Chakrabarti","year":"2006","unstructured":"Chakrabarti, A., Ba, K.D., Muthukrishnan, S.: Estimating entropy and entropy norm on data streams. Internet Math. 3(1), 63\u201378 (2006)","journal-title":"Internet Math."},{"key":"44_CR17","unstructured":"Chen, J., Nguyen, H.L., Zhang, Q.: Submodular maximization over sliding windows. CoRR, abs\/1611.00129 (2016)"},{"issue":"1","key":"44_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2481528.2481530","volume":"42","author":"G Cormode","year":"2013","unstructured":"Cormode, G.: The continuous distributed monitoring model. SIGMOD Rec. 42(1), 5\u201314 (2013)","journal-title":"SIGMOD Rec."},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M.N.: Streaming in a connected world: querying and tracking distributed data streams. In: EDBT 2008, Proceedings of 11th International Conference on Extending Database Technology, p. 745 (2008)","DOI":"10.1145\/1353343.1353442"},{"issue":"6","key":"44_CR20","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1109\/TNET.2005.860096","volume":"13","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s new: finding significant differences in network data streams. IEEE\/ACM Trans. Netw. 13(6), 1219\u20131232 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"44_CR21","doi-asserted-by":"publisher","unstructured":"Datar, M., Motwani, R.: The sliding-window computation model and results. In: Garofalakis, M., Gehrke, J., Rastogi, R. (eds.) Data Stream Management. DSA, pp. 149\u2013165. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-540-28608-0_7","DOI":"10.1007\/978-3-540-28608-0_7"},{"key":"44_CR22","doi-asserted-by":"crossref","unstructured":"Epasto, A., Lattanzi, S., Vassilvitskii, S., Zadimoghaddam, M.: Submodular optimization over sliding windows. In: Proceedings of the 26th International Conference on World Wide Web, WWW, pp. 421\u2013430 (2017)","DOI":"10.1145\/3038912.3052699"},{"issue":"1","key":"44_CR23","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/S0097539799361701","volume":"32","author":"J Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: An approximate l1-difference algorithm for massive data streams. SIAM J. Comput. 32(1), 131\u2013151 (2002)","journal-title":"SIAM J. Comput."},{"key":"44_CR24","doi-asserted-by":"crossref","unstructured":"Feldman, D., Monemizadeh, M., Sohler, C., Woodruff, D.P.: Coresets and sketches for high dimensional subspace approximation problems. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 630\u2013649 (2010)","DOI":"10.1137\/1.9781611973075.53"},{"key":"44_CR25","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.P.: Optimal approximations of the frequency moments of data streams. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 202\u2013208 (2005)","DOI":"10.1145\/1060590.1060621"},{"key":"44_CR26","doi-asserted-by":"crossref","unstructured":"Jayaram, R., Woodruff, D.P., Zhou, S.: Truly perfect samplers for data streams and sliding windows. CoRR, abs\/2108.12017 (2021)","DOI":"10.1145\/3517804.3524139"},{"key":"44_CR27","unstructured":"Krauthgamer, R., Reitblat, D.: Almost-smooth histograms and sliding-window graph algorithms. CoRR, abs\/1904.07957 (2019)"},{"key":"44_CR28","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, B., Sen, S., Zhang, Y., Chen, Y.: Sketch-based change detection: methods, evaluation, and applications. In: Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, IMC, pp. 234\u2013247 (2003)","DOI":"10.1145\/948205.948236"},{"issue":"12","key":"44_CR29","first-page":"1699","volume":"5","author":"GS Manku","year":"2012","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. PVLDB 5(12), 1699 (2012)","journal-title":"PVLDB"},{"key":"44_CR30","unstructured":"McDonald, A.M., Pontil, M., Stamos, D.: Spectral k-support norm regularization. In: Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems, pp. 3644\u20133652 (2014)"},{"key":"44_CR31","doi-asserted-by":"crossref","unstructured":"Osborne, M., et al.: Real-time detection, tracking and monitoring of automatically discovered events in social media. In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (2014)","DOI":"10.3115\/v1\/P14-5007"},{"issue":"3","key":"44_CR32","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s00778-015-0380-7","volume":"24","author":"O Papapetrou","year":"2015","unstructured":"Papapetrou, O., Garofalakis, M., Deligiannakis, A.: Sketching distributed sliding-window data streams. VLDB J. 24(3), 345\u2013368 (2015). https:\/\/doi.org\/10.1007\/s00778-015-0380-7","journal-title":"VLDB J."},{"key":"44_CR33","unstructured":"Song, Z., Wang, R., Yang, L.F., Zhang, H., Zhong, P.: Efficient symmetric norm regression via linear sketching. In: Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems, pp. 828\u2013838 (2019)"},{"key":"44_CR34","unstructured":"Thorup, M., Zhang, Y.: Tabulation based 4-universal hashing with applications to second moment estimation. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 615\u2013624 (2004)"},{"key":"44_CR35","doi-asserted-by":"crossref","unstructured":"Wei, Z., Liu, X., Li, F., Shang, S., Du, X., Wen, J.-R.: Matrix sketching over sliding windows. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference, pp. 1465\u20131480 (2016)","DOI":"10.1145\/2882903.2915228"},{"key":"44_CR36","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P., Zhang, Q.: Distributed statistical estimation of matrix products with applications. In: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 383\u2013394 (2018)","DOI":"10.1145\/3196959.3196964"},{"key":"44_CR37","unstructured":"Woodruff, D.P., Zhou, S.: Tight bounds for adversarially robust streams and sliding windows via difference estimators. CoRR, abs\/2011.07471 (2020)"},{"key":"44_CR38","unstructured":"Woodruff, D.P., Zhou, S.: Separations for estimating large frequency moments on data streams. In: 48th International Colloquium on Automata, Languages, and Programming, ICALP, pp. 112:1\u2013112:21 (2021)"},{"issue":"2","key":"44_CR39","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/110827144","volume":"24","author":"W Bin","year":"2014","unstructured":"Bin, W., Ding, C., Sun, D., Toh, K.-C.: On the Moreau-Yosida regularization of the vector k-norm related functions. SIAM J. Optim. 24(2), 766\u2013794 (2014)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:39:47Z","timestamp":1673577587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}