{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:36:49Z","timestamp":1775266609535,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T00:00:00Z","timestamp":1583971200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T00:00:00Z","timestamp":1583971200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s13042-020-01104-8","type":"journal-article","created":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T17:02:56Z","timestamp":1584032576000},"page":"2101-2111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A novel learning-based approach for efficient dismantling of networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Changjun","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanghe","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangquan","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jincai","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,12]]},"reference":[{"issue":"1","key":"1104_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"issue":"6","key":"1104_CR2","doi-asserted-by":"publisher","first-page":"062,115","DOI":"10.1103\/PhysRevE.87.062115","volume":"87","author":"F Altarelli","year":"2013","unstructured":"Altarelli F, Braunstein A, Dall\u2019Asta L, Zecchina R (2013) Large deviations of cascade processes on graphs. Phys Rev E 87(6):062,115","journal-title":"Phys Rev E"},{"issue":"09","key":"1104_CR3","doi-asserted-by":"publisher","first-page":"P09,011","DOI":"10.1088\/1742-5468\/2013\/09\/P09011","volume":"2013","author":"F Altarelli","year":"2013","unstructured":"Altarelli F, Braunstein A, Dall\u2019Asta L, Zecchina R (2013) Optimizing spread dynamics on graphs by message passing. J Stat Mech Theory Exp 2013(09):P09,011","journal-title":"J Stat Mech Theory Exp"},{"issue":"5439","key":"1104_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"6","key":"1104_CR5","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22(6):725\u2013730","journal-title":"J Acoust Soc Am"},{"key":"1104_CR6","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940"},{"issue":"44","key":"1104_CR7","doi-asserted-by":"publisher","first-page":"12368","DOI":"10.1073\/pnas.1605083113","volume":"113","author":"A Braunstein","year":"2016","unstructured":"Braunstein A, Dall\u2019Asta L, Semerjian G, Zdeborov\u00e1 L (2016) Network dismantling. Proc Natl Acad Sci 113(44):12368\u201312373","journal-title":"Proc Natl Acad Sci"},{"issue":"1\u20137","key":"1104_CR8","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. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"issue":"20","key":"1104_CR9","doi-asserted-by":"publisher","first-page":"208,301","DOI":"10.1103\/PhysRevLett.117.208301","volume":"117","author":"P Clusella","year":"2016","unstructured":"Clusella P, Grassberger P, P\u00e9rez-Reche FJ, Politi A (2016) Immunization and targeted destruction of networks using explosive percolation. Phys Rev Lett 117(20):208,301","journal-title":"Phys Rev Lett"},{"issue":"16","key":"1104_CR10","doi-asserted-by":"publisher","first-page":"3682","DOI":"10.1103\/PhysRevLett.86.3682","volume":"86","author":"R Cohen","year":"2001","unstructured":"Cohen R, Erez K, Ben-Avraham D, Havlin S (2001) Breakdown of the internet under intentional attack. Phys Rev Lett 86(16):3682","journal-title":"Phys Rev Lett"},{"key":"1104_CR11","unstructured":"Dai H, Dai B, Song L (2016) Discriminative embeddings of latent variable models for structured data. In: International conference on machine learning, pp 2702\u20132711"},{"key":"1104_CR12","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.physa.2016.11.097","volume":"469","author":"C Fan","year":"2017","unstructured":"Fan C, Liu Z, Lu X, Xiu B, Chen Q (2017) An efficient link prediction index for complex military organization. Physica A Stat Mech Appl 469:572\u2013587","journal-title":"Physica A Stat Mech Appl"},{"key":"1104_CR13","unstructured":"Fan C, Sun Y, Zeng L, Liu YY, Chen M, Liu Z (2019) Dismantle large networks through deep reinforcement learning. In: ICLR representation learning on graphs and manifolds workshop"},{"key":"1104_CR14","doi-asserted-by":"crossref","unstructured":"Fan C, Xiao K, Xiu B, Lv G (2014) A fuzzy clustering algorithm to detect criminals without prior information. In: Proceedings of the 2014 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 238\u2013243. IEEE Press","DOI":"10.1109\/ASONAM.2014.6921590"},{"key":"1104_CR15","doi-asserted-by":"crossref","unstructured":"Fan C, Zeng L, Ding Y, Chen M, Sun Y, Liu Z (2019) Learning to identify high betweenness centrality nodes from scratch: A novel graph neural network approach. arXiv:1905.10418","DOI":"10.1145\/3357384.3357979"},{"key":"1104_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35\u201341","journal-title":"Sociometry"},{"key":"1104_CR17","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in neural information processing systems, pp 1024\u20131034"},{"key":"1104_CR18","doi-asserted-by":"crossref","unstructured":"Hessel M, Modayil J, Van\u00a0Hasselt H, Schaul T, Ostrovski G, Dabney W, Horgan D, Piot B, Azar M, Silver D (2018) Rainbow: combining improvements in deep reinforcement learning. In: Thirty-Second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v33i01.33013796"},{"issue":"2","key":"1104_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1017\/S0963548307008802","volume":"17","author":"S Janson","year":"2008","unstructured":"Janson S, Thomason A (2008) Dismantling sparse random graphs. Comb Probab Comput 17(2):259\u2013264","journal-title":"Comb Probab Comput"},{"key":"1104_CR20","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) 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","DOI":"10.1145\/956750.956769"},{"key":"1104_CR21","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. In: Advances in neural information processing systems, pp 6348\u20136358"},{"key":"1104_CR22","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343\u20131350. ACM","DOI":"10.1145\/2487788.2488173"},{"issue":"1","key":"1104_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1","key":"1104_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"1104_CR25","unstructured":"Li Z, Chen Q, Koltun V (2018) Combinatorial optimization with graph convolutional networks and guided tree search. In: Advances in neural information processing systems, pp 539\u2013548"},{"key":"1104_CR26","unstructured":"Ma Z, Li M, Wang Y (2019) Pan: Path integral based convolution for deep graph neural networks"},{"issue":"7540","key":"1104_CR27","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G et al (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529","journal-title":"Nature"},{"issue":"7563","key":"1104_CR28","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone F, Makse HA (2015) Influence maximization in complex networks through optimal percolation. Nature 524(7563):65","journal-title":"Nature"},{"issue":"1","key":"1104_CR29","doi-asserted-by":"publisher","first-page":"012,305","DOI":"10.1103\/PhysRevE.94.012305","volume":"94","author":"S Mugisha","year":"2016","unstructured":"Mugisha S, Zhou HJ (2016) Identifying optimal targets of network attack by belief propagation. Phys Rev E 94(1):012,305","journal-title":"Phys Rev E"},{"issue":"14","key":"1104_CR30","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras R, Vespignani A (2001) Epidemic spreading in scale-free networks. Phys Rev Lett 86(14):3200","journal-title":"Phys Rev Lett"},{"key":"1104_CR31","doi-asserted-by":"crossref","unstructured":"Ren XL, Gleinig N, Helbing D, Antulov-Fantulin N (2019) Generalized network dismantling. In: Proceedings of the national academy of sciences, p 201806108","DOI":"10.1073\/pnas.1806108116"},{"issue":"10","key":"1104_CR32","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1073\/pnas.1009440108","volume":"108","author":"CM Schneider","year":"2011","unstructured":"Schneider CM, Moreira AA, Andrade JS, Havlin S, Herrmann HJ (2011) Mitigation of malicious attacks on networks. Proc Natl Acad Sci 108(10):3838\u20133841","journal-title":"Proc Natl Acad Sci"},{"key":"1104_CR33","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction. MIT Press, Cambridge"},{"key":"1104_CR34","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2018) Graph attention networks. In: ICLR"},{"key":"1104_CR35","doi-asserted-by":"publisher","first-page":"37,954","DOI":"10.1038\/srep37954","volume":"6","author":"L Zdeborov\u00e1","year":"2016","unstructured":"Zdeborov\u00e1 L, Zhang P, Zhou HJ (2016) Fast and simple decycling and dismantling of networks. Sci Rep 6:37,954","journal-title":"Sci Rep"},{"issue":"11","key":"1104_CR36","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1140\/epjb\/e2013-40690-1","volume":"86","author":"HJ Zhou","year":"2013","unstructured":"Zhou HJ (2013) Spin glass approach to the feedback vertex set problem. Eur Phys J B 86(11):455","journal-title":"Eur Phys J B"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01104-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-020-01104-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01104-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T00:34:02Z","timestamp":1615509242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-020-01104-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,12]]},"references-count":36,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1104"],"URL":"https:\/\/doi.org\/10.1007\/s13042-020-01104-8","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,12]]},"assertion":[{"value":"18 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}