{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:40:42Z","timestamp":1773895242929,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T00:00:00Z","timestamp":1518220800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["Tier 1 under Grant 2017-T1-002-024"],"award-info":[{"award-number":["Tier 1 under Grant 2017-T1-002-024"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["IDM Futures Funding Initiative"],"award-info":[{"award-number":["IDM Futures Funding Initiative"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"crossref","award":["Tier 1 under Grant 2017-T1-002-024"],"award-info":[{"award-number":["Tier 1 under Grant 2017-T1-002-024"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["Tier 2 under Grant MOE2015-T2-2-114"],"award-info":[{"award-number":["Tier 2 under Grant MOE2015-T2-2-114"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s13278-018-0489-y","type":"journal-article","created":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T10:54:14Z","timestamp":1518260054000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["An efficient and effective hop-based approach for influence maximization in social networks"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0785-707X","authenticated-orcid":false,"given":"Jing","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junsong","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,10]]},"reference":[{"key":"489_CR1","doi-asserted-by":"crossref","unstructured":"Arora A, Galhotra S, Ranu S (2017) Debunking the myths of influence maximization: an in-depth benchmarking study. In: Proceedings of ACM SIGMOD, pp 651\u2013666","DOI":"10.1145\/3035918.3035924"},{"issue":"5439","key":"489_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"489_CR3","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of SODA, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"489_CR4","doi-asserted-by":"crossref","unstructured":"Cha M, Mislove A, Gummadi KP (2009) A measurement-driven analysis of information propagation in the Flickr social network. In: Proceedings WWW, pp 721\u2013730","DOI":"10.1145\/1526709.1526806"},{"key":"489_CR5","unstructured":"Chen W (2009) NetHEPT dataset. http:\/\/research.microsoft.com\/en-us\/people\/weic\/"},{"key":"489_CR6","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Chen W, Cheng X (2014) IMRank: influence maximization via finding self-consistent ranking. In: Proceedings ACM SIGIR, pp 475\u2013484","DOI":"10.1145\/2600428.2609592"},{"key":"489_CR7","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings ACM CIKM, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"489_CR8","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process. In: Proceedings of AAAI, pp 592\u2013598"},{"key":"489_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010a) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of ACM KDD, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"489_CR10","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of ACM KDD, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"489_CR11","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of IEEE ICDM, pp. 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"489_CR12","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) Sketch-based influence maximization and computation: scaling up with guarantees. In: Proceedings ACM CIKM, pp 629\u2013638","DOI":"10.1145\/2661829.2662077"},{"issue":"3","key":"489_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti M, Cornu\u00e9jols G (1984) Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete Appl Math 7(3):251\u2013274","journal-title":"Discrete Appl Math"},{"issue":"6","key":"489_CR14","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TNET.2013.2290714","volume":"22","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Zhang H, Nguyen DT, Thai MT (2014) Cost-effective viral marketing for time-critical campaigns in large-scale social networks. IEEE ACM Trans Netw 22(6):2001\u20132011","journal-title":"IEEE ACM Trans Netw"},{"key":"489_CR15","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings ACM KDD, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"489_CR16","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In: Proceedings ACM SIGMOD, pp 743\u2013758","DOI":"10.1145\/2882903.2882929"},{"key":"489_CR17","doi-asserted-by":"crossref","unstructured":"Goel S, Watts DJ, Goldstein DG (2012) The structure of online diffusion networks. In: Proceedings ACM EC, pp 623\u2013638","DOI":"10.1145\/2229012.2229058"},{"issue":"1","key":"489_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS (2011a) A data-based approach to social influence maximization. Proc VLDB Endow 5(1):73\u201384","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"489_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s13278-012-0062-z","volume":"3","author":"A Goyal","year":"2013","unstructured":"Goyal A, Bonchi F, Lakshmanan L, Venkatasubramanian S (2013) On minimizing budget and time in influence propagation over social networks. Social Netw Anal Min 3(2):179\u2013192","journal-title":"Social Netw Anal Min"},{"key":"489_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011b) Celf++: Optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings WWW Companion, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"489_CR21","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011c) Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: Proceedings IEEE ICDM, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"489_CR22","doi-asserted-by":"crossref","unstructured":"Jiang F, Jin S, Wu Y, Xu J (2014) A uniform framework for community detection via influence maximization in social networks. In: Proceedings IEEE\/ACM ASONAM, pp 27\u201332","DOI":"10.1109\/ASONAM.2014.6921556"},{"key":"489_CR23","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) IRIE: scalable and robust influence maximization in social networks. In: Proceedings IEEE ICDM, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"489_CR24","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings ACM KDD, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"489_CR25","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is Twitter, a social network or a news media? In: Proceedings of WWW, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"489_CR26","doi-asserted-by":"crossref","unstructured":"Lee JR, Chung CW (2014) A fast approximation for influence maximization in large social networks. In: WWW Companion, pp 1157\u20131162","DOI":"10.1145\/2567948.2580063"},{"issue":"1","key":"489_CR27","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007a) The dynamics of viral marketing. ACM Trans Web 1(1):5:1\u20135:39","journal-title":"ACM Trans Web"},{"key":"489_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007b) Cost-effective outbreak detection in networks. In: Proceedings of ACM KDD, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"489_CR29","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"5","key":"489_CR30","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/TNET.2011.2178078","volume":"20","author":"Y Li","year":"2012","unstructured":"Li Y, Zhao BQ, Lui JCS (2012) On modeling product advertisement in large-scale online social networks. IEEE ACM Trans Netw 20(5):1412\u20131425","journal-title":"IEEE ACM Trans Netw"},{"key":"489_CR31","doi-asserted-by":"crossref","unstructured":"Lin Y, Chen W, Lui JC (2017) Boosting information spread: an algorithmic approach. In: Proceedings of IEEE ICDE, pp 883\u2013894","DOI":"10.1109\/ICDE.2017.137"},{"key":"489_CR32","doi-asserted-by":"crossref","unstructured":"Liu B, Cong G, Xu D, Zeng Y (2012) Time constrained influence maximization in social networks. In: Proceedings of IEEE ICDM, pp 439\u2013448","DOI":"10.1109\/ICDM.2012.158"},{"issue":"2","key":"489_CR33","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14778\/2850578.2850581","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu W, Chen W, Lakshmanan LV (2015) From competition to complementarity: comparative influence diffusion and maximization. Proc VLDB Endow 9(2):60\u201371","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"489_CR34","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"489_CR35","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Dinh TN, Thai MT (2016a) Cost-aware targeted viral marketing in billion-scale networks. In: Proceedings of IEEE INFOCOM","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"489_CR36","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016b) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of ACM SIGMOD, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"key":"489_CR37","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K (2014) Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. In: Proceedings of AAAI, pp 138\u2013144","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"489_CR38","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Sonobe T, Fujita S, Kawarabayashi Ki (2017) Coarsening massive influence networks for scalable diffusion analysis. In: Proceedings of ACM SIGMOD, pp 635\u2013650","DOI":"10.1145\/3035918.3064045"},{"issue":"5","key":"489_CR39","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/TPDS.2014.2320515","volume":"26","author":"G Song","year":"2015","unstructured":"Song G, Zhou X, Wang Y, Xie K (2015) Influence maximization on large-scale mobile social network: a divide-and-conquer method. IEEE Trans Parallel Distrib Syst 26(5):1379\u20131392","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"489_CR40","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of ACM SIGMOD, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"489_CR41","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Xiao X, Yuan J (2018a) Online processing algorithms for influence maximization. In: Proceedings of ACM SIGMOD","DOI":"10.1145\/3183713.3183749"},{"key":"489_CR42","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan J (2016) Profit maximization for viral marketing in online social networks. In: Proceedings of IEEE ICNP, pp 1\u201310","DOI":"10.1109\/ICNP.2016.7784445"},{"key":"489_CR43","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan J (2017a) Influence maximization meets efficiency and effectiveness: a hop-based approach. In: Proceedings of IEEE\/ACM ASONAM, pp 64\u201371","DOI":"10.1145\/3110025.3110041"},{"key":"489_CR44","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan J (2017b) Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans Knowl Data Eng (Preprint)","DOI":"10.1109\/ICNP.2016.7784445"},{"key":"489_CR45","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan J (2018b) Towards profit maximization for online social network providers. In: Proceedings of IEEE INFOCOM","DOI":"10.1109\/INFOCOM.2018.8485975"},{"key":"489_CR46","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of ACM SIGMOD, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"issue":"11","key":"489_CR47","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TKDE.2017.2740284","volume":"29","author":"Z Wang","year":"2017","unstructured":"Wang Z, Yang Y, Pei J, Chu L, Chen E (2017) Activity maximization by effective information diffusion in social networks. IEEE Trans Knowl Data Eng 29(11):2374\u20132387","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"489_CR48","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s13278-014-0153-0","volume":"4","author":"W Xu","year":"2014","unstructured":"Xu W, Lu Z, Wu W, Chen Z (2014) A novel approach to online social influence maximization. Social Netw Anal Min 4(1):153","journal-title":"Social Netw Anal Min"},{"key":"489_CR49","doi-asserted-by":"crossref","unstructured":"Zhang C, Sun J, Wang K (2013) Information propagation in microblog networks. In: Proceedings of IEEE\/ACM ASONAM, pp 190\u2013196","DOI":"10.1145\/2492517.2492608"},{"key":"489_CR50","doi-asserted-by":"crossref","unstructured":"Zhou C, Zhang P, Guo J, Guo L (2014) An upper bound based greedy algorithm for mining top-k influential nodes in social networks. In: Proceedings of WWW Companion, pp 421\u2013422","DOI":"10.1145\/2567948.2577336"},{"key":"489_CR51","doi-asserted-by":"crossref","unstructured":"Zhou C, Zhang P, Guo J, Zhu X, Guo L (2013) UBLF: an upper bound based approach to discover influential nodes in social networks. In: Proceedings of IEEE ICDM, pp 907\u2013916","DOI":"10.1109\/ICDM.2013.55"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-018-0489-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0489-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0489-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T04:58:28Z","timestamp":1660453108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-018-0489-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,10]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["489"],"URL":"https:\/\/doi.org\/10.1007\/s13278-018-0489-y","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,10]]},"assertion":[{"value":"30 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"10"}}