{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:04:35Z","timestamp":1770746675396,"version":"3.49.0"},"reference-count":242,"publisher":"Maximum Academic Press","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"unspecified","delay-in-days":387,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The information deployment on social networks through word-of-mouth spreading by online users has contributed well to forming opinions, social groups, and connections. This process of information deployment is known as information diffusion. Its process and models play a significant role in social network analysis. Seeing this importance, the present paper focuses on the process, model, deployment, and applications of information diffusion analysis. First, this article discusses the background of the diffusion process, such as process, components, and models. Next, information deployment in social networks and their application have been discussed. A comparative analysis of literature corresponding to applications like influence maximization, link prediction, and community detection is presented. A brief description of performative evaluation metrics is illustrated. Current research challenges and the future direction of information diffusion analysis regarding social network applications have been discussed. In addition, some open problems of information diffusion for social network analysis are also presented.<\/jats:p>","DOI":"10.1017\/s0269888924000109","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T21:25:26Z","timestamp":1737494726000},"update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":5,"title":["Information diffusion analysis: process, model, deployment, and application"],"prefix":"10.48130","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-2258","authenticated-orcid":false,"given":"Shashank Sheshar","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3114-7737","authenticated-orcid":false,"given":"Divya","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhushi","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samya","family":"Muhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"S0269888924000109_ref48","doi-asserted-by":"publisher","DOI":"10.1186\/s13040-021-00244-z"},{"key":"S0269888924000109_ref194","doi-asserted-by":"publisher","DOI":"10.1145\/3539732"},{"key":"S0269888924000109_ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"S0269888924000109_ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-013-0489-0"},{"key":"S0269888924000109_ref75","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.121269"},{"key":"S0269888924000109_ref109","doi-asserted-by":"publisher","DOI":"10.1007\/11871637_27"},{"key":"S0269888924000109_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124368"},{"key":"S0269888924000109_ref132","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.06.026"},{"key":"S0269888924000109_ref160","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"S0269888924000109_ref107","doi-asserted-by":"publisher","DOI":"10.1108\/10662240410530862"},{"key":"S0269888924000109_ref101","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_91"},{"key":"S0269888924000109_ref110","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"S0269888924000109_ref178","unstructured":"Scholz, C. , Atzmueller, M. , Barrat, A. , Cattuto, C. & Stumme, G. 2013. New insights and methods for predicting face-to-face contacts. In Seventh International AAAI Conference on Weblogs and Social Media."},{"key":"S0269888924000109_ref204","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2879648"},{"key":"S0269888924000109_ref102","first-page":"33","article-title":"Contributions to the mathematical theory of epidemics\u2013i","volume":"53","author":"Kermack","year":"1991","journal-title":"Bulletin of Mathematical Biology"},{"key":"S0269888924000109_ref208","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2787757"},{"key":"S0269888924000109_ref216","first-page":"1473","article-title":"Modelling on opinion leader\u2019s influence in microblog message propagation and its application","volume":"26","author":"Wang","year":"2015","journal-title":"Journal of Software"},{"key":"S0269888924000109_ref224","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3015896"},{"key":"S0269888924000109_ref219","doi-asserted-by":"crossref","unstructured":"Wang, Q. , Gong, M. , Song, C. & Wang, S. 2017. Discrete particle swarm optimization based influence maximization in complex networks. In 2017 IEEE Congress on Evolutionary Computation (CEC), 488\u2013494.","DOI":"10.1109\/CEC.2017.7969351"},{"key":"S0269888924000109_ref247","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2419659"},{"key":"S0269888924000109_ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3091106"},{"key":"S0269888924000109_ref200","doi-asserted-by":"publisher","DOI":"10.1002\/asi.23931"},{"key":"S0269888924000109_ref230","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"S0269888924000109_ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.33"},{"key":"S0269888924000109_ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106413"},{"key":"S0269888924000109_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2014.01.003"},{"key":"S0269888924000109_ref232","doi-asserted-by":"crossref","unstructured":"Xu, T. , Zhu, H. , Zhao, X. , Liu, Q. , Zhong, H. , Chen, E. & Xiong, H. 2016. Taxi driving behavior analysis in latent vehicle-to-vehicle networks: A social influence perspective. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1285\u20131294.","DOI":"10.1145\/2939672.2939799"},{"key":"S0269888924000109_ref119","unstructured":"Lei, S. , Maniu, S. , Mo, L. , Cheng, R. & Senellart, P. 2015. Online influence maximization (extended version). CoRR abs\/1506.01188. http:\/\/arxiv.org\/abs\/1506.01188"},{"key":"S0269888924000109_ref124","doi-asserted-by":"publisher","DOI":"10.1145\/2187980.2188126"},{"key":"S0269888924000109_ref222","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03348-3_34"},{"key":"S0269888924000109_ref217","unstructured":"Wang, C. , Huang, P. , Yang, D. & Chen, W. 2016. Cross-layer design of influence maximization in mobile social networks. CoRR abs\/1604.02796. http:\/\/arxiv.org\/abs\/1604.02796"},{"key":"S0269888924000109_ref118","doi-asserted-by":"crossref","unstructured":"Lee, W. , Kim, J. & Yu, H. 2012. Ct-ic: Continuously activated and time-restricted independent cascade model for viral marketing. In 2012 IEEE 12th International Conference on Data Mining, 960\u2013965.","DOI":"10.1109\/ICDM.2012.40"},{"key":"S0269888924000109_ref201","first-page":"137","article-title":"Unique user identification across multiple social network","volume":"8","author":"Suganya","year":"2017","journal-title":"International Journal of Research in Marketing"},{"key":"S0269888924000109_ref144","doi-asserted-by":"publisher","DOI":"10.1016\/j.mbs.2014.02.001"},{"key":"S0269888924000109_ref213","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2892096"},{"key":"S0269888924000109_ref158","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"S0269888924000109_ref233","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.167"},{"key":"S0269888924000109_ref169","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2019.08.008"},{"key":"S0269888924000109_ref137","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662009"},{"key":"S0269888924000109_ref218","first-page":"1","article-title":"Link prediction in social networks: The state-of-the-art","volume":"58","author":"Wang","year":"2015","journal-title":"Science China Information Sciences"},{"key":"S0269888924000109_ref167","doi-asserted-by":"publisher","DOI":"10.1108\/08858621111112285"},{"key":"S0269888924000109_ref104","doi-asserted-by":"crossref","unstructured":"Kermack, W. O. & McKendrick, A. G. 1932. Contributions to the mathematical theory of epidemics. ii.\u2013the problem of endemicity. Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character 138(834), 55\u201383.","DOI":"10.1098\/rspa.1932.0171"},{"key":"S0269888924000109_ref212","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2563397"},{"key":"S0269888924000109_ref44","doi-asserted-by":"crossref","unstructured":"Chen, W. , Yuan, Y. & Zhang, L. 2010. Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE International Conference on Data Mining, 88\u201397.","DOI":"10.1109\/ICDM.2010.118"},{"key":"S0269888924000109_ref76","unstructured":"Gomez-Rodriguez, M. , Balduzzi, D. & Sch\u00f6lkopf, B. 2011. Uncovering the temporal dynamics of diffusion networks. CoRR abs\/1105.0697. http:\/\/arxiv.org\/abs\/1105.0697"},{"key":"S0269888924000109_ref81","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"S0269888924000109_ref90","doi-asserted-by":"publisher","DOI":"10.1080\/13691180801946150"},{"key":"S0269888924000109_ref73","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"S0269888924000109_ref120","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.026120"},{"key":"S0269888924000109_ref202","doi-asserted-by":"publisher","DOI":"10.1145\/2857546.2857591"},{"key":"S0269888924000109_ref221","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"S0269888924000109_ref88","doi-asserted-by":"crossref","unstructured":"Hajibagheri, A. , Hamzeh, A. & Sukthankar, G. 2013. Modeling information diffusion and community membership using stochastic optimization. In Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, 175\u2013182.","DOI":"10.1145\/2492517.2492545"},{"key":"S0269888924000109_ref74","first-page":"1","article-title":"Mullere","volume":"66","author":"GoldenbergJ","year":"2002","journal-title":"Ridingthe Saddle: How Cross-marketcommunicationscan Createa Majorslumpinsales"},{"key":"S0269888924000109_ref18","doi-asserted-by":"crossref","unstructured":"Backstrom, L. & Leskovec, J. 2011. Supervised random walks: Predicting and recommending links in social networks. In Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, 635\u2013644.","DOI":"10.1145\/1935826.1935914"},{"key":"S0269888924000109_ref69","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882929"},{"key":"S0269888924000109_ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-019-00065-z"},{"key":"S0269888924000109_ref32","doi-asserted-by":"crossref","unstructured":"Cao, Z. , Wang, L. & De Melo, G. 2018. Link prediction via subgraph embedding-based convex matrix completion. In Proceedings of the AAAI Conference on Artificial Intelligence, 32.","DOI":"10.1609\/aaai.v32i1.11655"},{"key":"S0269888924000109_ref41","unstructured":"Chen, W. , Lu, W. & Zhang, N. 2012. Time-critical influence maximization in social networks with time-delayed diffusion process."},{"key":"S0269888924000109_ref165","doi-asserted-by":"crossref","unstructured":"Pecli, A. , Giovanini, B. , Pacheco, C. C. , Moreira, C. , Ferreira, F. , Tosta, F. , Tesolin, J. , Dias, M. V. , Lima Filho, S. P. , Cavalcanti, M. C. et al. 2015. Dimensionality reduction for supervised learning in link prediction problems. In ICEIS (1), 295\u2013302.","DOI":"10.5220\/0005371802950302"},{"key":"S0269888924000109_ref203","doi-asserted-by":"publisher","DOI":"10.3390\/e22040425"},{"key":"S0269888924000109_ref159","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2906081"},{"key":"S0269888924000109_ref186","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.09.142"},{"key":"S0269888924000109_ref146","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915250"},{"key":"S0269888924000109_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"S0269888924000109_ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"S0269888924000109_ref182","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26190-4_27"},{"key":"S0269888924000109_ref30","doi-asserted-by":"publisher","DOI":"10.1177\/1043463195007002005"},{"key":"S0269888924000109_ref225","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.01.025"},{"key":"S0269888924000109_ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2014.6921567"},{"key":"S0269888924000109_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-7834-2_26"},{"key":"S0269888924000109_ref64","first-page":"1","article-title":"Computationally efficient link prediction in a variety of social networks","volume":"5","author":"Fire","year":"2014","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"S0269888924000109_ref153","doi-asserted-by":"publisher","DOI":"10.1109\/ASIANCON51346.2021.9544803"},{"key":"S0269888924000109_ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"S0269888924000109_ref67","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"S0269888924000109_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100393"},{"key":"S0269888924000109_ref24","doi-asserted-by":"publisher","DOI":"10.2307\/25148755"},{"key":"S0269888924000109_ref111","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2813262"},{"key":"S0269888924000109_ref58","first-page":"43","article-title":"Networks, crowds, and markets: Reasoning about a highly connected world","volume":"9","author":"Easley","year":"2012","journal-title":"Significance"},{"key":"S0269888924000109_ref93","unstructured":"He, X. & Kempe, D. 2016. Robust influence maximization. CoRR abs\/1602.05240. http:\/\/arxiv.org\/abs\/1602.05240"},{"key":"S0269888924000109_ref96","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"S0269888924000109_ref98","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.8"},{"key":"S0269888924000109_ref128","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063721"},{"key":"S0269888924000109_ref185","first-page":"578","article-title":"Improved link prediction using pca","volume":"17","author":"Singh","year":"2019","journal-title":"International Journal of Analysis and Applications"},{"key":"S0269888924000109_ref191","first-page":"1","article-title":"Aco-im: Maximizing influence in social networks using ant colony optimization","author":"Singh","year":"2019","journal-title":"Soft Computing"},{"key":"S0269888924000109_ref238","doi-asserted-by":"crossref","unstructured":"Yin, D. , Hong, L. & Davison, B. D. 2011. Structural link analysis and prediction in microblogs. In Proceedings of the 20th ACM International Conference on Information and Knowledge Management, 1163\u20131168.","DOI":"10.1145\/2063576.2063743"},{"key":"S0269888924000109_ref100","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"S0269888924000109_ref156","doi-asserted-by":"crossref","unstructured":"Nguyen, D. T. , Das, S. & Thai, M. T. 2013. Influence maximization in multiple online social networks. In 2013 IEEE Global Communications Conference (GLOBECOM), 3060\u20133065.","DOI":"10.1109\/GLOCOM.2013.6831541"},{"key":"S0269888924000109_ref68","first-page":"73","article-title":"Dimensionality reduction for supervised learning with reproducing kernel hilbert spaces","volume":"5","author":"Fukumizu","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"S0269888924000109_ref141","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.145"},{"key":"S0269888924000109_ref236","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.04.102"},{"key":"S0269888924000109_ref138","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2637898"},{"key":"S0269888924000109_ref195","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108821"},{"key":"S0269888924000109_ref130","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.01.040"},{"key":"S0269888924000109_ref198","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9167"},{"key":"S0269888924000109_ref121","doi-asserted-by":"crossref","unstructured":"Leskovec, J. , Adamic, L. & Huberman, B. A. 2007. The dynamics of viral marketing. In Proceedings of the 7th ACM Conference on Electronic Commerce, 228\u2013237.","DOI":"10.1145\/1134707.1134732"},{"key":"S0269888924000109_ref249","doi-asserted-by":"crossref","unstructured":"Zhuang, H. , Sun, Y. , Tang, J. , Zhang, J. & Sun, X. 2013. Influence maximization in dynamic social networks. In 2013 IEEE 13th International Conference on Data Mining, 1313\u20131318.","DOI":"10.1109\/ICDM.2013.145"},{"key":"S0269888924000109_ref108","doi-asserted-by":"crossref","unstructured":"Kim, J. , Kim, S. K. & Yu, H. 2013. Scalable and parallelizable processing of influence maximization for large-scale social networks? In 2013 IEEE 29th International Conference on Data Engineering (ICDE), 266\u2013277.","DOI":"10.1109\/ICDE.2013.6544831"},{"key":"S0269888924000109_ref99","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"S0269888924000109_ref94","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2313024"},{"key":"S0269888924000109_ref143","doi-asserted-by":"publisher","DOI":"10.2307\/3104547"},{"key":"S0269888924000109_ref78","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"S0269888924000109_ref227","first-page":"7102","article-title":"Nonparametric network models for link prediction","volume":"17","author":"Williamson","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"S0269888924000109_ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2017.7926114"},{"key":"S0269888924000109_ref229","first-page":"2678","article-title":"Mining algorithm of microblogging opinion leaders based on user-behavior network","volume":"32","author":"Wu","year":"2015","journal-title":"Applied Computing and Informatics"},{"key":"S0269888924000109_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.029"},{"key":"S0269888924000109_ref237","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.06.051"},{"key":"S0269888924000109_ref126","first-page":"1","article-title":"Exploiting information diffusion feature for link prediction in sina weibo","volume":"6","author":"Li","year":"2016","journal-title":"Scientific Reports"},{"key":"S0269888924000109_ref133","unstructured":"Li, Y. , Chen, W. , Wang, Y. & Zhang, Z. 2011. Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. CoRR abs\/1111.4729. http:\/\/arxiv.org\/abs\/1111.4729"},{"key":"S0269888924000109_ref177","volume-title":"Micromotives and Macrobehavior","author":"Schelling","year":"2006"},{"key":"S0269888924000109_ref244","unstructured":"Zhang, Y. 2015. Influence maximization on multi-phased multi-layered network."},{"key":"S0269888924000109_ref245","doi-asserted-by":"crossref","unstructured":"Zhang, Y. , Lyu, T. & Zhang, Y. 2018. Cosine: Community-preserving social network embedding from information diffusion cascades. In Proceedings of the AAAI Conference on Artificial Intelligence, 32.","DOI":"10.1609\/aaai.v32i1.11856"},{"key":"S0269888924000109_ref10","unstructured":"Al Hasan, M. , Chaoji, V. , Salem, S. & Zaki, M. 2006. Link prediction using supervised learning. In SDM06: Workshop on Link Analysis, Counter-Terrorism and Security, 30, 798\u2013805."},{"key":"S0269888924000109_ref19","doi-asserted-by":"crossref","unstructured":"Barbieri, N. , Bonchi, F. & Manco, G. 2012. Topic-aware social influence propagation models. In 2012 IEEE 12th International Conference on Data Mining, 81\u201390.","DOI":"10.1109\/ICDM.2012.122"},{"key":"S0269888924000109_ref131","first-page":"1","article-title":"Similarity-based future common neighbors model for link prediction in complex networks","volume":"8","author":"Li","year":"2018","journal-title":"Scientific Reports"},{"key":"S0269888924000109_ref125","first-page":"1","article-title":"Polarity related influence maximization in signed social networks","volume":"9","author":"Li","year":"2014","journal-title":"PLOS ONE"},{"key":"S0269888924000109_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33486-3_30"},{"key":"S0269888924000109_ref39","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2011.6019714"},{"key":"S0269888924000109_ref193","doi-asserted-by":"crossref","unstructured":"Singh, S. S. , Singh, K. , Kumar, A. , Shakya, H. K. & Biswas, B. 2019. A survey on information diffusion models in social networks. In Advanced Informatics for Computing Research, Luhach, A. K. , Singh, D. , Hsiung, P.-A. , Hawari, K. B. G. , Lingras, P. & Singh, P. K. (eds). Springer Singapore, 426\u2013439.","DOI":"10.1007\/978-981-13-3143-5_35"},{"key":"S0269888924000109_ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CONIT51480.2021.9498401"},{"key":"S0269888924000109_ref129","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452415"},{"key":"S0269888924000109_ref86","unstructured":"Guo, Y. , Huang, Z. , Kong, Y. & Wang, Q. 2021. Modularity and mutual information in networks: Two sides of the same coin. arXiv preprint arXiv:2103.02542."},{"key":"S0269888924000109_ref71","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.43"},{"key":"S0269888924000109_ref135","unstructured":"Lin, T. Y. , Ohsuga, S. , Liau, C.-J. & Hu, X. 2005. Foundations and Novel Approaches in Data Mining, 9. Springer Science & Business Media."},{"key":"S0269888924000109_ref70","doi-asserted-by":"crossref","unstructured":"Ge, H. , Huang, J. , Di, C. , Li, J. & Li, S. 2017. Learning automata based approach for influence maximization problem on social networks. In 2017 IEEE Second International Conference on Data Science in Cyberspace (DSC), 108\u2013117.","DOI":"10.1109\/DSC.2017.54"},{"key":"S0269888924000109_ref114","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124289"},{"key":"S0269888924000109_ref228","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.205"},{"key":"S0269888924000109_ref235","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0789-0"},{"key":"S0269888924000109_ref123","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"S0269888924000109_ref50","unstructured":"Cohen, E. , Delling, D. , Pajor, T. & Werneck, R. F. 2014. Sketch-based influence maximization and computation: Scaling up with guarantees. CoRR abs\/1408.6282. http:\/\/arxiv.org\/abs\/1408.6282"},{"key":"S0269888924000109_ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-019-00743-1"},{"key":"S0269888924000109_ref139","doi-asserted-by":"crossref","unstructured":"Loeliger, H.-A. , Dauwels, J. , Hu, J. , Korl, S. , Ping, L. & Kschischang, F. R. 2007. The factor graph approach to model-based signal processing. Proceedings of the IEEE 95(6), 1295\u20131322.","DOI":"10.1109\/JPROC.2007.896497"},{"key":"S0269888924000109_ref116","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21786-9_40"},{"key":"S0269888924000109_ref148","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2022.101606"},{"key":"S0269888924000109_ref248","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806462"},{"key":"S0269888924000109_ref105","doi-asserted-by":"crossref","unstructured":"Khan, A. , Zehnder, B. & Kossmann, D. 2016. Revenue maximization by viral marketing: A social network host\u2019s perspective. In 2016 IEEE 32nd International Conference on Data Engineering (ICDE), 37\u201348.","DOI":"10.1109\/ICDE.2016.7498227"},{"key":"S0269888924000109_ref234","doi-asserted-by":"crossref","unstructured":"Yang, W. , Brenner, L. & Giua, A. 2018. Influence maximization by link activation in social networks. In 2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA), 1, 1248\u20131251.","DOI":"10.1109\/ETFA.2018.8502577"},{"key":"S0269888924000109_ref242","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-019-0601-0"},{"key":"S0269888924000109_ref136","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.106"},{"key":"S0269888924000109_ref122","doi-asserted-by":"crossref","unstructured":"Leskovec, J. , Huttenlocher, D. & Kleinberg, J. 2010. Predicting positive and negative links in online social networks. In Proceedings of the 19th International Conference on World Wide Web, 641\u2013650.","DOI":"10.1145\/1772690.1772756"},{"key":"S0269888924000109_ref61","unstructured":"Erlandsson, F. , Br\u00f3dka, P. & Borg, A. 2017. Seed selection for information cascade in multilayer networks. CoRR abs\/1710.04391. http:\/\/arxiv.org\/abs\/1710.04391"},{"key":"S0269888924000109_ref72","doi-asserted-by":"crossref","unstructured":"Girvan, M. & Newman, M. E. 2002. Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821\u20137826.","DOI":"10.1073\/pnas.122653799"},{"key":"S0269888924000109_ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"S0269888924000109_ref239","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18038-0_5"},{"key":"S0269888924000109_ref215","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.003"},{"key":"S0269888924000109_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-019-0618-2"},{"key":"S0269888924000109_ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1282100.1282167"},{"key":"S0269888924000109_ref180","doi-asserted-by":"publisher","DOI":"10.1109\/NETWKS.2012.6381684"},{"key":"S0269888924000109_ref188","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5421"},{"key":"S0269888924000109_ref243","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8835"},{"key":"S0269888924000109_ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-018-1124-0"},{"key":"S0269888924000109_ref161","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994525"},{"key":"S0269888924000109_ref210","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"S0269888924000109_ref157","doi-asserted-by":"crossref","unstructured":"Nguyen, H. T. , Dinh, T. N. & Thai, M. T. 2016. Cost-aware targeted viral marketing in billion-scale networks. In IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, 1\u20139.","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"S0269888924000109_ref231","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0717-8"},{"key":"S0269888924000109_ref174","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85567-5_9"},{"key":"S0269888924000109_ref184","first-page":"7570","article-title":"Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study","volume":"34","author":"Sheshar","year":"2021","journal-title":"Journal of King Saud University-Computer and Information Sciences"},{"key":"S0269888924000109_ref45","unstructured":"Cheng, S. , Shen, H. , Huang, J. , Chen, W. & Cheng, X. 2014. Imrank: Influence maximization via finding self-consistent ranking. CoRR abs\/1402.3939. http:\/\/arxiv.org\/abs\/1402.3939"},{"key":"S0269888924000109_ref51","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu115"},{"key":"S0269888924000109_ref106","doi-asserted-by":"crossref","unstructured":"Khelil, A. , Becker, C. , Tian, J. & Rothermel, K. 2002. An epidemic model for information diffusion in manets. In Proceedings of the 5th ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems, 54\u201360.","DOI":"10.1145\/570758.570768"},{"key":"S0269888924000109_ref149","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2023.11.021"},{"key":"S0269888924000109_ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"S0269888924000109_ref26","unstructured":"Bo, C. , Tang, X.-y. , Ling, Y. & LIU, Y.-s. 2014. Identifying method for opinion leaders in social network based on competency model. Journal on Communications 35(11), 12."},{"key":"S0269888924000109_ref211","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"S0269888924000109_ref77","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.012"},{"key":"S0269888924000109_ref226","doi-asserted-by":"publisher","DOI":"10.1002\/aepp.13004"},{"key":"S0269888924000109_ref80","doi-asserted-by":"publisher","DOI":"10.1086\/226707"},{"key":"S0269888924000109_ref145","doi-asserted-by":"publisher","DOI":"10.1007\/s13235-012-0055-6"},{"key":"S0269888924000109_ref82","first-page":"337","article-title":"Introduction of shared electronic records: Multi-site case study using diffusion of innovation theory","author":"Greenhalgh","year":"2008","journal-title":"BMJ"},{"key":"S0269888924000109_ref223","doi-asserted-by":"crossref","unstructured":"Wang, Y. , Zhu, J. & Ming, Q. 2017. Incremental influence maximization for dynamic social networks. In Data Science, Zou, B. , Han, Q. , Sun, G. , Jing, W. , Peng, X. & Lu, Z. (eds). Springer Singapore, 13\u201327.","DOI":"10.1007\/978-981-10-6388-6_2"},{"key":"S0269888924000109_ref134","doi-asserted-by":"crossref","unstructured":"Li, Y. , Zhang, D. & Tan, K.-L. 2015. Real-time targeted influence maximization for online advertisements. Proceedings of the VLDB Endowment 8(10), 1070\u20131081.","DOI":"10.14778\/2794367.2794376"},{"key":"S0269888924000109_ref164","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.153"},{"key":"S0269888924000109_ref196","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2021.08.009"},{"key":"S0269888924000109_ref179","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.061132"},{"key":"S0269888924000109_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2017.08.031"},{"key":"S0269888924000109_ref147","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.09.148"},{"key":"S0269888924000109_ref183","doi-asserted-by":"publisher","DOI":"10.1109\/CyberC.2010.57"},{"key":"S0269888924000109_ref150","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2016.7752287"},{"key":"S0269888924000109_ref152","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2798699"},{"key":"S0269888924000109_ref92","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623746"},{"key":"S0269888924000109_ref20","doi-asserted-by":"crossref","unstructured":"Beigi, G. , Ranganath, S. & Liu, H. 2019. Signed link prediction with sparse data: The role of personality information. In Companion Proceedings of The 2019 World Wide Web Conference, 1270\u20131278.","DOI":"10.1145\/3308560.3316469"},{"key":"S0269888924000109_ref56","doi-asserted-by":"crossref","unstructured":"Dey, P. , Goel, K. & Agrawal, R. 2020. P-simrank: Extending simrank to scale-free bipartite networks. In Proceedings of The Web Conference 2020, 3084\u20133090.","DOI":"10.1145\/3366423.3380081"},{"key":"S0269888924000109_ref37","unstructured":"Chen, J. , Xu, X. , Wu, Y. & Zheng, H. 2018. Gc-lstm: Graph convolution embedded lstm for dynamic link prediction. arXiv preprint arXiv:1812.04206."},{"key":"S0269888924000109_ref190","doi-asserted-by":"publisher","DOI":"10.1145\/3648470"},{"key":"S0269888924000109_ref246","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32025-0_25"},{"key":"S0269888924000109_ref206","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"S0269888924000109_ref112","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.123790"},{"key":"S0269888924000109_ref59","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90161-6"},{"key":"S0269888924000109_ref181","doi-asserted-by":"crossref","unstructured":"Serban, I. , Sordoni, A. , Bengio, Y. , Courville, A. & Pineau, J. 2016. Building end-to-end dialogue systems using generative hierarchical neural network models. In Proceedings of the AAAI Conference on Artificial Intelligence, 30.","DOI":"10.1609\/aaai.v30i1.9883"},{"key":"S0269888924000109_ref140","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.046122"},{"key":"S0269888924000109_ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.042029"},{"key":"S0269888924000109_ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505541"},{"key":"S0269888924000109_ref83","doi-asserted-by":"crossref","unstructured":"Grover, A. & Leskovec, J. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"S0269888924000109_ref117","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2330833"},{"key":"S0269888924000109_ref60","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20570"},{"key":"S0269888924000109_ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.33"},{"key":"S0269888924000109_ref173","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0396-2"},{"key":"S0269888924000109_ref189","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.11.026"},{"key":"S0269888924000109_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"S0269888924000109_ref115","doi-asserted-by":"publisher","DOI":"10.1145\/3580513"},{"key":"S0269888924000109_ref155","doi-asserted-by":"publisher","DOI":"10.1109\/ISTEL.2012.6483105"},{"key":"S0269888924000109_ref172","doi-asserted-by":"crossref","unstructured":"Ruan, Y. , Fuhry, D. & Parthasarathy, S. 2013. Efficient community detection in large networks using content and links. In Proceedings of the 22nd International Conference on World Wide Web, 1089\u20131098.","DOI":"10.1145\/2488388.2488483"},{"key":"S0269888924000109_ref205","doi-asserted-by":"publisher","DOI":"10.1287\/isre.1100.0339"},{"key":"S0269888924000109_ref49","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"S0269888924000109_ref87","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.119"},{"key":"S0269888924000109_ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.55"},{"key":"S0269888924000109_ref95","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"S0269888924000109_ref192","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.138"},{"key":"S0269888924000109_ref52","unstructured":"Das, A. & Kempe, D. 2011. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. Computing Research Repository - CORR."},{"key":"S0269888924000109_ref170","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"},{"key":"S0269888924000109_ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3076930"},{"key":"S0269888924000109_ref35","doi-asserted-by":"crossref","unstructured":"Chakraborty, T. , Srinivasan, S. , Ganguly, N. , Mukherjee, A. & Bhowmick, S. 2014. On the permanence of vertices in network communities. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1396\u20131405.","DOI":"10.1145\/2623330.2623707"},{"key":"S0269888924000109_ref209","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487691"},{"key":"S0269888924000109_ref176","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2018.01.004"},{"key":"S0269888924000109_ref89","doi-asserted-by":"publisher","DOI":"10.1145\/3209582.3209595"},{"key":"S0269888924000109_ref166","doi-asserted-by":"crossref","unstructured":"Perozzi, B. , Al-Rfou, R. & Skiena, S. 2014. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"key":"S0269888924000109_ref55","doi-asserted-by":"publisher","DOI":"10.23919\/APNOMS50412.2020.9236993"},{"key":"S0269888924000109_ref187","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105554"},{"key":"S0269888924000109_ref154","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104772"},{"key":"S0269888924000109_ref240","doi-asserted-by":"crossref","unstructured":"Zhang, H. , Dinh, T. N. & Thai, M. T. 2013. Maximizing the spread of positive influence in online social networks. In 2013 IEEE 33rd International Conference on Distributed Computing Systems, 317\u2013326.","DOI":"10.1109\/ICDCS.2013.37"},{"key":"S0269888924000109_ref84","doi-asserted-by":"publisher","DOI":"10.1145\/2503792.2503797"},{"key":"S0269888924000109_ref85","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505571"},{"key":"S0269888924000109_ref162","unstructured":"Page, L. , Brin, S. , Motwani, R. & Winograd, T. 1999. The pagerank citation ranking: Bringing order to the web, Technical Report 1999-66, Stanford InfoLab. Previous number = SIDL-WP-1999-0120. http:\/\/ilpubs.stanford.edu:8090\/422\/"},{"key":"S0269888924000109_ref142","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55699-4_38"},{"key":"S0269888924000109_ref171","unstructured":"Rodriguez, M. G. , Balduzzi, D. & Sch\u00f6lkopf, B. 2011. Uncovering the temporal dynamics of diffusion networks. arXiv preprint arXiv:1105.0697."},{"key":"S0269888924000109_ref168","doi-asserted-by":"publisher","DOI":"10.1145\/3110215"},{"key":"S0269888924000109_ref151","doi-asserted-by":"publisher","DOI":"10.1177\/0165551514565318"},{"key":"S0269888924000109_ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"S0269888924000109_ref79","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"S0269888924000109_ref175","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0118432"},{"key":"S0269888924000109_ref199","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0170-z"},{"key":"S0269888924000109_ref241","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394793"},{"key":"S0269888924000109_ref214","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09333-8_16"},{"key":"S0269888924000109_ref220","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2624734"},{"key":"S0269888924000109_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.011"},{"key":"S0269888924000109_ref65","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"S0269888924000109_ref103","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1927.0118"},{"key":"S0269888924000109_ref207","unstructured":"Tang, J. , Tang, X. & Yuan, J. 2017. Towards profit maximization for online social network providers. CoRR abs\/1712.08963."},{"key":"S0269888924000109_ref127","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588561"},{"key":"S0269888924000109_ref91","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3091638"},{"key":"S0269888924000109_ref163","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.104.258701"},{"key":"S0269888924000109_ref113","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01413-8"},{"key":"S0269888924000109_ref197","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-023-08244-3"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888924000109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:24Z","timestamp":1767624144000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888924000109\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":242,"alternative-id":["S0269888924000109"],"URL":"https:\/\/doi.org\/10.1017\/s0269888924000109","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"value":"0269-8889","type":"print"},{"value":"1469-8005","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"e11"}}