{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:28:09Z","timestamp":1775017689743,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"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":["J Supercomput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11227-024-06217-3","type":"journal-article","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T07:02:18Z","timestamp":1716966138000},"page":"19898-19941","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Influence maximization in community-structured social networks: a centrality-based approach"],"prefix":"10.1007","volume":"80","author":[{"given":"Maitreyee","family":"Ganguly","sequence":"first","affiliation":[]},{"given":"Paramita","family":"Dey","sequence":"additional","affiliation":[]},{"given":"Sarbani","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"6217_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.3390\/info8040118","volume":"8","author":"M Li","year":"2017","unstructured":"Li M, Wang X, Gao K, Zhang S (2017) A survey on information diffusion in online social networks: models and methods. Information 8:118","journal-title":"Information"},{"key":"6217_CR2","doi-asserted-by":"publisher","first-page":"100264","DOI":"10.1016\/j.array.2022.100264","volume":"16","author":"Y Ye","year":"2022","unstructured":"Ye Y, Chen Y, Han W (2022) Influence maximization in social networks: theories, methods and challenges. Array 16:100264","journal-title":"Array"},{"issue":"6","key":"6217_CR3","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, Chang H, He H (2019) Community-based influence maximization for viral marketing. Appl Intell 49(6):2137\u20132150","journal-title":"Appl Intell"},{"issue":"7415","key":"6217_CR4","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, Kramer ADI, Marlow C, Settle JE, Fowler JH (2012) A 61-million-person experiment in social influence and political mobilization. Nature 489(7415):295\u2013298","journal-title":"Nature"},{"key":"6217_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2020.08.030","volume":"840","author":"Q Ni","year":"2020","unstructured":"Ni Q, Guo J, Huang C, Wu W (2020) Community-based rumor blocking maximization in social networks: algorithms and analysis. Theor Comput Sci 840:257\u2013269","journal-title":"Theor Comput Sci"},{"key":"6217_CR6","doi-asserted-by":"publisher","first-page":"101522","DOI":"10.1016\/j.is.2020.101522","volume":"92","author":"J Li","year":"2020","unstructured":"Li J, Cai T, Deng K, Wang X, Sellis T, Xia F (2020) Community-diversified influence maximization in social networks. Inf Syst 92:101522","journal-title":"Inf Syst"},{"key":"6217_CR7","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 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"6217_CR8","doi-asserted-by":"publisher","first-page":"124100","DOI":"10.1016\/j.physa.2019.124100","volume":"551","author":"MA Nedioui","year":"2020","unstructured":"Nedioui MA, Moussaoui A, Saoud B, Babahenini MC (2020) Detecting communities in social networks based on cliques. Phys A Stat Mech Appl 551:124100","journal-title":"Phys A Stat Mech Appl"},{"issue":"12","key":"6217_CR9","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"6217_CR10","doi-asserted-by":"publisher","first-page":"768","DOI":"10.3389\/fphy.2021.806259","volume":"9","author":"J Song","year":"2022","unstructured":"Song J, Feng Z, Qi X (2022) Spreading to localized targets in signed social networks. Front Phys 9:768","journal-title":"Front Phys"},{"key":"6217_CR11","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:10008","journal-title":"J Stat Mech Theory Exp"},{"key":"6217_CR12","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ins.2020.10.057","volume":"551","author":"X Zhao","year":"2021","unstructured":"Zhao X, Liang J, Wang J (2021) A community detection algorithm based on graph compression for large-scale social networks. Inf Sci 551:358\u2013372","journal-title":"Inf Sci"},{"key":"6217_CR13","doi-asserted-by":"publisher","first-page":"125420","DOI":"10.1016\/j.physa.2020.125420","volume":"563","author":"S Aghaalizadeh","year":"2021","unstructured":"Aghaalizadeh S, Afshord ST, Bouyer A, Anari B (2021) A three-stage algorithm for local community detection based on the high node importance ranking in social networks. Phys A Stat Mech Appl 563:125420","journal-title":"Phys A Stat Mech Appl"},{"key":"6217_CR14","first-page":"126012","volume":"401","author":"S Li","year":"2021","unstructured":"Li S, Jiang L, Wu X, Han W, Zhao D, Wang Z (2021) A weighted network community detection algorithm based on deep learning. Appl Math Comput 401:126012","journal-title":"Appl Math Comput"},{"key":"6217_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.ins.2020.01.001","volume":"517","author":"W Luo","year":"2020","unstructured":"Luo W, Lu N, Ni L, Zhu W, Ding W (2020) Local community detection by the nearest nodes with greater centrality. Inf Sci 517:377\u2013392","journal-title":"Inf Sci"},{"key":"6217_CR16","doi-asserted-by":"publisher","first-page":"9919","DOI":"10.1007\/s10489-021-02999-8","volume":"52","author":"K Guo","year":"2022","unstructured":"Guo K, Wang Q, Lin J, Wu L, Guo W, Chao K-M (2022) Network representation learning based on community-aware and adaptive random walk for overlapping community detection. Appl Intell 52:9919\u20139937","journal-title":"Appl Intell"},{"issue":"8","key":"6217_CR17","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1080\/03081079.2020.1786379","volume":"49","author":"D Gamgne","year":"2020","unstructured":"Gamgne D et al (2020) Community structure extraction in directed network using triads. Int J General Syst 49(8):819\u2013842","journal-title":"Int J General Syst"},{"issue":"2","key":"6217_CR18","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1007\/s13369-022-07020-z","volume":"48","author":"SK Gupta","year":"2023","unstructured":"Gupta SK, Singh DP (2023) Seed community identification framework for community detection over social media. Arabian J Sci Eng 48(2):1829\u20131843","journal-title":"Arabian J Sci Eng"},{"key":"6217_CR19","doi-asserted-by":"crossref","unstructured":"Shakarian P, Bhatnagar A, Aleali A, Shaabani E, Guo R (2015) The independent cascade and linear threshold models. In: Diffusion in social networks, pp 35\u201348. Springer","DOI":"10.1007\/978-3-319-23105-1_4"},{"key":"6217_CR20","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1016\/j.ins.2019.10.061","volume":"512","author":"W Ju","year":"2020","unstructured":"Ju W, Chen L, Li B, Liu W, Sheng J, Wang Y (2020) A new algorithm for positive influence maximization in signed networks. Inf Sci 512:1571\u20131591","journal-title":"Inf Sci"},{"key":"6217_CR21","doi-asserted-by":"publisher","first-page":"127314","DOI":"10.1016\/j.physa.2022.127314","volume":"598","author":"F Kazemzadeh","year":"2022","unstructured":"Kazemzadeh F, Safaei AA, Mirzarezaee M (2022) Influence maximization in social networks using effective community detection. Phys A Stat Mech Appl 598:127314","journal-title":"Phys A Stat Mech Appl"},{"key":"6217_CR22","doi-asserted-by":"crossref","unstructured":"Mutlu E\u00c7, Garibay I (2021) The degree-dependent threshold model: towards a better understanding of opinion dynamics on online social networks. In: Proceedings of the 2019 International Conference of The Computational Social Science Society of the Americas, pp 83\u201394. Springer","DOI":"10.1007\/978-3-030-77517-9_7"},{"key":"6217_CR23","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ins.2020.12.091","volume":"558","author":"Q He","year":"2021","unstructured":"He Q, Sun L, Wang X, Wang Z, Huang M, Yi B, Wang Y, Ma L (2021) Positive opinion maximization in signed social networks. Inf Sci 558:34\u201349","journal-title":"Inf Sci"},{"issue":"31","key":"6217_CR24","doi-asserted-by":"publisher","first-page":"15407","DOI":"10.1073\/pnas.1801378116","volume":"116","author":"M Wu","year":"2019","unstructured":"Wu M, He S, Zhang Y, Chen J, Sun Y, Liu Y-Y, Zhang J, Poor HV (2019) A tensor-based framework for studying eigenvector multicentrality in multilayer networks. Proc Natl Acad Sci 116(31):15407\u201315413","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"6217_CR25","doi-asserted-by":"publisher","first-page":"022304","DOI":"10.1103\/PhysRevE.101.022304","volume":"101","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Shao C, He S, Gao J (2020) Resilience centrality in complex networks. Phys Rev E 101(2):022304","journal-title":"Phys Rev E"},{"key":"6217_CR26","doi-asserted-by":"crossref","unstructured":"Complexity (2023) Retracted:: Information Spreading on Memory Activity-Driven Temporal Networks, Hindawi","DOI":"10.1155\/2023\/9847180"},{"key":"6217_CR27","doi-asserted-by":"publisher","first-page":"1239660","DOI":"10.3389\/fphy.2023.1239660","volume":"11","author":"L Zhong","year":"2023","unstructured":"Zhong L et al (2023) Identifying key nodes in complex networks based on an improved gravity model. Front Phys 11:1239660","journal-title":"Front Phys"},{"key":"6217_CR28","doi-asserted-by":"publisher","first-page":"1280537","DOI":"10.3389\/fphy.2023.1280537","volume":"11","author":"L Zhong","year":"2023","unstructured":"Zhong L, Gao X, Zhao L, Zhang L, Chen P, Yang H, Huang J, Pan W (2023) A hybrid influence method based on information entropy to identify the key nodes. Front Phys 11:1280537","journal-title":"Front Phys"},{"key":"6217_CR29","doi-asserted-by":"crossref","unstructured":"Osawa S, Murata T (2015) Selecting seed nodes for influence maximization in dynamic networks. In: Complex Networks VI: Proceedings of the 6th Workshop on Complex Networks CompleNet 2015, pp 91\u201398. Springer","DOI":"10.1007\/978-3-319-16112-9_9"},{"key":"6217_CR30","doi-asserted-by":"crossref","unstructured":"Kazemzadeh F, Safaei AA, Mirzarezaee M (2022) Optimal selection of seed nodes by reducing the influence of common nodes in the influence maximization problem. In: 2022 13th International Conference on Information and Knowledge Technology (IKT), pp 1\u20137. IEEE","DOI":"10.1109\/IKT57960.2022.10039040"},{"issue":"1","key":"6217_CR31","doi-asserted-by":"publisher","first-page":"012045","DOI":"10.1088\/1742-6596\/1746\/1\/012045","volume":"1746","author":"G Nie","year":"2021","unstructured":"Nie G, Tang M (2021) A multi-seed nodes selection strategy for influence maximization based on reinforcement learning algorithms. J Phys Conf Ser 1746(1):012045","journal-title":"J Phys Conf Ser"},{"key":"6217_CR32","doi-asserted-by":"publisher","first-page":"112513","DOI":"10.1016\/j.chaos.2022.112513","volume":"162","author":"Y Wang","year":"2022","unstructured":"Wang Y, Li H, Zhang L, Zhao L, Li W (2022) Identifying influential nodes in social networks: centripetal centrality and seed exclusion approach. Chaos, Solitons & Fractals 162:112513","journal-title":"Chaos, Solitons & Fractals"},{"issue":"1","key":"6217_CR33","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TCSS.2014.2307451","volume":"1","author":"JD Guzman","year":"2014","unstructured":"Guzman JD, Deckro RF, Robbins MJ, Morris JF, Ballester NA (2014) An analytical comparison of social network measures. IEEE Trans Comput Soc Syst 1(1):35\u201345","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"6217_CR34","doi-asserted-by":"crossref","unstructured":"Kosch\u00fctzki D, Lehmann KA, Peeters L, Richter S, Tenfelde-Podehl D, Zlotowski O (2005) Network analysis: methodological foundations. In: Centrality indices, pp 16\u201361. Springer","DOI":"10.1007\/978-3-540-31955-9_3"},{"key":"6217_CR35","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, pp 88\u201397. IEEE","DOI":"10.1109\/ICDM.2010.118"},{"issue":"4","key":"6217_CR36","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"6217_CR37","doi-asserted-by":"crossref","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification, Vol 1, No 3, pp 215\u2013239, Social networks","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"6217_CR38","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman M (2010) Networks: an introduction. Oxford University Press, Oxford"},{"issue":"1","key":"6217_CR39","doi-asserted-by":"publisher","first-page":"2-es","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 Discov Data (TKDD) 1(1):2-es","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"6217_CR40","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM \u201920), pp 1325-1334. ACM","DOI":"10.1145\/3340531.3411866"},{"key":"6217_CR41","doi-asserted-by":"publisher","first-page":"129083","DOI":"10.1016\/j.physa.2023.129083","volume":"626","author":"CG Fink","year":"2023","unstructured":"Fink CG et al (2023) A centrality measure for quantifying spread on weighted, directed networks. Physica A 626:129083","journal-title":"Physica A"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06217-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06217-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06217-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:25:28Z","timestamp":1721903128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06217-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,29]]},"references-count":41,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6217"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06217-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,29]]},"assertion":[{"value":"9 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}