{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T02:19:47Z","timestamp":1775182787364,"version":"3.50.1"},"reference-count":38,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T00:00:00Z","timestamp":1554940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Social networks have attracted a lot of attention as novel information or advertisement diffusion media for viral marketing. Influence maximization describes the problem of finding a small subset of seed nodes in a social network that could maximize the spread of influence. A lot of algorithms have been proposed to solve this problem. Recently, in order to achieve more realistic viral marketing scenarios, some constrained versions of influence maximization, which consider time constraints, budget constraints and so on, have been proposed. However, none of them considers the memory effect and the social reinforcement effect, which are ubiquitous properties of social networks. In this paper, we define a new constrained version of the influence maximization problem that captures the social reinforcement and memory effects. We first propose a novel propagation model to capture the dynamics of the memory and social reinforcement effects. Then, we modify two baseline algorithms and design a new algorithm to solve the problem under the model. Experiments show that our algorithm achieves the best performance with relatively low time complexity. We also demonstrate that the new version captures some important properties of viral marketing in social networks, such as such as social reinforcements, and could explain some phenomena that cannot be explained by existing influence maximization problem definitions.<\/jats:p>","DOI":"10.3390\/fi11040095","type":"journal-article","created":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T03:46:37Z","timestamp":1555040797000},"page":"95","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Influence Maximization in Social Network Considering Memory Effect and Social Reinforcement Effect"],"prefix":"10.3390","volume":"11","author":[{"given":"Fei","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Information Science and Engineering, Shandong Normal University, Jinan 250357, China"}]},{"given":"Zhenfang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Information Science and Electrical Engineering, Shandong Jiaotong University, Jinan 250357, China"}]},{"given":"Peiyu","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Information Science and Engineering, Shandong Normal University, Jinan 250357, China"}]},{"given":"Peipei","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Accounting, Shandong Institute of Management, Jinan 250357, China"}]}],"member":"1968","published-online":{"date-parts":[[2019,4,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2054","DOI":"10.1016\/j.physleta.2016.04.025","article-title":"Effects of time-dependent diffusion behaviors on the rumor spreading in social networks","volume":"380","author":"Qiu","year":"2016","journal-title":"Phys. Lett. A"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.physa.2015.12.005","article-title":"Rumor spreading in online social networks by considering the bipolar social reinforcement","volume":"447","author":"Ma","year":"2016","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_3","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_4","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., and Tardos, E. (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_5","unstructured":"Chen, W., Lu, W., and Zhang, N. (2012, January 22\u201326). Time-critical influence maximization in social networks with time-delayed diffusion process. Proceedings of the Conference on Artificial Intelligence, Toronto, ON, Canada."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Liu, B., Cong, G., Xu, D., and Zeng, Y. (2012, January 10). Time constrained influence maximization in social networks. Proceedings of the IEEE 12th International Conference on Data Mining, Brussels, Belgium.","DOI":"10.1109\/ICDM.2012.158"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","article-title":"On budgeted influence maximization in social networks","volume":"31","author":"Nguyen","year":"2013","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1016\/j.cnsns.2013.08.028","article-title":"Information spreading on dynamic social networks","volume":"19","author":"Liu","year":"2014","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1140\/epjb\/e2015-60657-4","article-title":"Modern temporal network theory: A colloquium","volume":"88","author":"Holme","year":"2015","journal-title":"Eur. Phys. J. B"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"218701","DOI":"10.1103\/PhysRevLett.92.218701","article-title":"Universal behavior in a generalized model of contagion","volume":"92","author":"Dodds","year":"2014","journal-title":"Phys. Rev. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"123005","DOI":"10.1088\/1367-2630\/13\/12\/123005","article-title":"The small world yields the most effective information spreading","volume":"13","author":"Lu","year":"2011","journal-title":"New J. Phys."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1086\/209118","article-title":"Social ties and word-of-mouth referral behavior","volume":"14","author":"Brown","year":"1987","journal-title":"J. Consum. Res."},{"key":"ref_13","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_14","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_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TNET.2017.2691544","article-title":"A billion-scale approximation algorithm for maximizing benefit in viral marketing","volume":"25","author":"Nguyen","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_16","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, San Jose, CA, USA.","DOI":"10.1145\/1281192.1281239"},{"key":"ref_17","unstructured":"Goyal, A., Lu, W., and Lakshmanan, L. (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_18","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_19","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., and Wang, Y. (2010, January 25\u201328). Scalable influence maximization for prevalent viral marketing in large-scale social networks. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/1835804.1835934"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., and Zhang, L. (2010, January 13\u201317). Scalable influence maximization in social networks under the linear threshold model. Proceedings of the 10th IEEE International Conference on Data Mining, Sydney, Australia.","DOI":"10.1109\/ICDM.2010.118"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2532549","article-title":"Cim: Community-based influence maximization in social networks","volume":"5","author":"Chen","year":"2014","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Li, F., Li, C., and Shan, M. (2011, January 9\u201311). Labeled influence maximization in social networks for target marketing. Proceedings of the International Conference on Privacy, Security, Risk and Trust, 10th IEEE International Conference on Social Computing, Boston, MA, USA.","DOI":"10.1109\/PASSAT\/SocialCom.2011.152"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.14778\/2047485.2047492","article-title":"A data-based approach to social influence maximization","volume":"5","author":"Goyal","year":"2011","journal-title":"Proc. VLDB Endow."},{"key":"ref_24","unstructured":"Li, J., Cai, Z., Yan, M., and Li, Y. (2016, January 10\u201314). Using crowdsourced data in location-based social networks to explore influence maximization. Proceedings of the 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, USA."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wang, Y., Wei, W., and Yuan, Y. (2011, January 28\u201330). Influence maximization in social networks when negative opinions may emerge and propagate. Proceedings of the SDM, Mesa, AZ, USA.","DOI":"10.1137\/1.9781611972818.33"},{"key":"ref_26","unstructured":"Guo, J., Zhang, P., Zhou, C., Cao, Y., and Guo, L. (November, January 27). Personalized influence maximization on social networks. Proceedings of the 22nd ACM International Conference on Conference on Information & Knowledge Management, San Francisco, CA, USA."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.physa.2015.10.020","article-title":"Influence maximization in social networks under an independent cascade-based model","volume":"444","author":"Wang","year":"2016","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1007\/s13278-013-0143-7","article-title":"Discovering and validating influence in a dynamic online social network","volume":"3","author":"Laflin","year":"2013","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1515\/phys-2017-0083","article-title":"Lie algebraic discussion for affinity based information diffusion in social networks","volume":"15","author":"Shang","year":"2017","journal-title":"Open Phys."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Shang, Y. (2017). On the Delayed Scaled Consensus Problems. Appl. Sci., 7.","DOI":"10.3390\/app7070713"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Dubitzky, W., Wolkenhauer, O., Cho, K.H., and Yokota, H. (2013). NP-hard [M]. Encyclopedia of Systems Biology, Springer.","DOI":"10.1007\/978-1-4419-9863-7"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"2115","DOI":"10.1126\/science.287.5461.2115a","article-title":"Power-law distribution of the world wide web","volume":"287","author":"Adamic","year":"2000","journal-title":"Science"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"050501","DOI":"10.7498\/aps.64.050501","article-title":"An information-spreading model based on relative weight in social network","volume":"64","author":"Wang","year":"2015","journal-title":"Acta Phys. Sin."},{"key":"ref_34","unstructured":"(2019, March 10). Available online: http:\/\/twitter.com\/."},{"key":"ref_35","unstructured":"(2019, March 10). Available online: http:\/\/weibo.com\/."},{"key":"ref_36","unstructured":"(2019, March 10). Available online: http:\/\/www.epinions.com\/."},{"key":"ref_37","unstructured":"(2019, March 10). Available online: http:\/\/www.datatang.com\/."},{"key":"ref_38","unstructured":"(2019, March 10). Available online: http:\/\/www.nlpir.org\/."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/4\/95\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:44:45Z","timestamp":1760186685000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/4\/95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,11]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,4]]}},"alternative-id":["fi11040095"],"URL":"https:\/\/doi.org\/10.3390\/fi11040095","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,11]]}}}