{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:01:47Z","timestamp":1770678107018,"version":"3.49.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,7,1]]},"DOI":"10.1109\/tkde.2018.2854182","type":"journal-article","created":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T19:11:45Z","timestamp":1531336305000},"page":"1327-1340","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Representative Subset Selection over Sliding Windows"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7661-3917","authenticated-orcid":false,"given":"Yanhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9646-291X","authenticated-orcid":false,"given":"Yuchen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067429"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904490"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.55"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2809814"},{"key":"ref31","first-page":"1244","article-title":"Adaptive maximization of pointwise submodular functions with budget constraint","author":"cuong","year":"2016","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref30","first-page":"609","article-title":"Fast sparse gaussian process methods: The informative vector machine","author":"lawrence","year":"2002","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref37","first-page":"2449","article-title":"Deletion-robust submodular maximization: Data summarization with “the right to be forgotten","author":"mirzasoleiman","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","first-page":"11:1","article-title":"Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint","volume":"81","author":"huang","year":"0","journal-title":"Leibniz Proc Int in Inform (LIPIcs)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"ref10","first-page":"507","article-title":"Large-scale submodular greedy exemplar selection with structured similarity matrices","author":"malioutov","year":"2016","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035952"},{"key":"ref11","first-page":"1358","article-title":"Fast constrained submodular maximization: Personalized data summarization","author":"mirzasoleiman","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","first-page":"2850","article-title":"Retaining data from streams of social platforms with minimal regret","author":"tam","year":"2017","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7906050"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2685587"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498266"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3151113.3151121"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/3151113.3151122"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113321"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3052772"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.60"},{"key":"ref4","first-page":"721","article-title":"Using document summarization techniques for speech data subset selection","author":"wei","year":"2013","journal-title":"Proc Conf North Amer Chapter Assoc Comput Linguistics Human Language Technol"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref3","first-page":"510","article-title":"A class of submodular functions for document summarization","author":"lin","year":"2011","journal-title":"Ann Meeting Assoc Computational Linguistics Human Lang Techn"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.46"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588580"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983736"},{"key":"ref7","first-page":"1954","article-title":"Submodularity in data subset selection and active learning","author":"wei","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","first-page":"391","article-title":"Budgeted nonparametric learning from data streams","author":"gomes","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref9","first-page":"3414","article-title":"Leveraging sparsity for efficient submodular data summarization","author":"lindgren","year":"2016","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00127"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.60"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"ref21","first-page":"912","article-title":"Multi-document summarization via budgeted maximization of submodular functions","author":"lin","year":"2010","journal-title":"Proc Conf North Amer Chapter Assoc Comput Linguistics Human Language Technol"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052699"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8730464\/08410031.pdf?arnumber=8410031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:18Z","timestamp":1657746558000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8410031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,1]]},"references-count":41,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2854182","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,1]]}}}