{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:14:51Z","timestamp":1720224891518},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T00:00:00Z","timestamp":1704758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T00:00:00Z","timestamp":1704758400000},"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":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-023-17979-y","type":"journal-article","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T05:02:27Z","timestamp":1704776547000},"page":"62853-62874","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Misinformation blocking maximization in online social networks"],"prefix":"10.1007","volume":"83","author":[{"given":"Lei","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,9]]},"reference":[{"key":"17979_CR1","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers, In: Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"17979_CR2","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing, In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, pp 61-70","DOI":"10.1145\/775047.775057"},{"issue":"11","key":"17979_CR3","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1007\/s00607-018-0684-8","volume":"101","author":"K Berahmand","year":"2019","unstructured":"Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 101(11):1711\u20131733","journal-title":"Computing"},{"issue":"12","key":"17979_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217979218501424","volume":"32","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Samadi N, Sheikholeslami SM (2018) Effect of rich-club on diffusion in complex networks. Int J Mod Phys B 32(12):1\u201319","journal-title":"Int J Mod Phys B"},{"key":"17979_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2018.01.017","volume":"764","author":"G D\u2019Angelo","year":"2019","unstructured":"D\u2019Angelo G, Severini L, Velaj Y (2019) Recommending links through influence maximization. Theoret Comput Sci 764:30\u201341","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"17979_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TCSS.2020.3046686","volume":"8","author":"K Tsitseklis","year":"2021","unstructured":"Tsitseklis K, Vitoropoulou M, Karyotis V, Papavassiliou S (2021) Socio-aware recommendations under complex user constraints. IEEE Trans Comput Social Syst 8(2):377\u2013387","journal-title":"IEEE Trans Comput Social Syst"},{"key":"17979_CR7","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) 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","DOI":"10.1145\/956750.956769"},{"key":"17979_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks, In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"17979_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physa.2019.123590","volume":"545","author":"A Ahmad","year":"2020","unstructured":"Ahmad A, Ahmad T, Bhatt A (2020) HWSMCB: a community-based hybrid approach for identifying influential nodes in the social network. Physica A 545:1\u201323","journal-title":"Physica A"},{"issue":"11","key":"17979_CR10","doi-asserted-by":"publisher","first-page":"7647","DOI":"10.1007\/s10489-021-02266-w","volume":"51","author":"S Kumar","year":"2021","unstructured":"Kumar S, Singhla L, Jindal K, Grover K, Panda BS (2021) IM-ELPR: influence maximization in social networks using label propagation based community structure. Appl Intell 51(11):7647\u20137665","journal-title":"Appl Intell"},{"issue":"6","key":"17979_CR11","first-page":"1","volume":"14","author":"J Guo","year":"2020","unstructured":"Guo J, Wu W (2020) Influence maximization: seeding based on community structure. ACM Trans Knowl Discov Data 14(6):1\u201322","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"10","key":"17979_CR12","doi-asserted-by":"publisher","first-page":"10829","DOI":"10.1007\/s10489-021-02880-8","volume":"52","author":"J Cheng","year":"2022","unstructured":"Cheng J, Yang K, Yang Z, Zhang H, Zhang W, Chen X (2022) Influence maximization based on community structure and second-hop neighborhoods. Appl Intell 52(10):10829\u201310844","journal-title":"Appl Intell"},{"key":"17979_CR13","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) 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","DOI":"10.1145\/1835804.1835934"},{"issue":"7","key":"17979_CR14","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1007\/s10489-018-01398-w","volume":"49","author":"X Rui","year":"2019","unstructured":"Rui X, Meng F, Wang Z, Yuan G (2019) A reversed node ranking approach for influence maximization in social networks. Appl Intell 49(7):2684\u20132698","journal-title":"Appl Intell"},{"key":"17979_CR15","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"17979_CR16","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 international conference on management of data, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"17979_CR17","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 international conference on management of data, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"17979_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of ACM SIGMOD international conference on management of data, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"issue":"21","key":"17979_CR19","doi-asserted-by":"publisher","first-page":"22133","DOI":"10.1007\/s11042-017-4890-8","volume":"76","author":"P Kumaran","year":"2017","unstructured":"Kumaran P, Chitrakala S (2017) Social influence determination on big data streams in an online social network. Multimed Tool Appl 76(21):22133\u201322167","journal-title":"Multimed Tool Appl"},{"key":"17979_CR20","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Xiao X, Yuan J (2018) Online processing algorithms for influence maximization. In: Proceedings of ACM SIGMOD international conference on management of data, pp 991\u20131005","DOI":"10.1145\/3183713.3183749"},{"key":"17979_CR21","doi-asserted-by":"crossref","unstructured":"Tong H, Prakash BA, Eliassi-Rad T, Faloutsos M, Faloutsos C (2012) Gelling, and melting, large graphs by edge manipulation. In: Proceedings of the 21st ACM international conference on information and knowledge management, pp 245\u2013254","DOI":"10.1145\/2396761.2396795"},{"key":"17979_CR22","doi-asserted-by":"crossref","unstructured":"Yao Q, Zhou C, Xiang L, Cao Y, Guo L (2015) Minimizing the negative influence by blocking links in social networks. In: Proceedings of the international conference on trustworthy computing and services, pp 65\u201373","DOI":"10.1007\/978-3-662-47401-3_9"},{"issue":"2","key":"17979_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3301302","volume":"13","author":"R Yan","year":"2019","unstructured":"Yan R, Li Y, Wu W, Li D, Wang Y (2019) Rumor blocking through online link deletion on social networks. ACM Trans Knowl Discov Data 13(2):1\u201326","journal-title":"ACM Trans Knowl Discov Data"},{"key":"17979_CR24","doi-asserted-by":"crossref","unstructured":"Kuhlman CJ, Tuli G, Swarup S, Marathe MV, Ravi SS (2013) Blocking simple and complex contagion by edge removal. In: Proceedings of the 13th IEEE international conference on data mining, pp 399\u201308","DOI":"10.1109\/ICDM.2013.47"},{"key":"17979_CR25","doi-asserted-by":"crossref","unstructured":"Zhang R, Li L, Du N, Liu H (2018) Epidemic propagation control with limited temporary link removed. In: Proceedings of the IEEE international conference on networking and network applications, pp 344\u2013349","DOI":"10.1109\/NANA.2018.8648768"},{"key":"17979_CR26","unstructured":"Wang S, Zhao X, Chen Y, Li Z, Zhang K, Xia J (2013) Negative influence minimizing by blocking nodes in social networks. In: Proceedings of the 27th AAAI conference on artificial intelligence, pp 134\u2013136"},{"key":"17979_CR27","doi-asserted-by":"crossref","unstructured":"Pham CV, Dinh HM, Nguyen HD, Dang HT, Hoang HX (2017) Limiting the spread of epidemics within time constraint on online social networks. In: Proceedings of the 8th ACM international symposium on information and communication technology, pp 262\u2013269","DOI":"10.1145\/3155133.3155157"},{"issue":"10","key":"17979_CR28","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/TKDE.2017.2728064","volume":"29","author":"B Wang","year":"2017","unstructured":"Wang B, Chen G, Fu L, Song L, Wang X (2017) DRIMUX: dynamic rumor influence minimization with user experience in social networks. IEEE Trans Knowl Data Eng 29(10):2168\u20132181","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"17979_CR29","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/TCSS.2020.2997188","volume":"7","author":"J Zhu","year":"2020","unstructured":"Zhu J, Ni P, Wang G (2020) Activity minimization of misinformation influence in online social networks. IEEE Trans Comput Social Syst 7(4):897\u2013906","journal-title":"IEEE Trans Comput Social Syst"},{"issue":"3","key":"17979_CR30","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/TNSE.2019.2903272","volume":"7","author":"R Yan","year":"2020","unstructured":"Yan R, Li D, Wu W, Du D, Wang Y (2020) Minimizing influence of rumors by blockers on social networks: algorithms and analysis. IEEE Trans Netw Sci Eng 7(3):1067\u20131078","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"1","key":"17979_CR31","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 the approximations for maximizing submodular set functions. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"17979_CR32","doi-asserted-by":"crossref","unstructured":"Nguyen NP, Yan G, Thai MT, Eidenbenz S (2012) Containment of misinformation spread in online social networks. In: Proceedings of the 4th annual ACM web science conference, pp 213\u2013222","DOI":"10.1145\/2380718.2380746"},{"key":"17979_CR33","doi-asserted-by":"crossref","unstructured":"Tripathi R, Rao S (2020) Positive information diffusion for rumor containment in online social networks. In: Proceedings of the 12th IEEE international conference on communication systems and networks, pp 610\u2013613","DOI":"10.1109\/COMSNETS48256.2020.9027478"},{"issue":"2","key":"17979_CR34","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/TNSE.2017.2783190","volume":"7","author":"G Tong","year":"2020","unstructured":"Tong G, Wu W, Guo L, Li D, Liu C, Liu B, Du D (2020) An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans Netw Sci Eng 7(2):845\u2013854","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"3","key":"17979_CR35","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TCSS.2021.3059430","volume":"8","author":"MA Manouchehri","year":"2021","unstructured":"Manouchehri MA, Helfroush MS, Danyali H (2021) A theoretically guaranteed approach to efficiently block the influence of misinformation in social networks. IEEE Trans Comput Social Syst 8(3):716\u2013727","journal-title":"IEEE Trans Comput Social Syst"},{"key":"17979_CR36","doi-asserted-by":"crossref","unstructured":"Fujita Y, Tsugawa S (2023) Limiting the spread of misinformation on multiplex social networks. In: Proceedings of the 47th IEEE annual computers, software, and applications conference, pp 406\u2013411","DOI":"10.1109\/COMPSAC57700.2023.00061"},{"key":"17979_CR37","doi-asserted-by":"crossref","unstructured":"Shi Q, Wang C, Ye D, Chen J, Feng Y, Chen C (2019) Adaptive influence blocking: minimizing the negative spread by observation-based policies. In: Proceedings of the 35th IEEE international conference on data engineering, pp 1502\u20131513","DOI":"10.1109\/ICDE.2019.00135"},{"issue":"2","key":"17979_CR38","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TCSS.2018.2818661","volume":"5","author":"G Tong","year":"2018","unstructured":"Tong G, Wu W, Du D (2018) Distributed rumor blocking with multiple positive cascades. IEEE Trans Comput Social Syst 5(2):468\u2013480","journal-title":"IEEE Trans Comput Social Syst"},{"issue":"3","key":"17979_CR39","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of enumeration and reliability problems. SIAM J Comput 8(3):410\u2013421","journal-title":"SIAM J Comput"},{"key":"17979_CR40","unstructured":"SNAP Datasets, http:\/\/snap.stanford.edu\/data\/"},{"issue":"4","key":"17979_CR41","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1207\/S15327957PSPR0504_2","volume":"5","author":"P Rozin","year":"2001","unstructured":"Rozin P, Royzman EB (2001) Negativity bias, negativity dominance, and contagion. Pers Soc Psychol Rev 5(4):296\u2013320","journal-title":"Pers Soc Psychol Rev"},{"key":"17979_CR42","doi-asserted-by":"crossref","unstructured":"He Z, Cai Z, Wang X (2015) Modeling propagation dynamics and developing optimized countermeasures for rumor spreading in online social networks. In: Proceedings of the 35th IEEE international conference on distributed computing systems, pp 205\u2013214","DOI":"10.1109\/ICDCS.2015.29"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-17979-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-17979-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-17979-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T16:13:17Z","timestamp":1720195997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-17979-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,9]]},"references-count":42,"journal-issue":{"issue":"23","published-online":{"date-parts":[[2024,7]]}},"alternative-id":["17979"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-17979-y","relation":{},"ISSN":["1573-7721"],"issn-type":[{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,9]]},"assertion":[{"value":"14 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interests that are relevant to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interests"}}]}}