{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:33:53Z","timestamp":1759667633706,"version":"3.37.3"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,13]]},"DOI":"10.1109\/dsaa54385.2022.10032383","type":"proceedings-article","created":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T18:54:03Z","timestamp":1675882443000},"page":"1-10","source":"Crossref","is-referenced-by-count":3,"title":["Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint"],"prefix":"10.1109","author":[{"given":"Canh V.","family":"Pham","sequence":"first","affiliation":[{"name":"Phenikaa University,ORLab, Faculty of Computer Science,Hanoi,Vietnam"}]},{"given":"Dung K.T.","family":"Ha","sequence":"additional","affiliation":[{"name":"VNU University of Engineering and Technology,Faculty of Information Technology,Hanoi,Vietnam"}]},{"given":"Huan X.","family":"Hoang","sequence":"additional","affiliation":[{"name":"Halong University,Faculty of Information Technology,Vietnam"}]},{"given":"Tan D.","family":"Tran","sequence":"additional","affiliation":[{"name":"People’s Security Academy,Hanoi,Vietnam"}]}],"member":"263","reference":[{"key":"ref1","first-page":"694","article-title":"Monotone k-submodular function maximization with size constraints","volume-title":"Proc. of Annual Conference on Neural Information Processing Systems (NIPS)","author":"Ohsaka"},{"key":"ref2","first-page":"7887","article-title":"Fast and private submodular and k-submodular functions maximization with matroid constraints","volume-title":"Proc. of the International Conference on Machine Learning (ICML)","author":"Rafiey"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2749263"},{"key":"ref4","first-page":"7338","article-title":"Streaming k-submodular maximization under noise subject to size constraint","volume-title":"Proc. of the International Conference on Machine Learning (ICML)","author":"Nguyen"},{"key":"ref5","first-page":"1055","article-title":"On bisubmodular maximization","volume-title":"Proc. of the International Conference on Artificial Intelligence and Statistics (AISTATS)","author":"Singh"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.108"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch30"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-022-00858-x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2021.11.010"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2017.01.003"},{"key":"ref11","first-page":"7887","article-title":"Fast and private submodular and k-submodular functions maximization with matroid constraints","volume-title":"Proc. of International Conference on Machine Learning (ICML)","author":"Rafiey"},{"key":"ref12","article-title":"On maximizing a monotone k-submodular function under a knapsack constraint","volume-title":"CoRR","volume":"abs\/2105.15159","author":"Tang","year":"2021"},{"key":"ref13","first-page":"3593","article-title":"Data summarization at scale: A two-stage submodular approach","volume-title":"Proc. of the International Conference on Machine Learning (ICML)","author":"Mitrovic"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2200\/s00527ed1v01y201308dtm037"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397742"},{"key":"ref17","first-page":"695","article-title":"Stop-andstare: Optimal sampling algorithms for viral marketing in billion-scale networks","volume-title":"Proc. of the International Conference on Management of Data (SIGMOD)","author":"Nguyen"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78825-8_8"},{"key":"ref19","first-page":"1205","article-title":"No-regret algorithms for online k-submodular maximization","volume-title":"Proc. of International Conference on Artificial Intelligence and Statistics (AISTATS)","author":"Soma"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976700.47"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref23","first-page":"391","article-title":"Budgeted nonparametric learning from data streams","volume-title":"Proc. of the International Conference on Machine Learning (ICML)","author":"Gomes"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486168"},{"key":"ref26","first-page":"1360","article-title":"Quick streaming algorithms for maximization of monotone submodular functions in linear time","volume-title":"Proc. of the International Conference on Artificial Intelligence and Statistics (AISTATS)","author":"Kuhnle"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00628-y"},{"key":"ref28","first-page":"3939","article-title":"Streaming submodular maximization under a k-set system constraint","volume-title":"Proc. of the International Conference on Machine Learning (ICML)","author":"Haba"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0900-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2691544"},{"article-title":"A. snap datasets: Stanford large network dataset collection","year":"2014","author":"Leskovec","key":"ref31"},{"article-title":"Intel lab","year":"2004","author":"Bodik","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"}],"event":{"name":"2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)","start":{"date-parts":[[2022,10,13]]},"location":"Shenzhen, China","end":{"date-parts":[[2022,10,16]]}},"container-title":["2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10032305\/10032324\/10032383.pdf?arnumber=10032383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T09:55:23Z","timestamp":1707818123000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10032383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/dsaa54385.2022.10032383","relation":{},"subject":[],"published":{"date-parts":[[2022,10,13]]}}}