{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T14:09:30Z","timestamp":1778681370793,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T00:00:00Z","timestamp":1543968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61502328"],"award-info":[{"award-number":["61502328"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61572337"],"award-info":[{"award-number":["61572337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61672370"],"award-info":[{"award-number":["61672370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61602333"],"award-info":[{"award-number":["61602333"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of the Higher Education Institutions of Jiangsu Province","award":["15KJB520032"],"award-info":[{"award-number":["15KJB520032"]}]},{"DOI":"10.13039\/501100010242","name":"Jiangsu Planned Projects for Postdoctoral Research Funds","doi-asserted-by":"crossref","award":["1701173B"],"award-info":[{"award-number":["1701173B"]}],"id":[{"id":"10.13039\/501100010242","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization"},{"name":"Natural Science Foundation of the Higher Education Institutions of Jiangsu Province","award":["17KJB520036"],"award-info":[{"award-number":["17KJB520036"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s11280-018-0651-5","type":"journal-article","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T02:02:32Z","timestamp":1543975352000},"page":"2355-2378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Cost-efficient viral marketing in online social networks"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0721-7424","authenticated-orcid":false,"given":"Jingya","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingzhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"651_CR1","doi-asserted-by":"crossref","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Proceedings of the 3rd International Workshop on Internet and Network Economics (WINE), pp 306\u2013311 (2007)","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"651_CR2","first-page":"539","volume-title":"Lecture Notes in Computer Science","author":"Allan Borodin","year":"2010","unstructured":"Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Proceedings of the 6th International Workshop on Internet and Network Economics (WINE), pp 539\u2013550 (2010)"},{"issue":"3","key":"651_CR3","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1086\/209118","volume":"14","author":"JJ Brown","year":"1987","unstructured":"Brown, J.J., Reingen, P.H.: Social ties and word-of-mouth referral behavior. J. Consum. Res. 14(3), 350\u2013362 (1987)","journal-title":"J. Consum. Res."},{"issue":"5","key":"651_CR4","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/130929205","volume":"44","author":"N Buchbinder","year":"2015","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384\u20131402 (2015)","journal-title":"SIAM J. Comput."},{"key":"651_CR5","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. In: Proceedings of IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp 392\u2013403 (2012)","DOI":"10.1109\/FOCS.2012.73"},{"key":"651_CR6","doi-asserted-by":"crossref","unstructured":"Cha, M., Haddadi, H., Benevenuto, F., Gummadi, K.P.: Measuring user influence in twitter: the million follower fallacy. In: Proceedings of the 4th International AAAI Conference on Weblogs and Social Media, pp 10\u201317 (2010)","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"651_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"651_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"issue":"3","key":"651_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10115-012-0540-7","volume":"33","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Peng, W., Lee, S.: Efficient algorithms for influence maximization in social networks. Knowl. Inf. Syst. 33(3), 577\u2013601 (2012)","journal-title":"Knowl. Inf. Syst."},{"key":"651_CR10","doi-asserted-by":"crossref","unstructured":"Domingos, P.M., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"issue":"4","key":"651_CR11","doi-asserted-by":"publisher","first-page":"e3054","DOI":"10.1002\/ett.3054","volume":"28","author":"Meng Han","year":"2016","unstructured":"Han, M., Yan, M., Cai, Z., Li, Y., Cai, X., Yu, J.: Influence maximization by probing partial communities in dynamic online social networks. Trans. Emerging Telecommunications Technologies 28(4) (2017)","journal-title":"Transactions on Emerging Telecommunications Technologies"},{"key":"651_CR12","doi-asserted-by":"crossref","unstructured":"He, X., Kempe, D.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 885\u2013894 (2016)","DOI":"10.1145\/2939672.2939760"},{"key":"651_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"651_CR14","doi-asserted-by":"crossref","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 323\u2013332 (2009)","DOI":"10.1145\/1536414.1536459"},{"key":"651_CR15","unstructured":"Leskovec, J.: Livejournal social network. http:\/\/snap.stanford.edu\/data\/soc-LiveJournal1.html"},{"key":"651_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"issue":"2","key":"651_CR17","first-page":"60","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: Comparative influence diffusion and maximization. PVLDB 9(2), 60\u201371 (2015)","journal-title":"PVLDB"},{"key":"651_CR18","unstructured":"Pan, X., Jegelka, S., Gonzalez, J.E., Bradley, J.K., Jordan, M.I.: Parallel double greedy submodular maximization. In: Proceedings of Annual Conference on Neural Information Processing Systems (NIPS), pp. 118\u2013126 (2014)"},{"key":"651_CR19","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.M.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"651_CR20","doi-asserted-by":"crossref","unstructured":"Seeman, L., Singer, Y.: Adaptive seeding in social networks. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 459\u2013468 (2013)","DOI":"10.1109\/FOCS.2013.56"},{"key":"651_CR21","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Profit maximization for viral marketing in online social networks. In: Proceedings of the 24th IEEE International Conference on Network Protocols (ICNP), pp. 1\u201310 (2016)","DOI":"10.1109\/ICNP.2016.7784445"},{"key":"651_CR22","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"651_CR23","first-page":"211","volume-title":"Lecture Notes in Computer Science","author":"Qinyong Wang","year":"2018","unstructured":"Wang, Q.Y., Yin, H.Z., Wang, H., Huang, Z.: TSAUB: a temporal-sentiment-aware user behavior model for personalized recommendation. In: Proceedings of 29th Australasian Database Conference on Databases Theory and Applications (ADC), pp. 211\u2013223 (2018)"},{"issue":"2","key":"651_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TKDE.2016.2624734","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Chen, C.: Bring order into the samples: a novel scalable method for influence maximization. IEEE Trans. Knowl. Data Eng. 29(2), 243\u2013256 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"651_CR25","doi-asserted-by":"crossref","unstructured":"Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1039\u20131048 (2010)","DOI":"10.1145\/1835804.1835935"},{"key":"651_CR26","doi-asserted-by":"crossref","unstructured":"Wittie, M.P., Pejovic, V., Deek, L.B., Almeroth, K.C., Zhao, B.Y.: Exploiting locality of interest in online social networks. In: Proceedings of the 2010 ACM Conference on Emerging Networking Experiments and Technology (CoNEXT), pp. 1\u201325 (2010)","DOI":"10.1145\/1921168.1921201"},{"key":"651_CR27","doi-asserted-by":"crossref","unstructured":"Yin, H.Z., Chen, H.X., Sun, X.S., Wang, H., Nguyen, Q.V.H.: SPTF: a scalable probabilistic tensor factorization model for semantic-aware behavior prediction. In: Proceedings of the 2017 IEEE International Conference on Data Mining (ICDM), pp. 585\u2013594 (2017)","DOI":"10.1109\/ICDM.2017.68"},{"key":"651_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, J., Fan, J., Wang, J., Wang, X., Cheng, B.: Cost-efficient influence maximization in online social networks. In: Proceedings of the 5th International Conference on Advanced Cloud and Big Data (CBD), pp. 232\u2013237 (2017)","DOI":"10.1109\/CBD.2017.47"},{"key":"651_CR29","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Li, D., Zhang, Z.: Minimum cost seed set for competitive social influence. In: Proceedings of the 35th Annual IEEE International Conference on Computer Communications (INFOCOM), pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524472"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0651-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-018-0651-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0651-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T20:23:56Z","timestamp":1694463836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-018-0651-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,5]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s11280-018-0651-5","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,5]]},"assertion":[{"value":"10 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}