{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:16:17Z","timestamp":1730214977056,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,22]]},"DOI":"10.1109\/dsit55514.2022.9943820","type":"proceedings-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T20:39:41Z","timestamp":1668717581000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithmic View of Streaming Submodular Data Summarization with A Knapsack Constraint"],"prefix":"10.1109","author":[{"given":"Enpei","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China,School of Computer Science and Technology,Hefei,China"}]},{"given":"Kai","family":"Han","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,School of Computer Science and Technology,Hefei,China"}]},{"given":"Benwei","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,School of Computer Science and Technology,Hefei,China"}]}],"member":"263","reference":[{"key":"ref10","first-page":"515","article-title":"Categorical feature compression via submodular optimization","author":"bateni","year":"2019","journal-title":"International Conference on Machine Learning (ICML)"},{"key":"ref11","first-page":"1138","article-title":"Optimal distributed sub-modular optimization via sketching","author":"bateni","year":"2018","journal-title":"ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11529"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref15","first-page":"235","article-title":"Submodular functions and convexity","author":"lovasz","year":"2012","journal-title":"Mathematical Pro-gramming The State of the Art Bonn 1982"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-021-10065-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00786-4"},{"key":"ref18","article-title":"Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint","author":"huang","year":"2017","journal-title":"Approximation Randomization and Combinatorial Opti-mization Algorithms and Techniques"},{"key":"ref19","first-page":"3263","article-title":"bring your own greedy”+ max: Near-optimal 1\/2-approximations for submodular knapsack","author":"yaroslavtsev","year":"2020","journal-title":"International Conference on Artificial Intelligence and Statistics (AIS-TATS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367524"},{"key":"ref3","first-page":"391","article-title":"Budgeted nonparametric learning from data streams","author":"gomes","year":"2010","journal-title":"International Conference on International Conference on Machine Learning (ICML)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396857"},{"key":"ref5","first-page":"510","article-title":"A class of submodular functions for document summarization","author":"lin","year":"0","journal-title":"Annual Meeting of the Association for Computational Linguistics (ACL)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557056"},{"key":"ref7","first-page":"439","article-title":"Beyond keyword search: discovering rel-evant scientific literature","author":"el-arini","year":"2011","journal-title":"ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)"},{"key":"ref2","first-page":"1","article-title":"Non-metric affinity propagation for unsuper-vised image categorization","author":"dueck","year":"2007","journal-title":"International Conference on Computer Vision (VISION)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref1","first-page":"276","article-title":"Near optimal algorithms for hard submodular programs with discounted cooperative costs","author":"iyer","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3447383","article-title":"Approximation algorithms for submodular data sum-marization with a knapsack constraint","volume":"5","author":"han","year":"2021","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)"},{"key":"ref22","first-page":"430","article-title":"Deterministic approximation for submodular maximization over a matroid in nearly linear time","volume":"33","author":"han","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"ref24","first-page":"1358","article-title":"Fast constrained submodular maximization: Personalized data summarization","author":"mirzasoleiman","year":"2016","journal-title":"Inter-national Conference on Machine Learning"},{"key":"ref23","article-title":"Simultaneous greedys: A swiss army knife for constrained submodular maximization","volume":"abs 2009 13998","author":"feldman","year":"2020","journal-title":"CoRR"},{"key":"ref25","first-page":"1833","article-title":"Non-monotone submodular maximization with nearly optimal adaptivity and query complexity","author":"fahrbach","year":"2019","journal-title":"International Conference on Machine Learning (ICML)"}],"event":{"name":"2022 5th International Conference on Data Science and Information Technology (DSIT)","start":{"date-parts":[[2022,7,22]]},"location":"Shanghai, China","end":{"date-parts":[[2022,7,24]]}},"container-title":["2022 5th International Conference on Data Science and Information Technology (DSIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9943793\/9943812\/09943820.pdf?arnumber=9943820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T20:00:26Z","timestamp":1670875226000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9943820\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,22]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/dsit55514.2022.9943820","relation":{},"subject":[],"published":{"date-parts":[[2022,7,22]]}}}