{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T09:14:33Z","timestamp":1775466873391,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA2386-16-1-4032"],"award-info":[{"award-number":["FA2386-16-1-4032"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17K00314"],"award-info":[{"award-number":["17K00314"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10844-018-0523-6","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T04:02:01Z","timestamp":1534737721000},"page":"235-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Accurate and efficient detection of critical links in network to minimize information loss"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-5002","authenticated-orcid":false,"given":"Kazumi","family":"Saito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouzou","family":"Ohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Kimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,20]]},"reference":[{"key":"523_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378\u2013382.","journal-title":"Nature"},{"key":"523_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., & Vigna, S. (2013). In-core computation of geometric centralities with hyperball: a hunderd billion nodes and beyond. In Proceedings of the 2013 IEEE 13th international conference on data mining workshops (ICDMW\u201913) (pp. 621\u2013628).","DOI":"10.1109\/ICDMW.2013.10"},{"key":"523_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10844-011-0181-4","volume":"40","author":"F Bonchi","year":"2013","unstructured":"Bonchi, F., Castillo, C., Ienco, D. (2013). Meme ranking to maximize posts virality in microblogging platforms. Journal of Intelligent Information Systems, 40, 211\u2013239.","journal-title":"Journal of Intelligent Information Systems"},{"key":"523_CR4","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 (SODA\u201914) (pp. 946\u2013957).","DOI":"10.1137\/1.9781611973402.70"},{"key":"523_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30, 107\u2013117.","journal-title":"Computer Networks and ISDN Systems"},{"key":"523_CR6","doi-asserted-by":"crossref","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J. (2000). Graph structure in the web. In Proceedings of the 9th international world wide web conference (pp. 309\u2013320).","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"523_CR7","doi-asserted-by":"publisher","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"DS Callaway","year":"2000","unstructured":"Callaway, D.S., Newman, M.E.J., Strogatz, S.H., Watts, D.J. (2000). Network robustness and fragility: percolation on random graphs. Physical Reveiw Letters, 85, 5468\u20135471.","journal-title":"Physical Reveiw Letters"},{"key":"523_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"S Chakrabarti","year":"1999","unstructured":"Chakrabarti, S., Dom, B., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A., Gibson, D., Kleinberg, J. (1999). Mining the web\u2019s link structure. IEEE Computer, 32, 60\u201367.","journal-title":"IEEE Computer"},{"issue":"4","key":"523_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L., Castillo, C. (2013). Information and influence propagation in social networks. Synthesis Lectures on Data Management, 5(4), 1\u2013177.","journal-title":"Synthesis Lectures on Data Management"},{"key":"523_CR10","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Epasto, A., Kumar, R., Lattanzi, S., Mirrokni, V. (2015). Efficient algorithms for public-private social networks. In Proceedings of the 21st ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201915) (pp. 139\u2013148).","DOI":"10.1145\/2783258.2783354"},{"key":"523_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E Cohen","year":"1997","unstructured":"Cohen, E. (1997). Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55, 441\u2013453.","journal-title":"Journal of Computer and System Sciences"},{"key":"523_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F. (2014). Sketch-based influence maximization and computation: scaling up with guarantees. In Proceedings of the 23rd ACM international conference on conference on information and knowledge management (pp. 629\u2013638).","DOI":"10.1145\/2661829.2662077"},{"key":"523_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L Freeman","year":"1979","unstructured":"Freeman, L. (1979). Centrality in social networks: conceptual clarification. Social Networks, 1, 215\u2013 239.","journal-title":"Social Networks"},{"key":"523_CR14","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 (KDD\u201903) (pp. 137\u2013146).","DOI":"10.1145\/956750.956769"},{"key":"523_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J., Tardos, E. (2015). Maximizing the spread of influence through a social network. Theory of Computation, 11, 105\u2013147.","journal-title":"Theory of Computation"},{"key":"523_CR16","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1514888.1514892","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura, M., Saito, K., Motoda, H. (2009). Blocking links to minimize contamination spread in a social network. ACM Transactions on Knowledge Discovery from Data, 3, 9:1\u20139:23.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"523_CR17","unstructured":"Kimura, M., Saito, K., Nakano, R. (2007). Extracting influential nodes for information diffusion on a social network. In Proceedings of the 22nd AAAI conference on artificial intelligence (AAAI-07) (pp. 1371\u20131376)."},{"key":"523_CR18","doi-asserted-by":"crossref","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H. (2014). Efficient analysis of node influence based on sir model over huge complex networks. In Proceedings of the 2014 international conference on data science and advanced analytics (DSAA\u201914) (pp. 216\u2013222).","DOI":"10.1109\/DSAA.2014.7058076"},{"key":"523_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41060-015-0001-y","volume":"1","author":"M Kimura","year":"2016","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H. (2016). Speeding-up node influence computation for huge social networks. International Journal of Data Science and Analytics, 1, 1\u201314.","journal-title":"International Journal of Data Science and Analytics"},{"key":"523_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman, M. (2003). The structure and function of complex networks. SIAM Review, 45, 167\u2013256.","journal-title":"SIAM Review"},{"issue":"035","key":"523_CR21","first-page":"101","volume":"66","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J., Forrest, S., Balthrop, J. (2002). Email networks and the spread of computer viruses. Physical Review E, 66(035), 101.","journal-title":"Physical Review E"},{"key":"523_CR22","doi-asserted-by":"crossref","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H. (2014). Resampling-based framework for estimating node centrality of large social network. In Proceedings of the 17th international conference on discovery science (DS\u201914) (pp. 228\u2013239). LNAI 8777.","DOI":"10.1007\/978-3-319-11812-3_20"},{"key":"523_CR23","doi-asserted-by":"crossref","unstructured":"Saito, K., Kimura, M., Ohara, K., Motoda, H. (2016). Detecting critical links in complex network to maintain information flow\/reachability. In Proceedings of the 14th Pacific Rim international conference on artificial intelligence (pp. 419\u2013432).","DOI":"10.1007\/978-3-319-42911-3_35"},{"key":"523_CR24","doi-asserted-by":"crossref","unstructured":"Saito, K., Ohara, K., Kimura, M., Motoda, H. (2017). An accurate and efficient method to detect critical links to maintain information flow in network. In Proceedings of the 23th international symposium on methodologies for intelligent systems (pp. 116\u2013126).","DOI":"10.1007\/978-3-319-60438-1_12"},{"key":"523_CR25","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/TPDS.2014.2320515","volume":"26","author":"G Song","year":"2015","unstructured":"Song, G., Zhou, X., Wang, Y., Xie, K. (2015). Influence maximization on large-scale mobile social network: a divide-and-conquer method. IEEE Transactions on Parallel and Distributed Systems, 26, 1379\u20131392.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"523_CR26","doi-asserted-by":"publisher","unstructured":"Thapa, M., Espejo-Uribe, J., Pournaras, E. (2017). Measuring network reliability and repairability against cascading failures. Journal of Intelligent Information Systems. \n                    https:\/\/doi.org\/10.1007\/s10844-017-0477-0\n                    \n                  . Online First.","DOI":"10.1007\/s10844-017-0477-0"},{"key":"523_CR27","doi-asserted-by":"publisher","first-page":"5766","DOI":"10.1073\/pnas.082090499","volume":"99","author":"D Watts","year":"2002","unstructured":"Watts, D. (2002). A simple model of global cascades on random networks. Proceedings of the National Academy of Sciences of the United States of America, 99, 5766\u20135771.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"523_CR28","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou, C., Zhang, P., Zang, W., Guo, L. (2015). On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Transactions on Knowledge and Data Engineering, 27, 2770\u20132783.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-018-0523-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-018-0523-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-018-0523-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:45:15Z","timestamp":1589712315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-018-0523-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["523"],"URL":"https:\/\/doi.org\/10.1007\/s10844-018-0523-6","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,20]]},"assertion":[{"value":"15 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}