{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,26]],"date-time":"2026-10-26T19:44:23Z","timestamp":1793043863156,"version":"4.5.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["20500147"],"award-info":[{"award-number":["20500147"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["AOARD-08-4027"],"award-info":[{"award-number":["AOARD-08-4027"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2009,4]]},"abstract":"<jats:p>We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, which is converse to the influence maximization problem in which the most influential nodes for information diffusion is searched in a social network. This minimization problem is more fundamental than the problem of preventing the spread of contamination by removing nodes in a network. We introduce two definitions for the contamination degree of a network, accordingly define two contamination minimization problems, and propose methods for efficiently finding good approximate solutions to these problems on the basis of a naturally greedy strategy. Using large social networks, we experimentally demonstrate that the proposed methods outperform conventional link-removal methods. We also show that unlike the case of blocking a limited number of nodes, the strategy of removing nodes with high out-degrees is not necessarily effective for these problems.<\/jats:p>","DOI":"10.1145\/1514888.1514892","type":"journal-article","created":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T10:14:44Z","timestamp":1240308884000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":168,"title":["Blocking links to minimize contamination spread in a social network"],"prefix":"10.1145","volume":"3","author":[{"given":"Masahiro","family":"Kimura","sequence":"first","affiliation":[{"name":"Ryukoku University, Otsu, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazumi","family":"Saito","sequence":"additional","affiliation":[{"name":"University of Shizuoka, Shizuoka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[{"name":"Osaka University, Osaka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,4,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 9th International World Wide Web Conference. Elsevier, 309--320","author":"Broder A.","unstructured":"Broder , A. , Kumar , R. , Maghoul , F. , Raghavan , P. , Rajagopalan , S. , Stata , R. , Tomkins , A. , and Wiener , J . 2000. Graph structure in the web . In Proceedings of the 9th International World Wide Web Conference. Elsevier, 309--320 . Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., and Wiener, J. 2000. Graph structure in the web. In Proceedings of the 9th International World Wide Web Conference. Elsevier, 309--320."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.5468"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988739"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 23rd AAAI Conference on Artificial Intelligence. AAAI","author":"Kimura M.","unstructured":"Kimura , M. , Saito , K. , and Motoda , H . 2008. Minimizing the spread of contamination by blocking links in a network . In Proceedings of the 23rd AAAI Conference on Artificial Intelligence. AAAI , Menlo Park, CA, 1175--1180. Kimura, M., Saito, K., and Motoda, H. 2008. Minimizing the spread of contamination by blocking links in a network. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence. AAAI, Menlo Park, CA, 1175--1180."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 22nd AAAI Conference on Artificial Intelligence. AAAI","author":"Kimura M.","unstructured":"Kimura , M. , Saito , K. , and Nakano , R . 2007. Extracting influential nodes for information diffusion on a social network . In Proceedings of the 22nd AAAI Conference on Artificial Intelligence. AAAI , Menlo Park, CA, 1371--1376. Kimura, M., Saito, K., and Nakano, R. 2007. Extracting influential nodes for information diffusion on a social network. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence. AAAI, Menlo Park, CA, 1371--1376."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.035101"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.036122"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514888.1514892","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1514888.1514892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:30:19Z","timestamp":1750239019000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514888.1514892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["10.1145\/1514888.1514892"],"URL":"https:\/\/doi.org\/10.1145\/1514888.1514892","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4]]},"assertion":[{"value":"2008-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-04-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}