{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T19:39:02Z","timestamp":1772221142462,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"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":["72074203"],"award-info":[{"award-number":["72074203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tcss.2021.3073064","type":"journal-article","created":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T19:34:14Z","timestamp":1619724854000},"page":"1163-1171","source":"Crossref","is-referenced-by-count":27,"title":["Influence Maximization Problem With Echo Chamber Effect in Social Network"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-8254","authenticated-orcid":false,"given":"Jianming","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0054-2323","authenticated-orcid":false,"given":"Peikun","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3247-4019","authenticated-orcid":false,"given":"Guangmo","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"ref32","first-page":"304","article-title":"Greed is still good: Maximizing monotone submodular+ supermodular (BP) functions","volume":"80","author":"bai","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref31","first-page":"74","article-title":"Approximate submodularity and its applications: Subset selection, sparse approximation and dictionary selection","volume":"19","author":"das","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.10.019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37210-0_40"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref34","year":"2019","journal-title":"Sina Weibo Dataset"},{"key":"ref10","first-page":"2104","article-title":"Maximizing the coverage of information propagation in social networks","author":"wang","year":"2015","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2020.3032616"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2749263"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2966593"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2020.2998777"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2939841"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2873759"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.08.045"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref6","first-page":"138","article-title":"Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations","author":"ohsaka","year":"2014","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3162007"},{"key":"ref7","first-page":"1","article-title":"Scalable influence maximization for multiple products in continuous-time diffusion networks","volume":"18","author":"du","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1517441113"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2938575"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3313904"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.04.033"},{"key":"ref21","article-title":"Guarantees for greedy maximization of non-submodular functions with applications","author":"an bian","year":"2017","journal-title":"arXiv 1703 02100"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-018-0233-3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.012"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101522"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.070"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/9552980\/09419372.pdf?arnumber=9419372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:48Z","timestamp":1652194428000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9419372\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":36,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2021.3073064","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}