{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T17:19:48Z","timestamp":1768324788726,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s44443-025-00207-y","type":"journal-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:08:30Z","timestamp":1755598110000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Node importance ranking for influence maximization in social networks"],"prefix":"10.1007","volume":"37","author":[{"given":"Wenjing","family":"Yang","sequence":"first","affiliation":[]},{"given":"Qing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,19]]},"reference":[{"issue":"1\u20137","key":"207_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"issue":"5","key":"207_CR2","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s11227-025-07175-0","volume":"81","author":"B Chai","year":"2025","unstructured":"Chai B, Zhang R, Li X, Tang J (2025) CLDE: a competitive learning-driven differential evolution optimization for the influence maximization problem in social networks. J Supercomput 81(5):700","journal-title":"J Supercomput"},{"key":"207_CR3","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"207_CR4","doi-asserted-by":"crossref","unstructured":"Chiranjeevi M, Vura S, Mangamuri P, Dhuli S, Enduri MK, Mohammad B (2023) Ranking Popular Personalities in Social Networks Using Mixed Centrality Method. In: 2023 IEEE 15th international conference on computational intelligence and communication networks (CICN) IEEE. pp 758\u2013763","DOI":"10.1109\/CICN59264.2023.10402165"},{"issue":"1","key":"207_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s12530-024-09640-2","volume":"16","author":"C Fan","year":"2025","unstructured":"Fan C, Wang Z, Zhang J, Zhao J, Meng X (2025) Meta-heuristic algorithms for influence maximization: a survey. Evolving Syst 16(1):24","journal-title":"Evolving Syst"},{"key":"207_CR6","doi-asserted-by":"crossref","unstructured":"Freeman L (1977) A set of measures of centrality based on betweenness. Sociometry","DOI":"10.2307\/3033543"},{"issue":"5","key":"207_CR7","doi-asserted-by":"publisher","first-page":"3832","DOI":"10.12694\/scpe.v25i5.3021","volume":"25","author":"G Fu","year":"2024","unstructured":"Fu G, Yin X, Gao Y, Meng D, Chen L (2024) Research on the application of node importance assessment based on HITs algorithm in power grid planning. Scalable Comput Pract Exper 25(5):3832\u20133840","journal-title":"Scalable Comput Pract Exper"},{"issue":"3","key":"207_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich DF (2015) PageRank beyond the web. Siam Rev 57(3):321\u2013363","journal-title":"Siam Rev"},{"key":"207_CR9","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web. pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"207_CR10","doi-asserted-by":"publisher","first-page":"126936","DOI":"10.1016\/j.neucom.2023.126936","volume":"564","author":"C Guo","year":"2024","unstructured":"Guo C, Li W, Liu F, Zhong K, Wu X, Zhao Y et al (2024) Influence maximization algorithm based on group trust and local topology structure. Neurocomputing 564:126936","journal-title":"Neurocomputing"},{"key":"207_CR11","doi-asserted-by":"crossref","unstructured":"He Q, Zhang Z, Bi T, Fang H, Yi X, Yu K (2024) Adaptive rumor suppression on social networks: a multi-round hybrid approach. ACM Trans Knowl Disc Data","DOI":"10.1145\/3701738"},{"key":"207_CR12","doi-asserted-by":"crossref","unstructured":"Huang Z, Li L (2023) Dynamic influence maximization with WoM sensitivity in blockchain online social network. In: 2023 IEEE international conferences on Internet of Things (iThings) and IEEE Green Computing & Communications (GreenCom) and IEEE Cyber, Physical & Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics) IEEE. pp 326\u2013333","DOI":"10.1109\/iThings-GreenCom-CPSCom-SmartData-Cybermatics60724.2023.00074"},{"key":"207_CR13","unstructured":"Hui Y, Wang S, Chekol MW, Rudinac S, Zwetsloot IM (2024) Non-progressive influence maximization in dynamic social networks. arXiv:2412.07402"},{"issue":"1","key":"207_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCSS.2022.3216587","volume":"11","author":"M Jaouadi","year":"2022","unstructured":"Jaouadi M, Romdhane LB (2022) A graph sampling-based model for influence maximization in large-scale social networks. IEEE Trans Comput Soc Syst 11(1):144\u2013160","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"207_CR15","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"11","key":"207_CR16","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE et al (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"issue":"1","key":"207_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: Densification and shrinking diameters. ACM Trans Knowl Disc Data (TKDD) 1(1):2","journal-title":"ACM Trans Knowl Disc Data (TKDD)"},{"key":"207_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems. pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"key":"207_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"207_CR20","unstructured":"Leskovec J, Mcauley J (2012) Learning to discover social circles in ego networks. Adv Neural Inf Process Syst 25"},{"issue":"11","key":"207_CR21","doi-asserted-by":"publisher","first-page":"12497","DOI":"10.1007\/s10489-021-03021-x","volume":"52","author":"H Li","year":"2022","unstructured":"Li H, Zhang R, Liu X (2022) An efficient discrete differential evolution algorithm based on community structure for influence maximization. Appl Intell 52(11):12497\u201312515","journal-title":"Appl Intell"},{"issue":"6","key":"207_CR22","doi-asserted-by":"publisher","first-page":"926","DOI":"10.3390\/e25060926","volume":"25","author":"Z Li","year":"2023","unstructured":"Li Z, Piao W, Sun Z, Wang L, Wang X, Li W (2023) User real-time influence ranking algorithm of social networks considering interactivity and topicality. Entropy 25(6):926","journal-title":"Entropy"},{"key":"207_CR23","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1613\/jair.1.14450","volume":"76","author":"M Lin","year":"2023","unstructured":"Lin M, Sun L, Yang R, Liu X, Wang Y, Li D et al (2023) Fair influence maximization in large-scale social networks based on attribute-aware reverse influence sampling. J Artif Intell Res 76:925\u2013957","journal-title":"J Artif Intell Res"},{"key":"207_CR24","doi-asserted-by":"crossref","unstructured":"Lin S, Li S, Su Y (2023) Node Importance Recognition Algorithm Based on the Correlation Degree Transmission Contribution Matrix. In: Journal of physics: conference series. IOP Publishing, vol 2419, p 012107","DOI":"10.1088\/1742-6596\/2419\/1\/012107"},{"key":"207_CR25","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1016\/j.physa.2018.08.042","volume":"512","author":"M Liu","year":"2018","unstructured":"Liu M, Ma Y, Cao Z, Qi X (2018) ECP-rank: a novel vital node identifying mechanism combining PageRank with link prediction index. Phys A: Stat Mech Its Appl 512:1183\u20131191","journal-title":"Phys A: Stat Mech Its Appl"},{"key":"207_CR26","doi-asserted-by":"publisher","first-page":"114813","DOI":"10.1016\/j.tcs.2024.114813","volume":"1018","author":"J Liu","year":"2024","unstructured":"Liu J, You Z, Liang Z, Du H (2024) User-driven competitive influence maximization in social networks. Theor Comput Sci 1018:114813","journal-title":"Theor Comput Sci"},{"key":"207_CR27","doi-asserted-by":"crossref","unstructured":"Liu Y, Chen S, Wang L (2023) A node importance assessment method for complex networks based on the neighborhood influence. In: 2023 IEEE 3rd international conference on software engineering and artificial intelligence (SEAI) IEEE. pp 224\u2013228","DOI":"10.1109\/SEAI59139.2023.10217612"},{"key":"207_CR28","doi-asserted-by":"crossref","unstructured":"Liu W, Deng Z, Chen Y, Chen L (2025) A greedy descent method for budget constrained continuous influence maximization in online social network. IEEE Trans Comput Soc Syst","DOI":"10.1109\/TCSS.2025.3551651"},{"issue":"3","key":"207_CR29","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1007\/s12652-023-04680-z","volume":"15","author":"I Lozano-Osorio","year":"2024","unstructured":"Lozano-Osorio I, S\u00e1nchez-Oro J, Duarte A (2024) An efficient and effective GRASP algorithm for the budget influence maximization problem. J Ambient Intell Human Comput 15(3):2023\u20132034","journal-title":"J Ambient Intell Human Comput"},{"key":"207_CR30","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2019.12.022","volume":"105","author":"T Ma","year":"2020","unstructured":"Ma T, Liu Q, Cao J, Tian Y, Al-Dhelaan A, Al-Rodhaan M (2020) LGIEM: global and local node influence based community detection. Future Gener Comput Syst 105:533\u2013546","journal-title":"Future Gener Comput Syst"},{"key":"207_CR31","doi-asserted-by":"publisher","first-page":"113681","DOI":"10.1016\/j.eswa.2020.113681","volume":"161","author":"G Maji","year":"2020","unstructured":"Maji G, Mandal S, Sen S (2020) A systematic survey on influential spreaders identification in complex networks with a focus on K-shell based techniques. Expert Syst Appl 161:113681","journal-title":"Expert Syst Appl"},{"issue":"2","key":"207_CR32","doi-asserted-by":"publisher","first-page":"98","DOI":"10.17645\/mac.v8i2.2741","volume":"8","author":"S Maj\u00f3-V\u00e1zquez","year":"2020","unstructured":"Maj\u00f3-V\u00e1zquez S, Cardenal AS, Segarra O, de Sim\u00f3n PC (2020) Media roles in the online news domain: authorities and emergent audience brokers. Media Commun 8(2):98\u2013111","journal-title":"Media Commun"},{"issue":"4","key":"207_CR33","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.physrep.2013.08.002","volume":"533","author":"FD Malliaros","year":"2013","unstructured":"Malliaros FD, Vazirgiannis M (2013) Clustering and community detection in directed networks: a survey. Phys Rep 533(4):95\u2013142","journal-title":"Phys Rep"},{"key":"207_CR34","doi-asserted-by":"crossref","unstructured":"Michalski R, Jankowski J, Pazura P (2020) Entropy-based measure for influence maximization in temporal networks. In: International conference on computational science. Springer, pp 277\u2013290","DOI":"10.1007\/978-3-030-50423-6_21"},{"key":"207_CR35","doi-asserted-by":"crossref","unstructured":"Mishra S, Dwivedi RK (2023) Leveraging deep learning to spot communities for influence maximization in social networks. In: 2023 International conference on intelligent data communication technologies and Internet of Things (IDCIoT). IEEE, p 377\u2013382","DOI":"10.1109\/IDCIoT56793.2023.10053447"},{"issue":"1","key":"207_CR36","doi-asserted-by":"publisher","first-page":"2254","DOI":"10.1038\/s41598-021-81614-9","volume":"11","author":"A Namtirtha","year":"2021","unstructured":"Namtirtha A, Dutta A, Dutta B, Sundararajan A, Simmhan Y (2021) Best influential spreaders identification using network global structural properties. Sci Rep 11(1):2254","journal-title":"Sci Rep"},{"issue":"5","key":"207_CR37","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1002\/asi.21015","volume":"60","author":"P Panzarasa","year":"2009","unstructured":"Panzarasa P, Opsahl T, Carley KM (2009) Patterns and dynamics of users\u2019 behavior and interaction: network analysis of an online community. J Am Soc Inf Sci Technol 60(5):911\u2013932","journal-title":"J Am Soc Inf Sci Technol"},{"key":"207_CR38","unstructured":"Qu H, Song YR, Li R, Li M, Jiang GP (2024) Node ranking based on graph curvature and pagerank. Chin Phys B"},{"key":"207_CR39","unstructured":"Scott J (2002) Social networks: Critical concepts in sociology, vol 4. Taylor & Francis"},{"key":"207_CR40","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ins.2021.01.053","volume":"577","author":"Q Shang","year":"2021","unstructured":"Shang Q, Deng Y, Cheong KH (2021) Identifying influential nodes in complex networks: effective distance gravity model. Inf Sci 577:162\u2013179","journal-title":"Inf Sci"},{"key":"207_CR41","doi-asserted-by":"crossref","unstructured":"Shu J, Liang Y, Ma W, Liu L (2024) Key nodes evaluation method based on combination weighting VIKOR in social networks. IEEE Trans Comput Soc Syst 11(4):5404\u20135418","DOI":"10.1109\/TCSS.2024.3360618"},{"issue":"5","key":"207_CR42","doi-asserted-by":"publisher","first-page":"058901","DOI":"10.1088\/1674-1056\/ad20d6","volume":"33","author":"Z Su","year":"2024","unstructured":"Su Z, Chen L, Ai J, Zheng YY, Bie N (2024) Identifying influential spreaders in complex networks based on density entropy and community structure. Chinese Phys B 33(5):058901","journal-title":"Chinese Phys B"},{"issue":"1","key":"207_CR43","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s13278-022-01012-5","volume":"13","author":"BR Sziklai","year":"2022","unstructured":"Sziklai BR, Lengyel B (2022) Finding early adopters of innovation in social networks. Soc Netw Anal Mining 13(1):4","journal-title":"Soc Netw Anal Mining"},{"issue":"1","key":"207_CR44","doi-asserted-by":"publisher","first-page":"6173","DOI":"10.1038\/s41598-021-84684-x","volume":"11","author":"A Ullah","year":"2021","unstructured":"Ullah A, Wang B, Sheng J, Long J, Khan N, Sun Z (2021) Identification of nodes influence based on global structure model in complex networks. Sci Rep 11(1):6173","journal-title":"Sci Rep"},{"key":"207_CR45","unstructured":"Wang JD, Zhu YL, Zhang ZX (2023) Node importance measurement based on the improved K-shell in complex network. In: Eighth International Symposium on Advances in Electrical, Electronics, and Computer Engineering (ISAEECE 2023). SPIE, vol 12704, pp 463\u2013467"},{"key":"207_CR46","doi-asserted-by":"publisher","first-page":"124229","DOI":"10.1016\/j.physa.2020.124229","volume":"554","author":"M Wang","year":"2020","unstructured":"Wang M, Li W, Guo Y, Peng X, Li Y (2020) Identifying influential spreaders in complex networks based on improved k-shell method. Phys A: Stat Mech its Appl 554:124229","journal-title":"Phys A: Stat Mech its Appl"},{"key":"207_CR47","doi-asserted-by":"crossref","unstructured":"Yan XL, Cui YP, Ni SJ (2020) Identifying influential spreaders in complex networks based on entropy weight method and gravity law. Chinese Phys B 29(4):048902","DOI":"10.1088\/1674-1056\/ab77fe"},{"issue":"1","key":"207_CR48","doi-asserted-by":"publisher","first-page":"9728742","DOI":"10.1155\/2019\/9728742","volume":"2019","author":"Y Yang","year":"2019","unstructured":"Yang Y, Yu L, Zhou Z, Chen Y, Kou T (2019) Node importance ranking in complex networks based on multicriteria decision making. Math Prob Eng 2019(1):9728742","journal-title":"Math Prob Eng"},{"issue":"3","key":"207_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3650179","volume":"18","author":"A Zareie","year":"2024","unstructured":"Zareie A, Sakellariou R (2024) Fuzzy influence maximization in social networks. ACM Trans Web 18(3):1\u201328","journal-title":"ACM Trans Web"},{"key":"207_CR50","doi-asserted-by":"publisher","first-page":"105580","DOI":"10.1016\/j.knosys.2020.105580","volume":"194","author":"A Zareie","year":"2020","unstructured":"Zareie A, Sheikhahmadi A, Jalili M, Fasaei MSK (2020) Finding influential nodes in social networks based on neighborhood correlation coefficient. Knowl -Based Syst 194:105580","journal-title":"Knowl -Based Syst"},{"issue":"3","key":"207_CR51","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1049\/cit2.12158","volume":"8","author":"L Zhang","year":"2023","unstructured":"Zhang L, Liu Y, Yang H, Cheng F, Liu Q, Zhang X (2023) Overlapping community-based particle swarm optimization algorithm for influence maximization in social networks. CAAI Trans Intell Technol 8(3):893\u2013913","journal-title":"CAAI Trans Intell Technol"},{"key":"207_CR52","doi-asserted-by":"crossref","unstructured":"Zhan Q, Zhang J, Wang S, Yu PS, Xie J (2015) Influence maximization across partially aligned heterogenous social networks. In: Pacific-Asia conference on knowledge discovery and data mining Springer. pp 58\u201369","DOI":"10.1007\/978-3-319-18038-0_5"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00207-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00207-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00207-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T12:41:46Z","timestamp":1758112906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00207-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,19]]},"references-count":52,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00207-y","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,19]]},"assertion":[{"value":"19 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"181"}}