{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T03:42:05Z","timestamp":1779334925750,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-023-01098-5","type":"journal-article","created":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T04:01:50Z","timestamp":1687838510000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Identifying influential nodes for influence maximization problem in social networks using an improved discrete particle swarm optimization"],"prefix":"10.1007","volume":"13","author":[{"given":"Jianxin","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jimao","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shihui","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jitao","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"issue":"116","key":"1098_CR1","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.eswa.2021.116342","volume":"192","author":"TK Biswas","year":"2022","unstructured":"Biswas TK, Abbasi A, Chakrabortty RK (2022) A two-stage vikor assisted multi-operator differential evolution approach for influence maximization in social networks. Exp Syst Appl 192(116):342. https:\/\/doi.org\/10.1016\/j.eswa.2021.116342","journal-title":"Exp Syst Appl"},{"issue":"7415","key":"1098_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1038\/nature11421","volume":"489","author":"RM Bond","year":"2012","unstructured":"Bond RM, Fariss CJ, Jones JJ et al (2012) A 61-million-person experiment in social influence and political mobilization. Nature 489(7415):295\u2013298. https:\/\/doi.org\/10.1038\/nature11421","journal-title":"Nature"},{"issue":"1","key":"1098_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-018-07761-2","volume":"10","author":"A Bovet","year":"2019","unstructured":"Bovet A, Makse HA (2019) Influence of fake news in twitter during the 2016 us presidential election. Nat Commun 10(1):1\u201314. https:\/\/doi.org\/10.1038\/s41467-018-07761-2","journal-title":"Nat Commun"},{"key":"1098_CR4","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"1098_CR5","doi-asserted-by":"publisher","first-page":"13650","DOI":"10.1073\/pnas.1401211111","volume":"111","author":"NS Contractor","year":"2014","unstructured":"Contractor NS, DeChurch LA (2014) Integrating social networks and human social motives to achieve social influence at scale. Proc Natl Acad Sci 111:13650\u201313657. https:\/\/doi.org\/10.1073\/pnas.1401211111","journal-title":"Proc Natl Acad Sci"},{"key":"1098_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2018","unstructured":"Cui L, Hu H, Yu S et al (2018) Ddse: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119\u2013130. https:\/\/doi.org\/10.1016\/j.jnca.2017.12.003","journal-title":"J Netw Comput Appl"},{"key":"1098_CR7","doi-asserted-by":"publisher","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp 57\u201366. https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"issue":"118","key":"1098_CR8","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.eswa.2022.118702","volume":"212","author":"C Dong","year":"2023","unstructured":"Dong C, Xu G, Yang P et al (2023) Tsifim: a three-stage iterative framework for influence maximization in complex networks. Exp Syst Appl 212(118):702. https:\/\/doi.org\/10.1016\/j.eswa.2022.118702","journal-title":"Exp Syst Appl"},{"issue":"3","key":"1098_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239","journal-title":"Soc Netw"},{"issue":"5","key":"1098_CR10","doi-asserted-by":"publisher","first-page":"056","DOI":"10.1103\/PhysRevE.79.056102","volume":"79","author":"A Galstyan","year":"2009","unstructured":"Galstyan A, Musoyan V, Cohen P (2009) Maximizing influence propagation in networks with community structure. Phys Rev E 79(5):056\u2013102. https:\/\/doi.org\/10.1103\/PhysRevE.79.056102","journal-title":"Phys Rev E"},{"key":"1098_CR11","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B et al (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367:600\u2013614. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012","journal-title":"Inf Sci"},{"key":"1098_CR12","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"issue":"2","key":"1098_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille A, Hacid H, Favre C et al (2013) Information diffusion in online social networks: a survey. ACM Sigmod Rec 42(2):17\u201328. https:\/\/doi.org\/10.1145\/2503792.2503797","journal-title":"ACM Sigmod Rec"},{"key":"1098_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.physa.2014.10.088","volume":"420","author":"M Heidari","year":"2015","unstructured":"Heidari M, Asadpour M, Faili H (2015) Smg: fast scalable greedy algorithm for influence maximization in social networks. Phys A Stat Mech Appl 420:124\u2013133. https:\/\/doi.org\/10.1016\/j.physa.2014.10.088","journal-title":"Phys A Stat Mech Appl"},{"issue":"6","key":"1098_CR15","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang H, Shen H, Meng Z et al (2019) Community-based influence maximization for viral marketing. Appl Intel 49(6):2137\u20132150. https:\/\/doi.org\/10.1007\/s10489-018-1387-8","journal-title":"Appl Intel"},{"key":"1098_CR16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7838","author":"Q Jiang","year":"2011","unstructured":"Jiang Q, Song G, Gao C et al (2011) Simulated annealing based influence maximization in social networks. Twenty-fifth AAAI Conf Artif Intell. https:\/\/doi.org\/10.1609\/aaai.v25i1.7838","journal-title":"Twenty-fifth AAAI Conf Artif Intell"},{"key":"1098_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2023.02.059","volume":"534","author":"F Kazemzadeh","year":"2023","unstructured":"Kazemzadeh F, Safaei AA, Mirzarezaee M et al (2023) Determination of influential nodes based on the communities\u2019 structure to maximize influence in social networks. Neurocomputing 534:18\u201328. https:\/\/doi.org\/10.1016\/j.neucom.2023.02.059","journal-title":"Neurocomputing"},{"key":"1098_CR18","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"1098_CR19","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. pp 1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"6","key":"1098_CR20","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.eswa.2020.114168","volume":"167","author":"S Kianian","year":"2020","unstructured":"Kianian S, Rostamnia M (2020) An efficient path-based approach for influence maximization in social networks. Exp Syst Appl 167(6):114\u2013168. https:\/\/doi.org\/10.1016\/j.eswa.2020.114168","journal-title":"Exp Syst Appl"},{"issue":"11","key":"1098_CR21","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 et al (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893. https:\/\/doi.org\/10.1038\/nphys1746","journal-title":"Nat Phys"},{"issue":"2","key":"1098_CR22","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1007\/s10489-021-02403-5","volume":"52","author":"S Kumar","year":"2021","unstructured":"Kumar S, Panda A (2021) Identifying influential nodes in weighted complex networks using an improved wvoterank approach. Appl Intel 52(2):1838\u20131852. https:\/\/doi.org\/10.1007\/s10489-021-02403-5","journal-title":"Appl Intel"},{"issue":"6","key":"1098_CR23","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1007\/s11280-021-00996-y","volume":"25","author":"S Kumar","year":"2022","unstructured":"Kumar S, Gupta A, Khatri I (2022) Csr: a community based spreaders ranking algorithm for influence maximization in social networks. World Wide Web 25(6):2303\u20132322. https:\/\/doi.org\/10.1007\/s11280-021-00996-y","journal-title":"World Wide Web"},{"key":"1098_CR24","doi-asserted-by":"publisher","unstructured":"Kundu S, Murthy C, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: International conference on pattern recognition and machine intelligence, pp 242\u2013247. https:\/\/doi.org\/10.1007\/978-3-642-21786-9_40","DOI":"10.1007\/978-3-642-21786-9_40"},{"key":"1098_CR25","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, et\u00a0al (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. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"1098_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.knosys.2013.01.005","volume":"43","author":"Y Li","year":"2013","unstructured":"Li Y, Ma S, Zhang Y et al (2013) An improved mix framework for opinion leader identification in online learning communities. Knowledge-Based Syst 43:43\u201351. https:\/\/doi.org\/10.1016\/j.knosys.2013.01.005","journal-title":"Knowledge-Based Syst"},{"issue":"114","key":"1098_CR27","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.eswa.2020.114207","volume":"169","author":"W Li","year":"2021","unstructured":"Li W, Zhong K, Wang J et al (2021) A dynamic algorithm based on cohesive entropy for influence maximization in social networks. Exp Syst Appl 169(114):207. https:\/\/doi.org\/10.1016\/j.eswa.2020.114207","journal-title":"Exp Syst Appl"},{"key":"1098_CR28","doi-asserted-by":"publisher","first-page":"7749","DOI":"10.1007\/s10489-021-02283-9","volume":"51","author":"H Li","year":"2021","unstructured":"Li H, Zhang R, Zhao Z et al (2021) Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization. Appl Intel 51:7749\u20137765. https:\/\/doi.org\/10.1007\/s10489-021-02283-9","journal-title":"Appl Intel"},{"issue":"110","key":"1098_CR29","doi-asserted-by":"publisher","first-page":"062","DOI":"10.1016\/j.asoc.2023.110062","volume":"136","author":"W Li","year":"2023","unstructured":"Li W, Hu Y, Jiang C et al (2023) Abem: an adaptive agent-based evolutionary approach for influence maximization in dynamic social networks. Appl Soft Comput 136(110):062. https:\/\/doi.org\/10.1016\/j.asoc.2023.110062","journal-title":"Appl Soft Comput"},{"key":"1098_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L Linyuan","year":"2016","unstructured":"Linyuan L, Chen D, Ren XL et al (2016) Vital nodes identification in complex networks. Phys Rep 650:1\u201363. https:\/\/doi.org\/10.1016\/j.physrep.2016.06.007","journal-title":"Phys Rep"},{"key":"1098_CR31","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","volume":"451","author":"Ma Ll","year":"2016","unstructured":"Ll Ma, Ma C, Zhang HF et al (2016) Identifying influential spreaders in complex networks based on gravity formula. Phys A Stat Mech Appl 451:205\u2013212. https:\/\/doi.org\/10.1016\/j.physa.2015.12.162","journal-title":"Phys A Stat Mech Appl"},{"issue":"4","key":"1098_CR32","doi-asserted-by":"publisher","first-page":"3767","DOI":"10.1007\/s12652-021-03510-4","volume":"14","author":"I Lozano-Osorio","year":"2023","unstructured":"Lozano-Osorio I, Sanchez-Oro J, Duarte A et al (2023) A quick grasp-based method for influence maximization in social networks. J. Ambient Intell Human Comput 14(4):3767\u20133779. https:\/\/doi.org\/10.1007\/s12652-021-03510-4","journal-title":"J. Ambient Intell Human Comput"},{"issue":"1","key":"1098_CR33","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"ME Newman","year":"2005","unstructured":"Newman ME (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39\u201354. https:\/\/doi.org\/10.1016\/j.socnet.2004.11.009","journal-title":"Soc Netw"},{"issue":"1","key":"1098_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep05547","volume":"4","author":"S Pei","year":"2014","unstructured":"Pei S, Muchnik L, Andrade JS Jr et al (2014) Searching for superspreaders of information in real-world social media. Sci Rep 4(1):1\u201312. https:\/\/doi.org\/10.1038\/srep05547","journal-title":"Sci Rep"},{"issue":"7","key":"1098_CR35","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1007\/s10489-018-01398-w","volume":"49","author":"X Rui","year":"2019","unstructured":"Rui X, Meng F, Wang Z et al (2019) A reversed node ranking approach for influence maximization in social networks. Appl Intel 49(7):2684\u20132698. https:\/\/doi.org\/10.1007\/s10489-018-01398-w","journal-title":"Appl Intel"},{"issue":"126","key":"1098_CR36","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.physa.2021.126258","volume":"582","author":"AM Samir","year":"2021","unstructured":"Samir AM, Rady S, Gharib TF (2021) Lkg: A fast scalable community-based approach for influence maximization problem in social networks. Phys A Stat Mech Appl 582(126):258. https:\/\/doi.org\/10.1016\/j.physa.2021.126258","journal-title":"Phys A Stat Mech Appl"},{"key":"1098_CR37","doi-asserted-by":"publisher","unstructured":"Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No. 98TH8360), pp 69\u201373. https:\/\/doi.org\/10.1109\/ICEC.1998.699146","DOI":"10.1109\/ICEC.1998.699146"},{"issue":"108","key":"1098_CR38","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.patcog.2021.108130","volume":"120","author":"PG Sun","year":"2021","unstructured":"Sun PG, Miao Q, Staab S (2021) Community-based k-shell decomposition for identifying influential spreaders. Patt Recogn 120(108):130. https:\/\/doi.org\/10.1016\/j.patcog.2021.108130","journal-title":"Patt Recogn"},{"key":"1098_CR39","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","volume":"160","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R, Yao Y et al (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowledge-Based Syst 160:88\u2013103. https:\/\/doi.org\/10.1016\/j.knosys.2018.06.013","journal-title":"Knowledge-Based Syst"},{"issue":"104","key":"1098_CR40","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P et al (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowledge-Based Syst 187(104):833. https:\/\/doi.org\/10.1016\/j.knosys.2019.07.004","journal-title":"Knowledge-Based Syst"},{"key":"1098_CR41","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.future.2018.04.026","volume":"88","author":"Y Wang","year":"2018","unstructured":"Wang Y, Dong W, Dong X (2018) A novel it\u00f6 algorithm for influence maximization in the large-scale social networks. Fut Gene Comput Syst 88:755\u2013763. https:\/\/doi.org\/10.1016\/j.future.2018.04.026","journal-title":"Fut Gene Comput Syst"},{"issue":"6","key":"1098_CR42","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1109\/TEVC.2021.3081478","volume":"25","author":"L Wang","year":"2021","unstructured":"Wang L, Ma L, Wang C et al (2021) Identifying influential spreaders in social networks through discrete moth-flame optimization. IEEE Trans Evolut Comput 25(6):1091\u20131102. https:\/\/doi.org\/10.1109\/TEVC.2021.3081478","journal-title":"IEEE Trans Evolut Comput"},{"issue":"126","key":"1098_CR43","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.physa.2021.126535","volume":"588","author":"Y Wang","year":"2022","unstructured":"Wang Y, Zheng Y, Shi X et al (2022) An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks. Phys A Stat Mech Appl 588(126):535. https:\/\/doi.org\/10.1016\/j.physa.2021.126535","journal-title":"Phys A Stat Mech Appl"},{"key":"1098_CR44","doi-asserted-by":"publisher","unstructured":"Wang Y, Cong G, Song G, et\u00a0al (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1039\u20131048. https:\/\/doi.org\/10.1145\/1835804.1835935","DOI":"10.1145\/1835804.1835935"},{"issue":"2","key":"1098_CR45","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.ipm.2022.103161","volume":"60","author":"M Xie","year":"2023","unstructured":"Xie M, Zhan XX, Liu C et al (2023) An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs. Inf Process Manag 60(2):103\u2013161. https:\/\/doi.org\/10.1016\/j.ipm.2022.103161","journal-title":"Inf Process Manag"},{"issue":"19","key":"1098_CR46","first-page":"93","volume":"30","author":"PL Yang","year":"2020","unstructured":"Yang PL, Xu GQ, Yu Q et al (2020) An adaptive heuristic clustering algorithm for influence maximization in complex networks. Chaos Interdiscipl J Nonlinear Sci 30(19):93\u2013106","journal-title":"Chaos Interdiscipl J Nonlinear Sci"},{"key":"1098_CR47","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2017.10.018","volume":"93","author":"A Zareie","year":"2018","unstructured":"Zareie A, Sheikhahmadi A (2018) A hierarchical approach for influential node ranking in complex social networks. Exp Syst Appl 93:200\u2013211. https:\/\/doi.org\/10.1016\/j.eswa.2017.10.018","journal-title":"Exp Syst Appl"},{"issue":"27","key":"1098_CR48","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1038\/srep27823","volume":"6","author":"J Zhang","year":"2016","unstructured":"Zhang J, Chen D, Dong Q et al (2016) Identifying a set of influential spreaders in complex networks. Sci Rep 6(27):823. https:\/\/doi.org\/10.1038\/srep27823","journal-title":"Sci Rep"},{"issue":"101","key":"1098_CR49","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1016\/j.is.2021.101828","volume":"102","author":"S Zhang","year":"2021","unstructured":"Zhang S, Zeng X, Tang B (2021) Rcelf: a residual-based approach for influence maximization problem. Inf Syst 102(101):828. https:\/\/doi.org\/10.1016\/j.is.2021.101828","journal-title":"Inf Syst"},{"key":"1098_CR50","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","volume":"278","author":"T Zhu","year":"2014","unstructured":"Zhu T, Wang B, Wu B et al (2014) Maximizing the spread of influence ranking in social networks. Inf Sci 278:535\u2013544. https:\/\/doi.org\/10.1016\/j.ins.2014.03.070","journal-title":"Inf Sci"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01098-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-023-01098-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01098-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T21:40:44Z","timestamp":1702590044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-023-01098-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,27]]},"references-count":50,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["1098"],"URL":"https:\/\/doi.org\/10.1007\/s13278-023-01098-5","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,27]]},"assertion":[{"value":"6 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":4,"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 competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"94"}}