{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:47:03Z","timestamp":1764784023293},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"S3","license":[{"start":{"date-parts":[[2017,11,25]],"date-time":"2017-11-25T00:00:00Z","timestamp":1511568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Foundation Science","award":["61472340"],"award-info":[{"award-number":["61472340"]}]},{"name":"Shandong province colleges and universities science and technology research Project","award":["J15LN81"],"award-info":[{"award-number":["J15LN81"]}]},{"name":"doctor Foundation of Zaozhuang university","award":["1020703"],"award-info":[{"award-number":["1020703"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10586-017-1390-6","type":"journal-article","created":{"date-parts":[[2017,11,25]],"date-time":"2017-11-25T09:56:43Z","timestamp":1511603803000},"page":"5587-5602","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A community-based algorithm for influence blocking maximization in social networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Jiaguo","family":"Lv","sequence":"first","affiliation":[]},{"given":"Bin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,25]]},"reference":[{"key":"1390_CR1","doi-asserted-by":"crossref","unstructured":"Domingos, P., 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, August 26\u201329 (2001)","DOI":"10.1145\/502512.502525"},{"key":"1390_CR2","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370, July 23\u201325 (2002)","DOI":"10.1145\/775056.775057"},{"key":"1390_CR3","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146, August 24\u201327 (2003)","DOI":"10.1145\/956755.956769"},{"key":"1390_CR4","doi-asserted-by":"crossref","unstructured":"Liu, B., Cong, G., Xu, D., Zeng, Y.: Time constrained influence maximization in social networks. In: Proceedings of the IEEE 12th International Conference on Data Mining, Brussels, Belgium, pp. 439\u2013448, December 10\u201313 (2012)","DOI":"10.1109\/ICDM.2012.158"},{"key":"1390_CR5","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, July 25\u201328 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"1390_CR6","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, June 28\u2013July 1 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"1390_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the IEEE 10th International Conference on Data Mining, pp. 88\u201397, December 13\u201317 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"issue":"1","key":"1390_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Trans. Autom. Sci. Eng. 8(1), 130\u2013147 (2011)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"1390_CR9","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429, August 12\u201315 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"1390_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World Wide Web, pp. 47\u201348, March 28\u2013April 1 (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"1390_CR11","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":"1390_CR12","doi-asserted-by":"crossref","unstructured":"Shirazipourazad, S., Bogard, B., Vachhani, H., et al.: Influence propagation in adversarial setting: how to defeat competition with least amount of investment. In: Proceedings of the 21st ACM international conference on Information and knowledge Management (CIKM\u2019 2012), pp. 585\u2013594 (2012)","DOI":"10.1145\/2396761.2396837"},{"key":"1390_CR13","doi-asserted-by":"crossref","unstructured":"Yu, Y., Berger-Wolf, T.Y., Saia J.: Finding spread blockers in dynamic networks. In: Advances in Social Network Mining and Analysis, pp. 55\u201376. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14929-0_4"},{"key":"1390_CR14","doi-asserted-by":"crossref","unstructured":"Nguyen, N.P., Yan, G., Thai, M.T. et al.: Containment of misinformation spread in online social networks. In: Proceedings of the 3rd Annual ACM Web Science Conference, pp. 213\u2013222 (2012)","DOI":"10.1145\/2380718.2380746"},{"key":"1390_CR15","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on World Wide Web, pp. 665\u2013674 (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"1390_CR16","doi-asserted-by":"crossref","unstructured":"He, X., Song, G., Chen, W., et al.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 SIAM International Conference on Data Mining, pp. 463\u2013474 (2012)","DOI":"10.1137\/1.9781611972825.40"},{"issue":"6","key":"1390_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ipl.2009.12.009","volume":"110","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., et al.: A note on competitive diffusion through social networks. Inf. Process. Lett. 110(6), 221\u2013225 (2010)","journal-title":"Inf. Process. Lett."},{"key":"1390_CR18","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Simon, S.E.: Choosing products in social networks. In: Proceedings of the International Workshop on Internet and Network Economics (WINE), pp. 100\u2013113 (2012)","DOI":"10.1007\/978-3-642-35311-6_8"},{"key":"1390_CR19","doi-asserted-by":"crossref","unstructured":"Borodin, A., Braverman, M., Lucier, B., et al.: Strategyproof mechanisms for competitive influence in networks. In: Proceedings of 20th international conference on World Wide Web, pp. 141\u2013150 (2013)","DOI":"10.1145\/2488388.2488402"},{"key":"1390_CR20","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: WINE, vol. 6484, pp. 539\u2013550(2010)"},{"key":"1390_CR21","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-319-21042-1_53","volume-title":"Web-Age Information Management","author":"Hong Wu","year":"2015","unstructured":"Wu, H., Liu, W., Yue, K., Huang, W., Yang, K.: Maximizing the spread of competitive influence in a social network oriented to viral marketing. In: Proceedings of the 16th International conference on Web-Age Information Management(WAIM2015), pp. 516\u2013519 (2015)"},{"key":"1390_CR22","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.knosys.2016.07.008","volume":"109","author":"W Liu","year":"2016","unstructured":"Liu, W., Yue, K., Wu, H., Li, J., Liu, D., Tang, D.: Containment of competitive influence spread in social networks. Knowl.-Based Syst. 109, 266\u2013275 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"1390_CR23","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Li, D., Zhang, Z.: Minimum cost seed set for competitive social influence. In: Proceedings of the IEEE International Conference on Computer Communications (IEEE INFOCOM2016), pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524472"},{"key":"1390_CR24","first-page":"600","volume-title":"Communications in Computer and Information Science","author":"Hong Wu","year":"2016","unstructured":"Wu, H., Liu, W., Yue, K., Li, J., Huang, W.: Selecting seeds for competitive influence spread maximization in social networks. In: Proceedings of the International Conference of Young Computer Scientists, Engineers and Educators (ICYCSEE 2016), pp. 600\u2013611 (2016)"},{"key":"1390_CR25","unstructured":"Lin, Y., Lui, J.: Algorithmic design for competitive influence maximization problems. Eprint Arxiv (2014)"},{"key":"1390_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.peva.2015.06.012","volume":"91","author":"Y Lin","year":"2015","unstructured":"Lin, Y., Lui, J.C.S.: Analyzing competitive influence maximization problems with partial information: an approximation algorithmic framework. Perform. Eval. 91, 187\u2013204 (2015)","journal-title":"Perform. Eval."},{"key":"1390_CR27","doi-asserted-by":"crossref","unstructured":"Masucci, A.M., Silva, A.: Strategic resource allocation for competitive influence in social networks. In: Proceedings of the 52nd Annual Allerton Conference on Communication, Control, and Computing, pp. 951\u2013958 (2014)","DOI":"10.1109\/ALLERTON.2014.7028557"},{"key":"1390_CR28","doi-asserted-by":"crossref","unstructured":"Carnes, T., Nagarajan, C., Wild, S.M. et al.: Maximizing influence in a competitive social network: a follower\u2019s perspective. In: Proceedings of 9th international conference on Electronic Commerce, pp. 351\u2013360 (2007)","DOI":"10.1145\/1282100.1282167"},{"issue":"4","key":"1390_CR29","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Banchmark Graph for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-1390-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-017-1390-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-1390-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T17:47:28Z","timestamp":1659980848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-017-1390-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,25]]},"references-count":29,"journal-issue":{"issue":"S3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1390"],"URL":"https:\/\/doi.org\/10.1007\/s10586-017-1390-6","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,25]]},"assertion":[{"value":"30 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}