{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:30:50Z","timestamp":1743046250189,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_25","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"329-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Model for\u00a0Rumor Blocking Problem in\u00a0Social Networks Under Rumor Source Uncertainty"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-8254","authenticated-orcid":false,"given":"Jianming","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runzhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Smita","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aslay, C., Lakshmanan, L.V., Lu, W., Xiao, X.: Influence maximization in online social networks. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 775\u2013776. ACM (2018)","DOI":"10.1145\/3159652.3162007"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-77105-0_31","volume-title":"Internet and Network Economics","author":"S Bharathi","year":"2007","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306\u2013311. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_31"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. SIAM (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"25_CR4","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. ACM (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"25_CR5","unstructured":"Burkitt, L.: Fearing radiation, Chinese rush to buy table salt. The Wall Street Journal (2011)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795\u2013804. ACM (2016)","DOI":"10.1145\/2939672.2939745"},{"issue":"5","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P Dagum","year":"2000","unstructured":"Dagum, P., Karp, R., Luby, M., Ross, S.: An optimal algorithm for monte carlo estimation. SIAM J. Comput. 29(5), 1484\u20131496 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR8","first-page":"1","volume":"18","author":"N Du","year":"2017","unstructured":"Du, N., Liang, Y., Balcan, M.F., Gomez-Rodriguez, M., Zha, H., Song, L.: Scalable influence maximization for multiple products in continuous-time diffusion networks. J. Mach. Learn. Res. 18(2), 1\u201345 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2019.05.044","volume":"803","author":"Q Fang","year":"2020","unstructured":"Fang, Q., et al.: General rumor blocking: an efficient random algorithm with martingale approach. Theoret. Comput. Sci. 803, 82\u201393 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR10","unstructured":"Garimella, K., Gionis, A., Parotsidis, N., Tatti, N.: Balancing information exposure in social networks (2017)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., 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. ACM (2003)","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"25_CR12","first-page":"9","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Dis. Data (TKDD) 3(2), 9 (2009)","journal-title":"ACM Trans. Knowl. Dis. Data (TKDD)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Li, S., Zhu, Y., Li, D., Kim, D., Huang, H.: Rumor restriction in online social networks. In: 2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC), pp. 1\u201310. IEEE (2013)","DOI":"10.1109\/PCCC.2013.6742780"},{"key":"25_CR14","unstructured":"Lowalekar, M., Varakantham, P., Kumar, A.: Robust influence maximization. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 1395\u20131396. International Foundation for Autonomous Agents and Multiagent Systems (2016)"},{"key":"25_CR15","unstructured":"Morozov, E.: Swine flu: Twitters power to misinform. Foreign policy (2009)"},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695\u2013710. ACM (2016)","DOI":"10.1145\/2882903.2915207"},{"issue":"6","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen, H., Zheng, R.: On budgeted influence maximization in social networks. IEEE J. Sel. Areas Commun. 31(6), 1084\u20131094 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.I.: Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: AAAI, pp. 138\u2013144 (2014)","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Ping, Y., Cao, Z., Zhu, H.: Sybil-aware least cost rumor blocking in social networks. In: 2014 IEEE Global Communications Conference (GLOBECOM), pp. 692\u2013697. IEEE (2014)","DOI":"10.1109\/GLOCOM.2014.7036888"},{"key":"25_CR21","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. ACM (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386. ACM (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Tong, G., et al.: An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans. Netw. Sci. Eng. (2017)","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Tsai, J., Nguyen, T.H., Tambe, M.: Security games for controlling contagion. In: AAAI (2012)","DOI":"10.1109\/SocialCom.2013.11"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Wang, B., Chen, G., Fu, L., Song, L., Wang, X., Liu, X.: Drimux: dynamic rumor influence minimization with user experience in social networks. In: AAAI, vol. 16, pp. 791\u2013797 (2016)","DOI":"10.1609\/aaai.v30i1.10063"},{"issue":"3","key":"25_CR26","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TCSS.2017.2719056","volume":"4","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Lu, Z., Li, V.O., Xu, K.: Noncooperative information diffusion in online social networks under the independent cascade model. IEEE Trans. Comput. Soc. Syst. 4(3), 150\u2013162 (2017)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-21786-4_4","volume-title":"Computational Social Networks","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Zhang, H., Li, X., Thai, M.T.: Limiting the spread of misinformation while effectively raising awareness in social networks. In: Thai, M.T., Nguyen, N.P., Shen, H. (eds.) CSoNet 2015. LNCS, vol. 9197, pp. 35\u201347. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21786-4_4"},{"key":"25_CR28","unstructured":"Zhu, J., Ghosh, S., Wu, W.: Group influence maximization problem in social networks. IEEE Trans. Comput. Soc. Syst. PP(99), 1\u20139 (2019)"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Zhu, J., Ghosh, S., Wu, W.: Robust rumor blocking problem with uncertain rumor sources in social networks. World Wide Web (1), 24 (2021)","DOI":"10.1007\/s11280-020-00841-8"},{"key":"25_CR30","unstructured":"Zhu, J., Ni, P., Tong, G., Wang, G., Huang, J.: Influence maximization problem with echo chamber effect in social network. IEEE Trans. Comput. Soc. Syst. PP(99), 1\u20139 (2021)"},{"key":"25_CR31","doi-asserted-by":"publisher","unstructured":"Zhu, J., Zhu, J., Ghosh, S., Wu, W., Yuan, J.: Social influence maximization in hypergraph in social networks. IEEE Trans. Netw. Sci. Eng., 1\u20131 (2018). https:\/\/doi.org\/10.1109\/TNSE.2018.2873759","DOI":"10.1109\/TNSE.2018.2873759"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:06:59Z","timestamp":1702026419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}