{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T11:46:31Z","timestamp":1784029591835,"version":"3.55.0"},"reference-count":33,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"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":"Heilongjiang Province of China","award":["61370083"],"award-info":[{"award-number":["61370083"]}]},{"name":"Heilongjiang Province of China","award":["61672179"],"award-info":[{"award-number":["61672179"]}]},{"name":"Heilongjiang Province of China","award":["61402126"],"award-info":[{"award-number":["61402126"]}]},{"name":"Heilongjiang Province of China","award":["F2015030"],"award-info":[{"award-number":["F2015030"]}]},{"name":"Heilongjiang Province of China","award":["QC2016083"],"award-info":[{"award-number":["QC2016083"]}]},{"name":"Heilongjiang Province of China","award":["LBH-Z14071"],"award-info":[{"award-number":["LBH-Z14071"]}]},{"name":"Heilongjiang Province of China","award":["LH2019F027"],"award-info":[{"award-number":["LH2019F027"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["61370083"],"award-info":[{"award-number":["61370083"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["61672179"],"award-info":[{"award-number":["61672179"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["61402126"],"award-info":[{"award-number":["61402126"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["F2015030"],"award-info":[{"award-number":["F2015030"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["QC2016083"],"award-info":[{"award-number":["QC2016083"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["LBH-Z14071"],"award-info":[{"award-number":["LBH-Z14071"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["LH2019F027"],"award-info":[{"award-number":["LH2019F027"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The connection between users in social networks can be maintained for a certain period of time, and the static network structure formed provides the basic conditions for various kinds of research, especially for discovering customer groups that can generate great influence, which is important for product promotion, epidemic prevention and control, and public opinion supervision, etc. However, the computational process of influence maximization ignores the timeliness of interaction behaviors among users, the screened target users cannot diffuse information well, and the time complexity of relying on greedy rules to handle the influence maximization problem is high. Therefore, this paper analyzes the influence of the interaction between nodes in dynamic social networks on information dissemination, extends the classical independent cascade model to a dynamic social network dissemination model based on effective links, and proposes a two-stage influence maximization solution algorithm (Outdegree Effective Link\u2014OEL) based on node degree and effective links to enhance the efficiency of problem solving. In order to verify the effectiveness of the algorithm, five typical influence maximization methods are compared and analyzed on four real data sets. The results show that the OEL algorithm has good performance in propagation range and running time.<\/jats:p>","DOI":"10.3390\/e24070904","type":"journal-article","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T20:53:02Z","timestamp":1656622382000},"page":"904","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An Influence Maximization Algorithm for Dynamic Social Networks Based on Effective Links"],"prefix":"10.3390","volume":"24","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":"Hongna","family":"Bai","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Engineering, Harbin Normal University, Harbin 150025, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuting","family":"Yang","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"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"5-es","DOI":"10.1145\/1232722.1232727","article-title":"The dynamics of viral marketing","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Web"},{"key":"ref_2","unstructured":"Keller, E., and Berry, J. (2003). One American in Ten Tells the Other Nine How to Vote, Where to Eat, and What to Buy, The Free Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1011122126881","article-title":"Talk of the network: A complex systems look at the underlying process of word-of-mouth","volume":"12","author":"Goldenberg","year":"2001","journal-title":"Mark. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Domingos, P., and Richardson, M. (2001, January 26\u201329). Abstract mining the network value of customers. Proceedings of the KDD01: 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":"Kempe, D. (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, New York, NY, USA.","DOI":"10.1145\/956750.956769"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Van Briesen, 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 (KDD \u201807), San Jose, CA, USA.","DOI":"10.1145\/1281192.1281239"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2017.10.018","article-title":"A hierarchical approach for influential node ranking in complex social networks","volume":"93","author":"Zareie","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"043109","DOI":"10.1063\/1.5030894","article-title":"Identifying influential nodes in complex networks: A node information dimension approach","volume":"28","author":"Bian","year":"2018","journal-title":"Chaos"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.ins.2019.10.003","article-title":"Identification of influencers in complex networks by local information dimensionality","volume":"512","author":"Wen","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"122926","DOI":"10.1016\/j.physa.2019.122926","article-title":"Identifying critical nodes in metro network considering topological potential: A case study in Shenzhen city\u2014China","volume":"539","author":"Du","year":"2020","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"22194","DOI":"10.1038\/s41598-021-01218-1","article-title":"Identifying influential spreaders in complex networks by an improved gravity model","volume":"11","author":"Li","year":"2021","journal-title":"Sci. Rep."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"ref_13","first-page":"35","article-title":"Betweenness in time dependent networks","volume":"72","author":"Alsayed","year":"2015","journal-title":"Chaos Solitons Fractals Interdiscip. J. Nonlinear Sci. Nonequilibrium Complex Phenom."},{"key":"ref_14","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_15","first-page":"3419","article-title":"Influence maximization algorithm based on structure hole and degree discount","volume":"38","author":"Li","year":"2018","journal-title":"J. Comput. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"109637","DOI":"10.1016\/j.chaos.2020.109637","article-title":"Identifying influential nodes in complex networks from global perspective","volume":"133","author":"Zhao","year":"2020","journal-title":"Chaos Solitons Fractals"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"168901","DOI":"10.7498\/aps.65.168901","article-title":"An efficient node influence metric based on triangle in complex networks","volume":"65","author":"Han","year":"2016","journal-title":"Acta Phys. Sin."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"211281","DOI":"10.1109\/ACCESS.2020.3038791","article-title":"A Re-Ranking Algorithm for Identifying Influential Nodes in Complex Networks","volume":"8","author":"Yu","year":"2020","journal-title":"IEEE Access"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.physa.2019.01.136","article-title":"A novel measure of identifying influential nodes in complex networks","volume":"523","author":"Lv","year":"2019","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TCSS.2020.3032616","article-title":"Time-constrained adaptive influence maximization","volume":"8","author":"Tong","year":"2020","journal-title":"IEEE Trans. Comput. Soc."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Liu, B., Cong, G., Xu, D., and Zeng, Y. (2012, January 10\u201313). Time Constrained Influence Maximization in Social Networks. Proceedings of the 2012 IEEE 12th International Conference on Data Mining, Brussels, Belgium.","DOI":"10.1109\/ICDM.2012.158"},{"key":"ref_22","unstructured":"Wei, C., Wei, L., and Ning, Z. (2012). Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process, AAAI Press."},{"key":"ref_23","first-page":"8","article-title":"Influence diffusion model based on affinity of dynamic social networks","volume":"37","author":"Chen","year":"2016","journal-title":"J. Commun."},{"key":"ref_24","unstructured":"An-Biao, W.U., Yuan, Y., Qiao, B.Y., Wang, Y.S., Yu-Liang, M.A., and Wang, G.R. (2019). The influence maximization problem based on large-scale temporal graph. Chin. J. Comput."},{"key":"ref_25","first-page":"11","article-title":"Research on social network influence maximization algorithm based on time sequential relationship","volume":"41","author":"Chen","year":"2020","journal-title":"J. Commun."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"050201","DOI":"10.7498\/aps.66.050201","article-title":"Evaluation method of node importance in directed-weighted complex network based on multiple influence matrix","volume":"66","author":"Wang","year":"2017","journal-title":"Acta Phys. Sin."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2691","DOI":"10.1038\/s41598-020-59616-w","article-title":"Identifying vital nodes in complex networks by adjacency information entropy","volume":"10","author":"Xu","year":"2020","journal-title":"Sci. Rep."},{"key":"ref_28","unstructured":"Wang, D., Wen, Z., Tong, H., Lin, C.Y., Song, C., and Barab\u00e1si, A.L. (April, January 28). Information spreading in context. Proceedings of the 20th International Conference on World Wide Web (WWW \u201911), Hyderabad, India."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Goel, S., Watts, D.J., and Goldstein, D.G. (2012, January 4\u20138). The Structure of Online Diffusion Networks. Proceedings of the 13th ACM Conference on Electronic Commerce, Valencia, Spain.","DOI":"10.1145\/2229012.2229058"},{"key":"ref_30","unstructured":"Cao, J.X., Wu, J.L., Shi, W., Liu, B., and Luo, J.Z. (2014). Sina microblog information diffusion analysis and prediction. Chin. J. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"38002","DOI":"10.1209\/0295-5075\/82\/38002","article-title":"Disease spreading in populations of moving agents","volume":"82","author":"Buscarino","year":"2008","journal-title":"EPL (Europhys. Lett.)"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/TSMC.2016.2531690","article-title":"Using Node Centrality and Optimal Control to Maximize Information Diffusion in Social Networks","volume":"47","author":"Kandhway","year":"2016","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_33","unstructured":"Chen, W., Wang, Y., and Yang, S. (July, January 28). Efficient influence maximization in social networks. Proceedings of the ACM Sigkdd International Conference on Knowledge Discovery & Data Mining, Paris, France."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/904\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:40:59Z","timestamp":1760139659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,30]]},"references-count":33,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["e24070904"],"URL":"https:\/\/doi.org\/10.3390\/e24070904","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,30]]}}}