{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T01:45:38Z","timestamp":1774057538120,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61370025"],"award-info":[{"award-number":["61370025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Strategic Leading Science and Technology Projects of CAS","award":["XDA06030200"],"award-info":[{"award-number":["XDA06030200"]}]},{"name":"Strategic Leading Science and Technology Projects of CAS","award":["2013CB329605"],"award-info":[{"award-number":["2013CB329605"]}]},{"name":"Australia ARC Discovery","award":["DP140102206"],"award-info":[{"award-number":["DP140102206"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,10,1]]},"DOI":"10.1109\/tkde.2015.2419659","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T16:59:35Z","timestamp":1428080375000},"page":"2770-2783","source":"Crossref","is-referenced-by-count":106,"title":["On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization"],"prefix":"10.1109","volume":"27","author":[{"given":"Chuan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyu","family":"Zang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"ref38","first-page":"67","article-title":"Prediction of information diffusion probabilities for independent cascade model","author":"saito","year":"0","journal-title":"Proc 12th Int Conf Knowl -Based Intell Inf Eng Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2052042"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref37","article-title":"Influence maximization in continuous time diffusion networks","author":"rodriguez","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835933"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"},{"key":"ref34","first-page":"138","article-title":"Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations","author":"ohsaka","year":"0","journal-title":"Proc AAAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505541"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1776-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/60.3.581"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_27"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/TKDE.2012.34","article-title":"Efficient all top-$k$ computation—A unified solution for all top-$k$ , reverse top- $k$ and top-$m$ influential queries","volume":"25","author":"ge","year":"2013","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718518"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433478"},{"key":"ref4","first-page":"539","article-title":"Threshold models for competitive influence in social networks","author":"borodin","year":"0","journal-title":"Proc 6th Int Conf Internet Netw Econ"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-009-0150-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2011.286"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.106"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.122"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.40"},{"key":"ref21","article-title":"Personalized influence maximization on social networks","author":"guo","year":"0","journal-title":"Proc ACM Int Conf Inf Knowl Manag"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.55"},{"key":"ref24","first-page":"127","article-title":"Simulated annealing based influence maximization in social networks","author":"jiang","year":"0","journal-title":"Proc 26th Nat Conf Artif Intell"},{"key":"ref41","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref23","author":"horn","year":"1990","journal-title":"Matrix Analysis"},{"key":"ref26","first-page":"259","article-title":"Tractable models for information diffusion in social networks","author":"kimura","year":"0","journal-title":"Proc 10th Eur Conf Principle Practice Knowl Discovery Databases"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7247809\/07079460.pdf?arnumber=7079460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:38Z","timestamp":1641987998000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7079460\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,1]]},"references-count":42,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2419659","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2015,10,1]]}}}