{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:55:55Z","timestamp":1772121355831,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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. Emerg. Topics Comput."],"published-print":{"date-parts":[[2022,1,1]]},"DOI":"10.1109\/tetc.2020.3031057","type":"journal-article","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T19:31:24Z","timestamp":1602703884000},"page":"463-475","source":"Crossref","is-referenced-by-count":10,"title":["On Adaptive Influence Maximization Under General Feedback Models"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3247-4019","authenticated-orcid":false,"given":"Guangmo","family":"Tong","sequence":"first","affiliation":[]},{"given":"Ruiqi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"tong","year":"0"},{"key":"ref38","article-title":"Yahoo! search marketing advertiser bidding data","year":"0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1517472.1517473"},{"key":"ref36","article-title":"SNAP Datasets: Stanford large network dataset collection","author":"leskovec","year":"2014"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2740284"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737485"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5398"},{"key":"ref27","article-title":"On adaptivity gaps of influence maximization under the independent cascade model with full adoption feedback","author":"chen","year":"2019"},{"key":"ref29","first-page":"427","article-title":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization","volume":"42","author":"golovin","year":"2011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2018.8508254"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/546"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213883"},{"key":"ref24","first-page":"20","article-title":"Heuristic algorithms for influence maximization in partially observable social networks","author":"stein","year":"2017","journal-title":"Proc Int Workshop Soc Influence Anal Int Joint Conf Artif Intell"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2019.10.013"},{"key":"ref26","first-page":"5575","article-title":"Adaptive influence maximization with myopic feedback","author":"peng","year":"2019","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref25","article-title":"Time-constrained adaptive influence maximization","author":"tong","year":"2019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220101"},{"key":"ref40","first-page":"339","article-title":"On misinformation containment in online social networks","author":"tong","year":"2018","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref12","first-page":"160","article-title":"Near-optimal batch mode active learning and adaptive submodular optimization","author":"chen","year":"2013","journal-title":"Proc 30th Int Conf Int Conf Mach Learn"},{"key":"ref13","article-title":"Adaptive influence maximization in social networks: Why commit when you can adapt?","author":"vaswani","year":"2016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783271"},{"key":"ref15","first-page":"1746","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"chen","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref16","first-page":"3530","article-title":"Model-independent online learning for influence maximization","author":"vaswani","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","first-page":"3022","article-title":"Online influence maximization under independent cascade model with semi-bandit feedback","author":"wen","year":"2017","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.56"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2994501.2994503"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3162007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2503792.2503797"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.34"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"ref8","first-page":"427","article-title":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization","volume":"42","author":"golovin","year":"2011","journal-title":"J Artif Intell Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1005591"},{"key":"ref49","first-page":"379","article-title":"Combinatorial pure exploration of multi-armed bandits","author":"chen","year":"2014","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2563397"},{"key":"ref46","article-title":"Deterministic & adaptive non-submodular maximization via the primal curvature","author":"smith","year":"2017"},{"key":"ref45","article-title":"Approximate submodular functions and performance guarantees","author":"gupta","year":"2018"},{"key":"ref48","first-page":"1741","article-title":"On the convexity of latent social network inference","author":"myers","year":"2010","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-09774-x"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref44","first-page":"498","article-title":"Guarantees for greedy maximization of non-submodular functions with applications","author":"bian","year":"2017"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04648-4_23"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245516\/9726526\/09224160.pdf?arnumber=9224160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T22:52:04Z","timestamp":1670367124000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9224160\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":49,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2020.3031057","relation":{},"ISSN":["2168-6750","2376-4562"],"issn-type":[{"value":"2168-6750","type":"electronic"},{"value":"2376-4562","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,1]]}}}