{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T05:30:27Z","timestamp":1766295027550,"version":"3.48.0"},"reference-count":54,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Academic Degree and Postgraduate Education Reform Project of Jiangsu Province","award":["SJCX24_2220"],"award-info":[{"award-number":["SJCX24_2220"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61971233"],"award-info":[{"award-number":["61971233"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61702441"],"award-info":[{"award-number":["61702441"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Influence maximization is a crucial research domain in social network analysis, playing a vital role in optimizing information dissemination and managing online public opinion. Traditional IM models focus on network topology, often overlooking user heterogeneity and server-driven propagation dynamics, which often leads to limited model adaptability. To overcome these shortcomings, this study proposes the \u201cSocial\u2013Interest Hybrid Influence Maximization\u201d (SIHIM) problem, which explicitly models the joint influence of social topology and user interest in server-mediated propagation, aiming to enhance the effectiveness of information propagation by integrating users\u2019 social relationships and interest preferences. To model this problem, we develop a Server-Based Independent Cascading (SB-IC) model that captures the dynamics of influence propagation. Based on this model, we further propose a novel hybrid centrality algorithm named Pascal Centrality (PaC), which integrates both topological and interest-based attributes to efficiently identify key seed nodes while minimizing influence overlap. Experimental evaluations on ten real-world social network datasets demonstrate that PaC improves influence spread by 5.22% under the standard IC model and by 7.04% under the SB-IC model, outperforming nine state-of-the-art algorithms. These findings underscore the effectiveness and adaptability of the proposed algorithm in complex scenarios.<\/jats:p>","DOI":"10.3390\/info17010003","type":"journal-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T14:27:16Z","timestamp":1766154436000},"page":"3","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interest as the Engine: Leveraging Diverse Hybrid Propagation for Influence Maximization in Interest-Based Social Networks"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4413-9393","authenticated-orcid":false,"given":"Jian","family":"Li","sequence":"first","affiliation":[{"name":"College of Information and Artificial Intelligence (College of Industrial Software), Yangzhou University, Yangzhou 225009, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8503-4063","authenticated-orcid":false,"given":"Wei","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Information and Artificial Intelligence (College of Industrial Software), Yangzhou University, Yangzhou 225009, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5307-3341","authenticated-orcid":false,"given":"Wenxin","family":"Jiang","sequence":"additional","affiliation":[{"name":"College of Information and Artificial Intelligence (College of Industrial Software), Yangzhou University, Yangzhou 225009, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhao","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Information and Artificial Intelligence (College of Industrial Software), Yangzhou University, Yangzhou 225009, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Information and Artificial Intelligence (College of Industrial Software), Yangzhou University, Yangzhou 225009, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s41109-024-00625-3","article-title":"Influence maximization on temporal networks: A review","volume":"9","author":"Yanchenko","year":"2024","journal-title":"Appl. Netw. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"126936","DOI":"10.1016\/j.neucom.2023.126936","article-title":"Influence maximization algorithm based on group trust and local topology structure","volume":"564","author":"Guo","year":"2024","journal-title":"Neurocomputing"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"123429","DOI":"10.1016\/j.eswa.2024.123429","article-title":"A survey on influence maximization models","volume":"248","author":"Jaouadi","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Richardson, M., and Domingos, P. (2002, January 23\u201326). Mining knowledge-sharing sites for viral marketing. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada.","DOI":"10.1145\/775056.775057"},{"key":"ref_5","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\/956755.956769"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1086\/226707","article-title":"Threshold models of collective behavior","volume":"83","author":"Granovetter","year":"1978","journal-title":"Am. J. Sociol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1016\/j.chaos.2011.09.002","article-title":"On the global stability of SIS, SIR and SIRS epidemic models with standard incidence","volume":"44","year":"2011","journal-title":"Chaos Solitons Fractals"},{"key":"ref_8","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_9","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_10","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_11","unstructured":"Cheng, S., Shen, H., Huang, J., Zhang, G., and Cheng, X. (November, January 27). Staticgreedy: Solving the scalability-accuracy dilemma in influence maximization. Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, San Francisco, CA, USA."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","article-title":"On the upper bounds of spread for greedy algorithms in social network influence maximization","volume":"27","author":"Zhou","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"116342","DOI":"10.1016\/j.eswa.2021.116342","article-title":"A two-stage VIKOR assisted multi-operator differential evolution approach for Influence Maximization in social networks","volume":"192","author":"Biswas","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_14","first-page":"1","article-title":"Triadic closure sensitive influence maximization","volume":"17","author":"Yang","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"103621","DOI":"10.1016\/j.ipm.2023.103621","article-title":"Turing instability analysis of a reaction\u2013diffusion system for rumor propagation in continuous space and complex networks","volume":"61","author":"Li","year":"2024","journal-title":"Inf. Process. Manag."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0378-8733(79)90002-9","article-title":"Centrality in social networks: II. Experimental results","volume":"2","author":"Freeman","year":"1979","journal-title":"Soc. Netw."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"083030","DOI":"10.1088\/1367-2630\/14\/8\/083030","article-title":"A k-shell decomposition method for weighted networks","volume":"14","author":"Garas","year":"2012","journal-title":"New J. Phys."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"102439","DOI":"10.1016\/j.inffus.2024.102439","article-title":"Towards investigating influencers in complex social networks using electric potential concept from a centrality perspective","volume":"109","author":"Ullah","year":"2024","journal-title":"Inf. Fusion"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"112136","DOI":"10.1016\/j.chaos.2022.112136","article-title":"Node influence ranking in complex networks: A local structure entropy approach","volume":"160","author":"Lei","year":"2022","journal-title":"Chaos Solitons Fractals"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.socnet.2016.09.005","article-title":"Geodesic based centrality: Unifying the local and the global","volume":"49","author":"Agneessens","year":"2017","journal-title":"Soc. Netw."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"110456","DOI":"10.1016\/j.chaos.2020.110456","article-title":"A generalized gravity model for influential spreaders identification in complex networks","volume":"143","author":"Li","year":"2021","journal-title":"Chaos Solitons Fractals"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10844-023-00822-z","article-title":"Leveraging neighborhood and path information for influential spreaders recognition in complex networks","volume":"62","author":"Ullah","year":"2024","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"073407","DOI":"10.1088\/1742-5468\/aace08","article-title":"M-centrality: Identifying key nodes based on global position and local degree variation","volume":"2018","author":"Ibnoulouafi","year":"2018","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"115778","DOI":"10.1016\/j.eswa.2021.115778","article-title":"Identifying vital nodes from local and global perspectives in complex networks","volume":"186","author":"Ullah","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"120326","DOI":"10.1016\/j.eswa.2023.120326","article-title":"LSS: A locality-based structure system to evaluate the spreader\u2019s importance in social complex networks","volume":"228","author":"Ullah","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"101609","DOI":"10.1016\/j.swevo.2024.101609","article-title":"IMNE: Maximizing influence through deep learning-based node embedding in social network","volume":"88","author":"Hu","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"105893","DOI":"10.1016\/j.knosys.2020.105893","article-title":"Identifying critical nodes in complex networks via graph convolutional networks","volume":"198","author":"Yu","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_30","unstructured":"Ling, C., Jiang, J., Wang, J., Thai, M.T., Xue, R., Song, J., Qiu, M., and Zhao, L. (2023, January 23\u201329). Deep graph representation learning and optimization for influence maximization. Proceedings of the International Conference on Machine Learning, PMLR, Honolulu, HI, USA. Available online: https:\/\/proceedings.mlr.press\/v202\/ling23b.html."},{"key":"ref_31","first-page":"103710","article-title":"ReCovNet: Reinforcement learning with covering information for solving maximal coverage billboards location problem","volume":"128","author":"Zhong","year":"2024","journal-title":"Int. J. Appl. Earth Obs. Geoinf."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"2210","DOI":"10.1109\/TCSS.2023.3272331","article-title":"ToupleGDD: A fine-designed solution of influence maximization by deep reinforcement learning","volume":"11","author":"Chen","year":"2023","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1109\/TCSS.2023.3243936","article-title":"Topic-aware information coverage maximization in social networks","volume":"11","author":"Li","year":"2023","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_34","unstructured":"Aslay, C., Barbieri, N., Bonchi, F., and Baeza-Yates, R. (2014, January 24\u201328). Online Topic-aware Influence Maximization Queries. Proceedings of the 17th International Conference on Extending Database Technology, EDBT, Athens, Greece."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"666","DOI":"10.14778\/2735703.2735706","article-title":"Online topic-aware influence maximization","volume":"8","author":"Chen","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"ref_36","first-page":"970","article-title":"Topic-based influence computation in social networks under resource constraints","volume":"12","author":"Gedik","year":"2016","journal-title":"IEEE Trans. Serv. Comput."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/TNSE.2021.3127921","article-title":"An influence maximization algorithm based on community-topic features for dynamic social networks","volume":"9","author":"Qin","year":"2021","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Galhotra, S., Arora, A., and Roy, S. (July, January 26). Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. Proceedings of the 2016 International Conference on Management of Data, San Francisco, CA, USA.","DOI":"10.1145\/2882903.2882929"},{"key":"ref_39","first-page":"1993","article-title":"Target-aware holistic influence maximization in spatial social networks","volume":"34","author":"Cai","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"102818","DOI":"10.1016\/j.ipm.2021.102818","article-title":"An influence maximization method based on crowd emotion under an emotion-based attribute social network","volume":"59","author":"Li","year":"2022","journal-title":"Inf. Process. Manag."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Huang, J., Lan, B., Nong, J., Pang, G., and Hao, F. (2025). SentiRank: A Novel Approach to Sentiment Leader Identification in Social Networks Based on the D-TFRank Model. Electronics, 14.","DOI":"10.3390\/electronics14142751"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ins.2019.04.033","article-title":"Identification of influential users in social networks based on users\u2019 interest","volume":"493","author":"Zareie","year":"2019","journal-title":"Inf. Sci."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Tang, Q., Guo, P., and Guo, J. (2024, January 15\u201318). GraphHash: Topic-Aware Influence Maximization Using Hash. Proceedings of the 2024 IEEE International Conference on Big Data (BigData), Washington, DC, USA.","DOI":"10.1109\/BigData62323.2024.10826007"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10618-025-01133-3","article-title":"Topic-aware influence maximization with deep reinforcement learning and graph attention networks","volume":"39","author":"Halal","year":"2025","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"129372","DOI":"10.1109\/ACCESS.2025.3590835","article-title":"Dynamic Adaptive Parametric Social Network Analysis Using Reinforcement Learning: A Case Study in Topic-Aware Influence Maximization","volume":"13","author":"Ahmadikia","year":"2025","journal-title":"IEEE Access"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"104029","DOI":"10.1016\/j.ipm.2024.104029","article-title":"DyHGTCR-Cas: Learning unified spatio-temporal features based on dynamic heterogeneous graph neural network for information cascade prediction","volume":"62","author":"Sang","year":"2025","journal-title":"Inf. Process. Manag."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"130507","DOI":"10.1016\/j.physleta.2025.130507","article-title":"Topic and opinion infused hypergraphs for influence maximization","volume":"545","author":"Chakraborty","year":"2025","journal-title":"Phys. Lett. A"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Vombatkere, K., Mousavi, S., Zannettou, S., Roesner, F., and Gummadi, K.P. (2024, January 13\u201317). Tiktok and the art of personalization: Investigating exploration and exploitation on social media feeds. Proceedings of the ACM Web Conference 2024, Singapore.","DOI":"10.1145\/3589334.3645600"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.physa.2018.10.011","article-title":"An efficient algorithm for mining a set of influential spreaders in complex networks","volume":"516","author":"Jiang","year":"2019","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"2626","DOI":"10.1038\/s41598-017-02751-8","article-title":"Node attribute-enhanced community detection in complex networks","volume":"7","author":"Jia","year":"2017","journal-title":"Sci. Rep."},{"key":"ref_52","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","volume":"29","author":"Rossi","year":"2015","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1007\/s10660-020-09432-1","article-title":"The effect of product distance on the eWOM in recommendation network","volume":"22","author":"Pan","year":"2022","journal-title":"Electron. Commer. Res."},{"key":"ref_54","unstructured":"Bogdan, A., Dospinescu, N., and Dospinescu, O. (2025). Beyond credibility: Understanding the mediators between electronic word-of-mouth and purchase intention. arXiv."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/17\/1\/3\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T05:28:03Z","timestamp":1766294883000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/17\/1\/3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":54,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["info17010003"],"URL":"https:\/\/doi.org\/10.3390\/info17010003","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2025,12,19]]}}}