{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:59:51Z","timestamp":1780675191284,"version":"3.54.1"},"reference-count":31,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T00:00:00Z","timestamp":1657152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61370083"],"award-info":[{"award-number":["61370083"]}]},{"name":"National Natural Science Foundation of China","award":["61672179"],"award-info":[{"award-number":["61672179"]}]},{"name":"National Natural Science Foundation of China","award":["61402126"],"award-info":[{"award-number":["61402126"]}]},{"name":"National Natural Science Foundation of China","award":["F2015030"],"award-info":[{"award-number":["F2015030"]}]},{"name":"National Natural Science Foundation of China","award":["QC2016083"],"award-info":[{"award-number":["QC2016083"]}]},{"name":"National Natural Science Foundation of China","award":["LBH-Z14071"],"award-info":[{"award-number":["LBH-Z14071"]}]},{"name":"National Natural Science Foundation of China","award":["LH2019F027"],"award-info":[{"award-number":["LH2019F027"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["61370083"],"award-info":[{"award-number":["61370083"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["61672179"],"award-info":[{"award-number":["61672179"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["61402126"],"award-info":[{"award-number":["61402126"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["F2015030"],"award-info":[{"award-number":["F2015030"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["QC2016083"],"award-info":[{"award-number":["QC2016083"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["LBH-Z14071"],"award-info":[{"award-number":["LBH-Z14071"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["LH2019F027"],"award-info":[{"award-number":["LH2019F027"]}]},{"name":"Youth Science Foundation of Heilongjiang Province of China","award":["61370083"],"award-info":[{"award-number":["61370083"]}]},{"name":"Youth Science Foundation of Heilongjiang Province of China","award":["61672179"],"award-info":[{"award-number":["61672179"]}]},{"name":"Youth Science Foundation of Heilongjiang Province of China","award":["61402126"],"award-info":[{"award-number":["61402126"]}]},{"name":"Youth Science Foundation of Heilongjiang Province of China","award":["F2015030"],"award-info":[{"award-number":["F2015030"]}]},{"name":"Youth Science Foundation of Heilongjiang Province of China","award":["QC2016083"],"award-info":[{"award-number":["QC2016083"]}]},{"name":"Youth Science Foundation of Heilongjiang Province of China","award":["LBH-Z14071"],"award-info":[{"award-number":["LBH-Z14071"]}]},{"name":"Youth Science Foundation of Heilongjiang Province of China","award":["LH2019F027"],"award-info":[{"award-number":["LH2019F027"]}]},{"name":"Postdoctoral Support of Heilongjiang Province of China","award":["61370083"],"award-info":[{"award-number":["61370083"]}]},{"name":"Postdoctoral Support of Heilongjiang Province of China","award":["61672179"],"award-info":[{"award-number":["61672179"]}]},{"name":"Postdoctoral Support of Heilongjiang Province of China","award":["61402126"],"award-info":[{"award-number":["61402126"]}]},{"name":"Postdoctoral Support of Heilongjiang Province of China","award":["F2015030"],"award-info":[{"award-number":["F2015030"]}]},{"name":"Postdoctoral Support of Heilongjiang Province of China","award":["QC2016083"],"award-info":[{"award-number":["QC2016083"]}]},{"name":"Postdoctoral Support of Heilongjiang Province of China","award":["LBH-Z14071"],"award-info":[{"award-number":["LBH-Z14071"]}]},{"name":"Postdoctoral Support of Heilongjiang Province of China","award":["LH2019F027"],"award-info":[{"award-number":["LH2019F027"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["61370083"],"award-info":[{"award-number":["61370083"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["61672179"],"award-info":[{"award-number":["61672179"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["61402126"],"award-info":[{"award-number":["61402126"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["F2015030"],"award-info":[{"award-number":["F2015030"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["QC2016083"],"award-info":[{"award-number":["QC2016083"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["LBH-Z14071"],"award-info":[{"award-number":["LBH-Z14071"]}]},{"name":"Heilongjiang Province Natural Science Foundation of China","award":["LH2019F027"],"award-info":[{"award-number":["LH2019F027"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The influence maximization problem is designed to seek a set of nodes in a social network so that the set has the maximum information propagation capacity on the network. In response to the inefficiency of existing greedy algorithms and the low accuracy of centrality-based heuristics, we propose an improved differential evolution algorithm (IDDE) based on the network discretization in this paper. The algorithm improves the variance rule of the differential evolution algorithm, takes the discrete number and discrete granularity of the remaining network after the removal of the target node as the index to evaluate the importance of the node, and proposes a fitness function based on the robustness of the network. The method embodies symmetry in two aspects. Firstly, the global connectivity among nodes in the network decreases as the number of target nodes removed in the social network increases. Secondly, the gain of global influence range gradually becomes smaller as the number of target nodes screened by the proposed method increases. We conducted comparison experiments on four real datasets of different sizes, and the results show that the IDDE algorithm outperforms the comparison algorithm.<\/jats:p>","DOI":"10.3390\/sym14071397","type":"journal-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T22:11:47Z","timestamp":1657231907000},"page":"1397","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Differential Evolutionary Influence Maximization Algorithm Based on Network Discreteness"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4954-6077","authenticated-orcid":false,"given":"Baojun","family":"Fu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China"},{"name":"College of Computer Science and Information Engineering, Harbin Normal University, Harbin 150025, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianpei","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjing","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Engineering, Harbin Normal University, Harbin 150025, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meijing","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Engineering, Harbin Normal University, Harbin 150025, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"He","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Engineering, Harbin Normal University, Harbin 150025, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiujin","family":"Mao","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Engineering, Harbin Normal University, Harbin 150025, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ins.2015.04.024","article-title":"Deprecation based greedy strategy for target set selection in large scale social networks","volume":"316","author":"Kundu","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Singh, S.S., Kumar, A., Mishra, S., Singh, K., and Biswas, B. (2019). Influence maximization in social networks. Appl. Soft Comput.","DOI":"10.1007\/978-3-030-28565-4_22"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.eswa.2019.02.007","article-title":"Groups make nodes powerful: Identifying influential nodes in social networks based on social conformity theory and community features","volume":"125","author":"Zhang","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Domingos, P., and Richardson, M. (2001, January 26\u201329). Mining the network value of customers. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/502512.502525"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Richardson, M., and Domingos, P. (2002, January 23). Mining knowledge-sharing sites for viral marketing. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Online Conference.","DOI":"10.1145\/775047.775057"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., and Tardos, \u00c9. (2003, January 24\u201327). Maximizing the spread of influence through a social network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/956750.956769"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., and Glance, N. (2007, January 12\u201315). Cost-effective outbreak detection in networks. Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, USA.","DOI":"10.1145\/1281192.1281239"},{"key":"ref_8","unstructured":"Goyal, A., Lu, W., and Lakshmanan, L.V. (April, January 28). Celf++ optimizing the greedy algorithm for influence maximization in social networks. Proceedings of the 20th International Conference Companion on World Wide Web, Hyderabad, India."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"ref_10","first-page":"238","article-title":"Ak-core based algorithm for influence maximization in social networks","volume":"38","author":"Cao","year":"2015","journal-title":"Chin. J. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1086\/421787","article-title":"Structural holes and good ideas","volume":"110","author":"Burt","year":"2004","journal-title":"Am. J. Sociol."},{"key":"ref_12","unstructured":"Jiang, Q., Song, G., Gao, C., Wang, Y., Si, W., and Xie, K. (2011, January 7\u201311). Simulated annealing based influence maximization in social networks. Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, San Francisco, CA, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","article-title":"DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks","volume":"103","author":"Cui","year":"2018","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","article-title":"Influence maximization in social networks based on discrete particle swarm optimization","volume":"367","author":"Gong","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_15","unstructured":"Chen, W., Wang, Y., and Yang, S. (July, January 28). Efficient influence maximization in social networks. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France."},{"key":"ref_16","unstructured":"Batagelj, V., and Zaversnik, M. (2003). An O (m) algorithm for cores decomposition of networks. arXiv."},{"key":"ref_17","first-page":"3101042","article-title":"A new discrete grid-based bacterial foraging optimizer to solve complex influence maximization of social networks","volume":"2021","author":"Zhang","year":"2021","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"ref_18","first-page":"72","article-title":"Key node identification algorithm for complex network based on improved grey wolf optimization","volume":"42","author":"Gu","year":"2021","journal-title":"J. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.jss.2012.11.027","article-title":"A computer virus spreading model based on resource limitations and interaction costs","volume":"86","author":"Huang","year":"2013","journal-title":"J. Syst. Softw."},{"key":"ref_20","first-page":"665","article-title":"Information cascades in complex networks","volume":"5","author":"Jalili","year":"2017","journal-title":"J. Complex Netw."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MCS.2015.2495000","article-title":"Analysis and control of epidemics: A survey of spreading processes on complex networks","volume":"36","author":"Nowzari","year":"2016","journal-title":"IEEE Control Syst. Mag."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","article-title":"Identifying influential nodes in complex networks","volume":"391","author":"Chen","year":"2012","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_23","first-page":"1","article-title":"Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata","volume":"9","author":"Goldenberg","year":"2001","journal-title":"Acad. Mark. Sci. Rev."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"111309","DOI":"10.1016\/j.chaos.2021.111309","article-title":"Identifying influential nodes in social networks: A voting approach","volume":"152","author":"Liu","year":"2021","journal-title":"Chaos Solitons Fractals"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","article-title":"A fast algorithm for finding most influential people based on the linear threshold model","volume":"42","author":"Rahimkhani","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/SURV.2013.070813.00214","article-title":"Smartphone malware and its propagation modeling: A survey","volume":"16","author":"Peng","year":"2013","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"124215","DOI":"10.1016\/j.physa.2020.124215","article-title":"Identifying influential nodes in social networks: Neighborhood coreness based voting approach","volume":"553","author":"Kumar","year":"2020","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Albert","year":"1999","journal-title":"Science"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Lai, Y.C., Motter, A.E., and Nishikawa, T. (2004). Attacks and cascades in complex networks. Complex Networks, Springer.","DOI":"10.1007\/978-3-540-44485-5_14"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"3838","DOI":"10.1073\/pnas.1009440108","article-title":"Mitigation of malicious attacks on networks","volume":"108","author":"Schneider","year":"2011","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/7\/1397\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:43:48Z","timestamp":1760139828000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/7\/1397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,7]]},"references-count":31,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["sym14071397"],"URL":"https:\/\/doi.org\/10.3390\/sym14071397","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,7]]}}}