{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:30:33Z","timestamp":1778499033450,"version":"3.51.4"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1733112"],"award-info":[{"award-number":["U1733112"]}],"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":["61702260"],"award-info":[{"award-number":["61702260"]}],"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":["62202169"],"award-info":[{"award-number":["62202169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1109\/tkde.2023.3328596","type":"journal-article","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T19:29:00Z","timestamp":1698694140000},"page":"3151-3165","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Regret Minimization: A Submodular Approach"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4378-5250","authenticated-orcid":false,"given":"Jiping","family":"Zheng","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5938-8520","authenticated-orcid":false,"given":"Fanxu","family":"Meng","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7661-3917","authenticated-orcid":false,"given":"Yanhao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Data Science and Engineering, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5461-4281","authenticated-orcid":false,"given":"Sheng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6667-2006","authenticated-orcid":false,"given":"Yuan","family":"Ma","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3273-6940","authenticated-orcid":false,"given":"Zhiyang","family":"Hao","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2685587"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914855"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920980"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816699"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732275"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035932"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196903"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00570-z"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00144"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14267-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102369"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-015-9155-5"},{"key":"ref15","first-page":"2096","article-title":"Collaborative Gaussian processes for preference learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Houlsby"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00182"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368291"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723735"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011600"},{"key":"ref20","first-page":"480","article-title":"Approximation algorithms for submodular set cover with applications","volume":"83","author":"Fujito","year":"2000","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref21","first-page":"2761","article-title":"Robust submodular observation selection","volume":"9","author":"Krause","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0006528"},{"key":"ref24","volume-title":"Submodular Functions and Optimization","author":"Fujishige","year":"2005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/218019a0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9486"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0041"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0041"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367935"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0246-6"},{"key":"ref33","first-page":"11:1","article-title":"k-regret minimizing set: Efficient algorithms and hardness","volume-title":"Proc. Int. Conf. Database Theory","author":"Cao"},{"key":"ref34","first-page":"7:1","article-title":"Efficient algorithms for k-regret minimizing sets","volume-title":"Proc. Int. Symp. Exp. Algorithms","author":"Agarwal"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831364"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3230634"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300080"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10652"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17460"},{"key":"ref40","first-page":"241","article-title":"Efficient computation of the skyline cube","volume-title":"Proc. 31st Int. Conf. Very Large Data Bases","author":"Yuan"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142530"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367854"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.84"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137653"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3406113"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213850"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300068"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00092"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3166835"},{"key":"ref50","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"Mitzenmacher","year":"2017"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref52","article-title":"Approximating happiness maximizing set problems","author":"Luenam","year":"2021"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.14778\/3565816.3565830"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref55","first-page":"510","article-title":"A class of submodular functions for document summarization","volume-title":"Proc. Annu. Meeting Assoc. Comput. Linguistics","author":"Lin"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937505"},{"key":"ref57","first-page":"2233","article-title":"Mixed robust\/average submodular partitioning: Fast algorithms, guarantees, and applications","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wei"},{"key":"ref58","first-page":"3128","article-title":"Structured robust submodular maximization: Offline and online algorithms","volume-title":"Proc. Int. Conf. Artif. Intell. Statisrt.","author":"Anari"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.60"},{"key":"ref60","volume-title":"Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice","author":"Bienstock","year":"2002"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688086"},{"key":"ref63","volume-title":"Introduction to Linear Optimization","author":"Bertsimas","year":"1997"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"ref65","first-page":"770","article-title":"Privacy skyline: Privacy with multidimensional adversarial knowledge","volume-title":"Proc. 33rd Int. Conf. Very Large Data Bases","author":"Chen"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10549876\/10301681.pdf?arnumber=10301681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:11:55Z","timestamp":1725685915000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10301681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":65,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3328596","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":[[2024,7]]}}}