{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T03:54:21Z","timestamp":1763092461733},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/globalsip.2016.7906050","type":"proceedings-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T19:50:55Z","timestamp":1494618655000},"page":"1295-1299","source":"Crossref","is-referenced-by-count":13,"title":["Submodular maximization with multi-knapsack constraints and its applications in scientific literature recommendations"],"prefix":"10.1109","author":[{"given":"Qilian","family":"Yu","sequence":"first","affiliation":[]},{"given":"Easton Li","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Shuguang","family":"Cui","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"912","article-title":"Multi-document summarization via budgeted maximization of submodular functions","author":"lin","year":"2010","journal-title":"Proc of NAACL-HLT 2010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"journal-title":"Theoretical Guarantees and Complexity Reduction in Information Planning","year":"2015","author":"papachristoudis","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486168"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2670997"},{"journal-title":"Streaming algorithms for news and scientific literature recommendation Submodular maximization with a d-knapsack constraint","year":"0","author":"yu","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/587078.587096"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.149"},{"key":"ref19","article-title":"Citation analysis, centrality, and the ACL anthology","author":"joseph","year":"2007","journal-title":"Tech Rep"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"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":"1812","article-title":"Lazier than lazy greedy","author":"mirzasoleiman","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref7","first-page":"2049","author":"mirzasoleiman","year":"2013","journal-title":"Distributed submodular maximization Identifying representative elements in massive data"},{"key":"ref2","article-title":"How to select a good training-data subset for transcription: Submodular active selection for sequences","author":"lin","year":"2009","journal-title":"Tech Rep"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6639057"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"}],"event":{"name":"2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","start":{"date-parts":[[2016,12,7]]},"location":"Washington DC, DC, USA","end":{"date-parts":[[2016,12,9]]}},"container-title":["2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7897403\/7905762\/07906050.pdf?arnumber=7906050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T15:06:30Z","timestamp":1513177590000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7906050\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/globalsip.2016.7906050","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}