{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:01:02Z","timestamp":1775228462029,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62173236"],"award-info":[{"award-number":["62173236"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61803269"],"award-info":[{"award-number":["61803269"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876110"],"award-info":[{"award-number":["61876110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806130"],"award-info":[{"award-number":["61806130"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976142"],"award-info":[{"award-number":["61976142"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1713212"],"award-info":[{"award-number":["U1713212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072315"],"award-info":[{"award-number":["62072315"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61836005"],"award-info":[{"award-number":["61836005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2020A1515010790"],"award-info":[{"award-number":["2020A1515010790"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Technology Research Project of Shenzhen City","award":["JCYJ20190808174801673"],"award-info":[{"award-number":["JCYJ20190808174801673"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tetci.2021.3136643","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T20:32:23Z","timestamp":1642105943000},"page":"995-1009","source":"Crossref","is-referenced-by-count":57,"title":["Influence Maximization in Complex Networks by Using Evolutionary Deep Reinforcement Learning"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1201-8051","authenticated-orcid":false,"given":"Lijia","family":"Ma","sequence":"first","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China"}]},{"given":"Zengyang","family":"Shao","sequence":"additional","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China"}]},{"given":"Xiaocong","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2415-0401","authenticated-orcid":false,"given":"Qiuzhen","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2208-962X","authenticated-orcid":false,"given":"Jianqiang","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3529-2640","authenticated-orcid":false,"given":"Victor C. M.","family":"Leung","sequence":"additional","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6248-2875","authenticated-orcid":false,"given":"Asoke K.","family":"Nandi","sequence":"additional","affiliation":[{"name":"Department of Electronic and Electrical Engineering, Brunel University London, Uxbridge, U.K."}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.10.029"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.125584"},{"key":"ref15","first-page":"47","article-title":"Celf optimizing the greedy algorithm for influence maximization in social networks","author":"goyal","year":"0","journal-title":"Proc 20th Int Conf Companion World Wide Web"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8204"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2458037"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/s12911-020-01281-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2009033117"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.41"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2020.3031057"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2947421"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.asoc.2014.02.003","article-title":"Multi-level learning based memetic algorithm for community detection","volume":"19","author":"ma","year":"2014","journal-title":"Appl Soft Comput"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2020.3035937"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2260862"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2860284"},{"key":"ref44","first-page":"2619","article-title":"A novel Bayesian similarity measure for recommender systems","volume":"13","author":"guo","year":"0","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525903001067"},{"key":"ref49","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.70.056122","article-title":"Models of social networks based on social distance attachment","volume":"70","author":"bogun\u00e1","year":"2004","journal-title":"Phys Rev E"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2016.2572538"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3201\/eid2606.200357"},{"key":"ref4","first-page":"266","article-title":"Scalable and parallelizable processing of influence maximization for large-scale social networks","author":"kim","year":"0","journal-title":"Proc IEEE 29th Int Conf Data Eng"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956769"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature14604"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016118"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref37","first-page":"693","article-title":"HOGWILD!: A lock-free approach to parallelizing stochastic gradient descent","volume":"24","author":"niu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-020-0177-2"},{"key":"ref30","article-title":"DISCO: Influence maximization meets network embedding and deep learning","author":"li","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2580063"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2015.2398353"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"girvan","year":"0","journal-title":"Proc Nat Acad Sci"},{"key":"ref38","first-page":"1188","article-title":"Evolution-guided policy gradient in reinforcement learning","volume":"31","author":"khadka","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2017.12.003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.038"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3064828"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2917059"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3003047"},{"key":"ref22","first-page":"600","article-title":"Influence maximization in social networks based on discrete particle swarm optimization","volume":"367","author":"gong","year":"2020","journal-title":"Inf Sci"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3015387"},{"key":"ref28","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"khalil","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2664665"},{"key":"ref29","first-page":"20000","article-title":"GCOMB: Learning budget-constrained combinatorial algorithms over billion-sized graphs","volume":"33","author":"manchanda","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/10190085\/09679820.pdf?arnumber=9679820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T18:30:54Z","timestamp":1691433054000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9679820\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":52,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2021.3136643","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}