{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:03:03Z","timestamp":1770678183998,"version":"3.49.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-13-1-0029"],"award-info":[{"award-number":["HDTRA1-13-1-0029"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61328102"],"award-info":[{"award-number":["61328102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61629101"],"award-info":[{"award-number":["61629101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91746301"],"award-info":[{"award-number":["91746301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1622433"],"award-info":[{"award-number":["DMS-1622433"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["AST-1547436"],"award-info":[{"award-number":["AST-1547436"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1508051\/1659025"],"award-info":[{"award-number":["ECCS-1508051\/1659025"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1343155"],"award-info":[{"award-number":["CNS-1343155"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2871668","type":"journal-article","created":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T21:29:35Z","timestamp":1537824575000},"page":"53736-53747","source":"Crossref","is-referenced-by-count":12,"title":["Streaming Algorithms for News and Scientific Literature Recommendation: Monotone Submodular Maximization With a <inline-formula> \n                     <tex-math notation=\"LaTeX\">$d$ <\/tex-math>\n                  <\/inline-formula>-Knapsack Constraint"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3990-2098","authenticated-orcid":false,"given":"Qilian","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2779-3595","authenticated-orcid":false,"given":"Li","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2608-775X","authenticated-orcid":false,"given":"Shuguang","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1812","article-title":"Lazier than lazy greedy","author":"mirzasoleiman","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref11","first-page":"912","article-title":"Multi-document summarization via budgeted maximization of submodular functions","author":"lin","year":"2010","journal-title":"Proc NAACL HLT"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref13","author":"yu","year":"2017","journal-title":"Fast budgeted influence maximization over multi-action event logs"},{"key":"ref14","article-title":"Theoretical guarantees and complexity reduction in information planning","author":"papachristoudis","year":"2015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486168"},{"key":"ref16","first-page":"137","article-title":"MapReduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc USENIX Symp Operat Syst Des Implement"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2670997"},{"key":"ref18","article-title":"Dynamics of large networks","author":"leskovec","year":"2008"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"ref28","article-title":"Citation analysis, centrality, and the ACL anthology","author":"joseph","year":"2007"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref27","article-title":"The pagerank citation ranking: Bringing order to the Web","author":"page","year":"1998"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2015.99"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.60"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref8","first-page":"2049","article-title":"Distributed submodular maximization: Identifying representative elements in massive data","author":"mirzasoleiman","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6639057"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"},{"key":"ref1","first-page":"1","article-title":"How to select a good training-data subset for transcription: Submodular active selection for sequences","author":"lin","year":"2009","journal-title":"Proc Annu Conf Int Speech Commun Assoc"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339642"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1754239.1754257"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009937"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13470-8_18"},{"key":"ref23","author":"fujishige","year":"2005","journal-title":"Submodular Functions and Optimization"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.149"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/587078.587096"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/6287639\/8274985\/8470074-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08470074.pdf?arnumber=8470074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:51Z","timestamp":1649444031000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8470074\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2871668","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}