{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T19:44:26Z","timestamp":1773949466332,"version":"3.50.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T00:00:00Z","timestamp":1644192000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T00:00:00Z","timestamp":1644192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["No.lzujbky-2020-6"],"award-info":[{"award-number":["No.lzujbky-2020-6"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Project of Gansu Province","award":["No.18YF1FA132"],"award-info":[{"award-number":["No.18YF1FA132"]}]},{"name":"Lanzhou Science and Technology Project Funding","award":["No.2019-4-47"],"award-info":[{"award-number":["No.2019-4-47"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10489-021-03021-x","type":"journal-article","created":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T01:02:25Z","timestamp":1644195745000},"page":"12497-12515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["An efficient discrete differential evolution algorithm based on community structure for influence maximization"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7683-2589","authenticated-orcid":false,"given":"Huan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruisheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,7]]},"reference":[{"issue":"3","key":"3021_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1086\/209118","volume":"14","author":"JJ Brown","year":"1987","unstructured":"Brown JJ, Reingen PH (1987) Social Ties and Word-of-Mouth Referral Behavior*. J Consum Res 14(3):350\u2013362. https:\/\/doi.org\/10.1086\/209118, https:\/\/academic.oup.com\/jcr\/article-pdf\/14\/3\/350\/5151897\/14-3-350.pdf","journal-title":"J Consum Res"},{"key":"3021_CR2","doi-asserted-by":"publisher","unstructured":"Leskovec J, Adamic LA, Huberman BA (2006) The dynamics of viral marketing. In: Proceedings of the 7th ACM Conference on Electronic Commerce. EC \u201906. https:\/\/doi.org\/10.1145\/1134707.1134732. Association for Computing Machinery, New York, NY, USA, p 228?237","DOI":"10.1145\/1134707.1134732"},{"key":"3021_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jnca.2018.01.005","volume":"106","author":"S Peng","year":"2018","unstructured":"Peng S, Zhou Y, Cao L, Yu S, Niu J, Jia W (2018) Influence analysis in social networks: A survey. J Netw Comput Appl 106:17\u201332. https:\/\/doi.org\/10.1016\/j.jnca.2018.01.005","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"3021_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.techfore.2011.06.003","volume":"79","author":"Y Cho","year":"2012","unstructured":"Cho Y, Hwang J, Lee D (2012) Identification of effective opinion leaders in the diffusion of technological innovation: A social network approach. Technol Forecast Soc Chang 79(1):97\u2013106. https:\/\/doi.org\/10.1016\/j.techfore.2011.06.003","journal-title":"Technol Forecast Soc Chang"},{"key":"3021_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.knosys.2013.01.005","volume":"43","author":"Y Li","year":"2013","unstructured":"Li Y, Ma S, Zhang Y, Huang R, Kinshuk (2013) An improved mix framework for opinion leader identification in online learning communities. Knowl-Based Syst 43:43\u201351. https:\/\/doi.org\/10.1016\/j.knosys.2013.01.005","journal-title":"Knowl-Based Syst"},{"key":"3021_CR6","doi-asserted-by":"publisher","unstructured":"Lee J-R, Chung C-W (2014) A fast approximation for influence maximization in large social networks. In: Proceedings of the 23rd International Conference on World Wide Web. WWW \u201914 Companion. https:\/\/doi.org\/10.1145\/2567948.2580063. Association for Computing Machinery, New York, NY, USA, pp 1157\u20131162","DOI":"10.1145\/2567948.2580063"},{"issue":"8","key":"3021_CR7","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1109\/TKDE.2013.106","volume":"26","author":"B Liu","year":"2014","unstructured":"Liu B, Cong G, Zeng Y, Xu D, Chee YM (2014) Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans Knowl Data Eng 26 (8):1904\u20131917. https:\/\/doi.org\/10.1109\/TKDE.2013.106","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3021_CR8","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD 01. Association for Computing Machinery, New York, NY, USA, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"3021_CR9","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 Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD 03. Association for Computing Machinery, New York, NY, USA, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"3021_CR10","doi-asserted-by":"publisher","first-page":"112905","DOI":"10.1016\/j.eswa.2019.112905","volume":"140","author":"MM Keikha","year":"2020","unstructured":"Keikha MM, Rahgozar M, Asadpour M, Abdollahi MF (2020) Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Syst Appl 140:112905. https:\/\/doi.org\/10.1016\/j.eswa.2019.112905, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417419306232","journal-title":"Expert Syst Appl"},{"key":"3021_CR11","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"3021_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi A, Samet S, Kwisthout J, Wareham T (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl-Based Syst 134:149\u2013158. https:\/\/doi.org\/10.1016\/j.knosys.2017.07.029","journal-title":"Knowl-Based Syst"},{"key":"3021_CR13","doi-asserted-by":"publisher","first-page":"44221","DOI":"10.1109\/ACCESS.2018.2864240","volume":"6","author":"H Wu","year":"2018","unstructured":"Wu H, Shang J, Zhou S, Feng Y, Qiang B, Xie W (2018) Laim: A linear time iterative approach for efficient influence maximization in large-scale networks. IEEE Access 6:44221\u201344234. https:\/\/doi.org\/10.1109\/ACCESS.2018.2864240","journal-title":"IEEE Access"},{"key":"3021_CR14","doi-asserted-by":"publisher","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201915. https:\/\/doi.org\/10.1145\/2723372.2723734. Association for Computing Machinery, New York, NY, USA, p 1539?1554","DOI":"10.1145\/2723372.2723734"},{"key":"3021_CR15","doi-asserted-by":"publisher","first-page":"141083","DOI":"10.1109\/ACCESS.2019.2943412","volume":"7","author":"H Li","year":"2019","unstructured":"Li H, Zhang R, Zhao Z, Yuan Y (2019) An efficient influence maximization algorithm based on clique in social networks. IEEE Access 7:141083\u2013141093. https:\/\/doi.org\/10.1109\/ACCESS.2019.2943412","journal-title":"IEEE Access"},{"issue":"12","key":"3021_CR16","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman M EJ (2002) Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12):7821\u20137826. https:\/\/doi.org\/10.1073\/pnas.122653799, https:\/\/www.pnas.org\/content\/99\/12\/7821.full.pdf","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"7043","key":"3021_CR17","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818. https:\/\/doi.org\/10.1038\/nature03607","journal-title":"Nature"},{"key":"3021_CR18","doi-asserted-by":"publisher","first-page":"056102","DOI":"10.1103\/PhysRevE.79.056102","volume":"79","author":"A Galstyan","year":"2009","unstructured":"Galstyan A, Musoyan V, Cohen P (2009) Maximizing influence propagation in networks with community structure. Physical review. E, Statistical, nonlinear, and soft matter physics 79:056102. https:\/\/doi.org\/10.1103\/PhysRevE.79.056102","journal-title":"Physical review. E, Statistical, nonlinear, and soft matter physics"},{"key":"3021_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Vanbriesen J, Glance N (2007) Cost-effective outbreak detection in networks, vol 420-429, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"3021_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) Celf++: Optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web. WWW 11. Association for Computing Machinery, New York, NY, USA, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"3021_CR21","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD 09. Association for Computing Machinery, New York, NY, USA, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"3021_CR22","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: Solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management. CIKM 13. Association for Computing Machinery, New York, NY, USA, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"3021_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.physa.2014.10.088","volume":"420","author":"M Heidari","year":"2015","unstructured":"Heidari M, Asadpour M, Faili H (2015) Smg: Fast scalable greedy algorithm for influence maximization in social networks. Physica A: Statistical Mechanics and its Applications 420:124\u2013133. https:\/\/doi.org\/10.1016\/j.physa.2014.10.088","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"C","key":"3021_CR24","doi-asserted-by":"publisher","first-page":"143?154","DOI":"10.1016\/j.knosys.2016.09.020","volume":"113","author":"W-X Lu","year":"2016","unstructured":"Lu W-X, Zhou C, Wu J (2016) Big social network influence maximization via recursively estimating influence spread. Know.-Based Syst. 113(C):143?154. https:\/\/doi.org\/10.1016\/j.knosys.2016.09.020","journal-title":"Know.-Based Syst."},{"issue":"3","key":"3021_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Networks 1 (3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Soc Networks"},{"key":"3021_CR26","doi-asserted-by":"publisher","first-page":"056103","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada E, Rodr\u00edguez-Vel\u00e1zquez JA (2005) Subgraph centrality in complex networks. Phys. Rev. E 71:056103. https:\/\/doi.org\/10.1103\/PhysRevE.71.056103","journal-title":"Phys. Rev. E"},{"issue":"1","key":"3021_CR27","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(1):107\u2013117. https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X. Proceedings of the Seventh International World Wide Web Conference","journal-title":"Computer Networks and ISDN Systems"},{"key":"3021_CR28","doi-asserted-by":"crossref","unstructured":"Kundu S, Murthy CA, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: Kuznetsov SO, Mandal DP, Kundu MK, Pal SK (eds) Pattern Recognition and Machine Intelligence. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 242\u2013247","DOI":"10.1007\/978-3-642-21786-9_40"},{"issue":"4","key":"3021_CR29","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s11277-016-3939-8","volume":"93","author":"D-L Nguyen","year":"2017","unstructured":"Nguyen D-L, Nguyen T-H, Do T-H, Yoo M (2017) Probability-based multi-hop diffusion method for influence maximization in social networks. Wirel Pers Commun 93(4):903\u2013916. https:\/\/doi.org\/10.1007\/s11277-016-3939-8","journal-title":"Wirel Pers Commun"},{"key":"3021_CR30","doi-asserted-by":"crossref","unstructured":"Luo Z-L, Cai W-D, Li Y-J, Peng D (2012) A pagerank-based heuristic algorithm for influence maximization in the social network. In: Gaol FL (ed) Recent Progress in Data Engineering and Internet Technology. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 485\u2013490","DOI":"10.1007\/978-3-642-28798-5_65"},{"key":"3021_CR31","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","volume":"451","author":"L ling Ma","year":"2016","unstructured":"ling Ma L, Ma C, Zhang H-F, Wang B-H (2016) Identifying influential spreaders in complex networks based on gravity formula. Physica A: Statistical Mechanics and its Applications 451:205\u2013212. https:\/\/doi.org\/10.1016\/j.physa.2015.12.162, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437116000959","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"3021_CR32","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 Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 14. Society for Industrial and Applied Mathematics, USA, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"3021_CR33","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. SIGMOD 14. Association for Computing Machinery, New York, NY, USA, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"3021_CR34","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 the 2016 International Conference on Management of Data. SIGMOD 16. Association for Computing Machinery, New York, NY, USA, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"key":"3021_CR35","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (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. CIKM 14. Association for Computing Machinery, New York, NY, USA, pp 629\u2013638","DOI":"10.1145\/2661829.2662077"},{"issue":"2","key":"3021_CR36","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TKDE.2016.2624734","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang X, Zhang Y, Zhang W, Lin X, Chen C (2017) Bring order into the samples: A novel scalable method for influence maximization. IEEE Trans Knowl Data Eng 29(2):243\u2013256. https:\/\/doi.org\/10.1109\/TKDE.2016.2624734","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"23","key":"3021_CR37","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman M EJ (2006) Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103(23):8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"3021_CR38","doi-asserted-by":"crossref","unstructured":"Lin S, Hu Q, Wang G, Yu PS (2015) Understanding community effects on information diffusion. In: Cao T, Lim E-P, Zhou Z-H, Ho T-B, Cheung D, Motoda H (eds) Advances in Knowledge Discovery and Data Mining. Springer International Publishing, Cham, pp 82\u201395","DOI":"10.1007\/978-3-319-18038-0_7"},{"key":"3021_CR39","doi-asserted-by":"publisher","unstructured":"Cao T, Wu X, Wang S, Hu X (2010) Oasnet: An optimal allocation approach to influence maximization in modular social networks. In: Proceedings of the 2010 ACM Symposium on Applied Computing. SAC \u201910. https:\/\/doi.org\/10.1145\/1774088.1774314. Association for Computing Machinery, New York, NY, USA, pp 1088\u20131094","DOI":"10.1145\/1774088.1774314"},{"key":"3021_CR40","doi-asserted-by":"publisher","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201910. https:\/\/doi.org\/10.1145\/1835804.1835935. Association for Computing Machinery, New York, NY, USA, pp 1039\u20131048","DOI":"10.1145\/1835804.1835935"},{"issue":"5","key":"3021_CR41","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(5):1379\u20131392. https:\/\/doi.org\/10.1109\/TPDS.2014.2320515","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"3021_CR42","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.knosys.2013.01.017","volume":"42","author":"X Zhang","year":"2013","unstructured":"Zhang X, Zhu J, Wang Q, Zhao H (2013) Identifying influential nodes in complex networks with community structure. Knowl-Based Syst 42:74\u201384. https:\/\/doi.org\/10.1016\/j.knosys.2013.01.017, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705113000294","journal-title":"Knowl-Based Syst"},{"key":"3021_CR43","doi-asserted-by":"publisher","unstructured":"Chen Y-C, Zhu W-Y, Peng W-C, Lee W-C, Lee S-Y (2014s) Cim: Community-based influence maximization in social networks. ACM Trans. Intell. Syst. Technol., 5(2), https:\/\/doi.org\/10.1145\/2532549","DOI":"10.1145\/2532549"},{"key":"3021_CR44","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: A community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88\u2013100. https:\/\/doi.org\/10.1016\/j.knosys.2016.09.029, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705116303598. Volume, Variety and Velocity in Data Science","journal-title":"Knowl-Based Syst"},{"key":"3021_CR45","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.physa.2018.08.045","volume":"512","author":"J Shang","year":"2018","unstructured":"Shang J, Wu H, Zhou S, Zhong J, Feng Y, Qiang B (2018) Impc: Influence maximization based on multi-neighbor potential in community networks. Physica A: Statistical Mechanics and its Applications 512:1085\u20131103. https:\/\/doi.org\/10.1016\/j.physa.2018.08.045, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437118309786","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"3021_CR46","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence. AAAI\u201911. AAAI Press, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"3021_CR47","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367-368","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B, Ma L, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367-368:600\u2013614. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S002002551630500X","journal-title":"Inf Sci"},{"key":"3021_CR48","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2018","unstructured":"Cui L, Hu H, Yu S, Yan Q, Ming Z, Wen Z, Lu N (2018) Ddse: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119\u2013130. https:\/\/doi.org\/10.1016\/j.jnca.2017.12.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1084804517303995","journal-title":"J Netw Comput Appl"},{"key":"3021_CR49","doi-asserted-by":"publisher","first-page":"112971","DOI":"10.1016\/j.eswa.2019.112971","volume":"142","author":"A Zareie","year":"2020","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971. https:\/\/doi.org\/10.1016\/j.eswa.2019.112971, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S095741741930689X","journal-title":"Expert Syst Appl"},{"issue":"13","key":"3021_CR50","doi-asserted-by":"publisher","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","volume":"24","author":"SS Singh","year":"2020","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2020) Aco-im: maximizing influence in social networks using ant colony optimization. Soft Comput 24(13):10181\u201310203. https:\/\/doi.org\/10.1007\/s00500-019-04533-y","journal-title":"Soft Comput"},{"key":"3021_CR51","doi-asserted-by":"publisher","first-page":"105606","DOI":"10.1016\/j.asoc.2019.105606","volume":"83","author":"L Ma","year":"2019","unstructured":"Ma L, Liu Y (2019) Maximizing three-hop influence spread in social networks using discrete comprehensive learning artificial bee colony optimizer. Appl Soft Comput 83:105606. https:\/\/doi.org\/10.1016\/j.asoc.2019.105606, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494619303862","journal-title":"Appl Soft Comput"},{"key":"3021_CR52","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","volume":"160","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R, Yao Y, Zhao Z, Wang P, Li H, Yuan J (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl-Based Syst 160:88\u2013103. https:\/\/doi.org\/10.1016\/j.knosys.2018.06.013, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705118303423","journal-title":"Knowl-Based Syst"},{"key":"3021_CR53","doi-asserted-by":"publisher","first-page":"104833","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P, Zhao Z, Fan L, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl-Based Syst 187:104833. https:\/\/doi.org\/10.1016\/j.knosys.2019.07.004, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705119303089","journal-title":"Knowl-Based Syst"},{"key":"3021_CR54","doi-asserted-by":"publisher","unstructured":"Li H, Zhang R, Zhao Z, Liu X, Yuan Y (2021) Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization. Appl Intell, https:\/\/doi.org\/10.1007\/s10489-021-02283-9","DOI":"10.1007\/s10489-021-02283-9"},{"key":"3021_CR55","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","volume":"278","author":"T Zhu","year":"2014","unstructured":"Zhu T, Wang B, Wu B, Zhu C (2014) Maximizing the spread of influence ranking in social networks. Inf Sci 278:535\u2013544. https:\/\/doi.org\/10.1016\/j.ins.2014.03.070, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025514003612","journal-title":"Inf Sci"},{"key":"3021_CR56","unstructured":"Christakis NA, Fowler JH (2009) Connected: The surprising power of our social networks and how they shape our lives. Little, Brown"},{"issue":"1","key":"3021_CR57","doi-asserted-by":"publisher","first-page":"5547","DOI":"10.1038\/srep05547","volume":"4","author":"S Pei","year":"2014","unstructured":"Pei S, Muchnik L, Andrade JJS, Zheng Z, Makse HA (2014) Searching for superspreaders of information in real-world social media. Scientific Reports 4(1):5547. https:\/\/doi.org\/10.1038\/srep05547","journal-title":"Scientific Reports"},{"key":"3021_CR58","doi-asserted-by":"publisher","unstructured":"Li H, Zhang R, Zhao Z, Liu X (2021) Lpa-mni: An improved label propagation algorithm based on modularity and node importance for community detection. Entropy, 23(5), https:\/\/doi.org\/10.3390\/e23050497, https:\/\/www.mdpi.com\/1099-4300\/23\/5\/497","DOI":"10.3390\/e23050497"},{"issue":"10","key":"3021_CR59","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008 (10):P10008. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/p10008","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"8","key":"3021_CR60","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1108\/k.1998.27.8.979.4","volume":"27","author":"J Galletly","year":"1998","unstructured":"Galletly J (1998) Evolutionary algorithms in theory and practice: Evolution strategies, evolutionary programming, genetic algorithms. Kybernetes 27(8):979\u2013980. https:\/\/doi.org\/10.1108\/k.1998.27.8.979.4","journal-title":"Kybernetes"},{"key":"3021_CR61","doi-asserted-by":"publisher","first-page":"417","DOI":"10.3233\/ICA-200641","volume":"27","author":"Y Liang","year":"2020","unstructured":"Liang Y, He F, Zeng X (2020) 3d mesh simplification with feature preservation based on whale optimization algorithm and differential evolution. Integrated Computer-Aided Engineering 27:417\u2013435. https:\/\/doi.org\/10.3233\/ICA-200641","journal-title":"Integrated Computer-Aided Engineering"},{"key":"3021_CR62","doi-asserted-by":"publisher","first-page":"106335","DOI":"10.1016\/j.asoc.2020.106335","volume":"93","author":"Y Chen","year":"2020","unstructured":"Chen Y, He F, Li H, Zhang D, Wu Y (2020) A full migration bbo algorithm with enhanced population quality bounds for multimodal biomedical image registration. Appl Soft Comput 93:106335. https:\/\/doi.org\/10.1016\/j.asoc.2020.106335, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494620302751","journal-title":"Appl Soft Comput"},{"issue":"1","key":"3021_CR63","doi-asserted-by":"publisher","first-page":"31","DOI":"10.3233\/ICA-150499","volume":"23","author":"DJ Zhang","year":"2016","unstructured":"Zhang DJ, He FZ, Han SH, Li XX (2016) Quantitative optimization of interoperability during feature-based data exchange. Integrated Computer-Aided Engineering 23(1):31\u201350. https:\/\/doi.org\/10.3233\/ICA-150499","journal-title":"Integrated Computer-Aided Engineering"},{"issue":"1","key":"3021_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12293-021-00328-7","volume":"13","author":"H Li","year":"2021","unstructured":"Li H, He F, Chen Y, Pan Y (2021) Mlfs-ccde: multi-objective large-scale feature selection by cooperative coevolutionary differential evolution. Memetic Computing 13 (1):1\u201318. https:\/\/doi.org\/10.1007\/s12293-021-00328-7","journal-title":"Memetic Computing"},{"issue":"4","key":"3021_CR65","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Glob Optim"},{"key":"3021_CR66","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ins.2020.11.015","volume":"549","author":"X Xia","year":"2021","unstructured":"Xia X, Gui L, Zhang Y, Xu X, Yu F, Wu H, Wei B, He G, Li Y, Li K (2021) A fitness-based adaptive differential evolution algorithm. Inf Sci 549:116\u2013141. https:\/\/doi.org\/10.1016\/j.ins.2020.11.015, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025520311014","journal-title":"Inf Sci"},{"key":"3021_CR67","doi-asserted-by":"publisher","first-page":"113033","DOI":"10.1016\/j.eswa.2019.113033","volume":"162","author":"KM Sallam","year":"2020","unstructured":"Sallam KM, Elsayed SM, Sarker RA, Essam DL (2020) Landscape-assisted multi-operator differential evolution for solving constrained optimization problems. Expert Syst Appl 162:113033. https:\/\/doi.org\/10.1016\/j.eswa.2019.113033, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S095741741930750X","journal-title":"Expert Syst Appl"},{"issue":"2","key":"3021_CR68","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1016\/j.asoc.2010.04.024","volume":"11","author":"R Mallipeddi","year":"2011","unstructured":"Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11(2):1679\u20131696. https:\/\/doi.org\/10.1016\/j.asoc.2010.04.024, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494610001043, The Impact of Soft Computing for the Progress of Artificial Intelligence","journal-title":"Appl Soft Comput"},{"issue":"1","key":"3021_CR69","doi-asserted-by":"publisher","first-page":"17261","DOI":"10.1038\/s41598-020-74228-0","volume":"10","author":"S Hassan","year":"2020","unstructured":"Hassan S, Hemeida AM, Alkhalaf S, Mohamed A-A, Senjyu T (2020) Multi-variant differential evolution algorithm for feature selection. Scientific Reports 10(1):17261. https:\/\/doi.org\/10.1038\/s41598-020-74228-0","journal-title":"Scientific Reports"},{"issue":"22","key":"3021_CR70","doi-asserted-by":"publisher","first-page":"11557","DOI":"10.1007\/s00500-018-03697-3","volume":"23","author":"S Majumder","year":"2019","unstructured":"Majumder S, Kar S, Pal T (2019) Uncertain multi-objective chinese postman problem. Soft Comput 23(22):11557\u201311572. https:\/\/doi.org\/10.1007\/s00500-018-03697-3","journal-title":"Soft Comput"},{"issue":"12","key":"3021_CR71","doi-asserted-by":"publisher","first-page":"4367","DOI":"10.1007\/s00500-018-3094-0","volume":"23","author":"MB Kar","year":"2019","unstructured":"Kar MB, Kar S, Guo S, Li X, Majumder S (2019) A new bi-objective fuzzy portfolio selection model and its solution through evolutionary algorithms. Soft Comput 23(12):4367\u20134381. https:\/\/doi.org\/10.1007\/s00500-018-3094-0","journal-title":"Soft Comput"},{"key":"3021_CR72","doi-asserted-by":"publisher","first-page":"102","DOI":"10.3389\/fbuil.2020.00102","volume":"6","author":"M Georgioudakis","year":"2020","unstructured":"Georgioudakis M, Plevris V (2020) A comparative study of differential evolution variants in constrained structural optimization. Frontiers in Built Environment 6:102. https:\/\/doi.org\/10.3389\/fbuil.2020.00102, https:\/\/www.frontiersin.org\/article\/10.3389\/fbuil.2020.00102","journal-title":"Frontiers in Built Environment"},{"issue":"4","key":"3021_CR73","doi-asserted-by":"publisher","first-page":"e12264","DOI":"10.1111\/exsy.12264","volume":"35","author":"S Majumder","year":"2018","unstructured":"Majumder S, Saha B, Anand P, Kar S, Pal T (2018) Uncertainty based genetic algorithm with varying population for random fuzzy maximum flow problem. Expert Syst 35 (4):e12264. https:\/\/doi.org\/10.1111\/exsy.12264, https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1111\/exsy.12264, e12264 EXSY-May-17-097.R1","journal-title":"Expert Syst"},{"key":"3021_CR74","doi-asserted-by":"publisher","first-page":"43330","DOI":"10.1038\/srep43330","volume":"7","author":"D Liu","year":"2017","unstructured":"Liu D, Jing Y, Zhao J, Wang W, Song G (2017) A fast and efficient algorithm for mining top-k nodes in complex networks. Scientific reports 7:43330. https:\/\/doi.org\/10.1038\/srep43330, https:\/\/europepmc.org\/articles\/PMC5327405","journal-title":"Scientific reports"},{"issue":"6","key":"3021_CR75","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2008) A study on the use of non-parametric tests for analyzing the evolutionary algorithms? behaviour: a case study on the cec 2005 special session on real parameter optimization. J Heuristics 15(6):617. https:\/\/doi.org\/10.1007\/s10732-008-9080-4","journal-title":"J Heuristics"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-03021-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-03021-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-03021-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T01:10:45Z","timestamp":1666314645000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-03021-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,7]]},"references-count":75,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["3021"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-03021-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,7]]},"assertion":[{"value":"15 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}