{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T14:25:42Z","timestamp":1774362342745,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"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-024-01244-7","type":"journal-article","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T05:01:31Z","timestamp":1712898091000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["CLUS-BET: improving influence propagation and classification in networks using a novel seed selection technique"],"prefix":"10.1007","volume":"14","author":[{"given":"Rahul","family":"Saxena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranjal","family":"Paira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahipal","family":"Jadeja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"issue":"1\u20132","key":"1244_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02464422","volume":"53","author":"RM Anderson","year":"1991","unstructured":"Anderson RM (1991) Discussion: the Kermack\u2013McKendrick epidemic threshold theorem. Bull Math Biol 53(1\u20132):1","journal-title":"Bull Math Biol"},{"key":"1244_CR32","doi-asserted-by":"crossref","unstructured":"Ahuja V (2021) Transforming the media and entertainment industry: Cases from the social media marketing world. J Cases Inf Technol (JCIT) 23(4):1\u201317","DOI":"10.4018\/JCIT.296255"},{"issue":"2","key":"1244_CR2","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/s11390-018-1820-9","volume":"33","author":"M Azaouzi","year":"2018","unstructured":"Azaouzi M, Romdhane LB (2018) An efficient two-phase model for computing influential nodes in social networks using social actions. J Comput Sci Technol 33(2):286\u2013304","journal-title":"J Comput Sci Technol"},{"key":"1244_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100393","volume":"40","author":"M Azaouzi","year":"2021","unstructured":"Azaouzi M, Mnasri W, Romdhane LB (2021) New trends in influence maximization models. Comput Sci Rev 40:100393","journal-title":"Comput Sci Rev"},{"issue":"2","key":"1244_CR4","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1038\/s41562-018-0510-5","volume":"3","author":"JP Bagrow","year":"2019","unstructured":"Bagrow JP, Liu X, Mitchell L (2019) Information flow reveals prediction limits in online social activity. Nat Hum Behav 3(2):122\u2013128","journal-title":"Nat Hum Behav"},{"key":"1244_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.socnet.2015.08.003","volume":"44","author":"U Brandes","year":"2016","unstructured":"Brandes U, Borgatti SP, Freeman LC (2016) Maintaining the duality of closeness and betweenness centrality. Soc Netw 44:153\u2013159","journal-title":"Soc Netw"},{"issue":"3","key":"1244_CR6","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1111\/stan.12203","volume":"74","author":"T Britton","year":"2020","unstructured":"Britton T (2020) Epidemic models on social networks\u2014with inference. Statistica Neerlandica 74(3):222\u2013241","journal-title":"Statistica Neerlandica"},{"key":"1244_CR7","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.ins.2020.08.093","volume":"546","author":"A Cali\u00f2","year":"2021","unstructured":"Cali\u00f2 A, Tagarelli A (2021) Attribute based diversification of seeds for targeted influence maximization. Inf Sci 546:1273\u20131305","journal-title":"Inf Sci"},{"issue":"12","key":"1244_CR8","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.1109\/TKDE.2018.2820010","volume":"30","author":"A Cali\u00f2","year":"2018","unstructured":"Cali\u00f2 A, Interdonato R, Pulice C, Tagarelli A (2018) Topology-driven diversity for targeted influence maximization with application to user engagement in social networks. IEEE Trans Knowl Data Eng 30(12):2421\u20132434","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"29","key":"1244_CR9","doi-asserted-by":"publisher","first-page":"8237","DOI":"10.1088\/1751-8113\/40\/29\/003","volume":"40","author":"YW Chen","year":"2007","unstructured":"Chen YW, Zhang LF, Huang JP (2007) The Watts\u2013Strogatz network model developed by including degree distribution: theory and computer simulation. J Phys A: Math Theor 40(29):8237","journal-title":"J Phys A: Math Theor"},{"key":"1244_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105265","volume":"191","author":"J Ding","year":"2020","unstructured":"Ding J, Sun W, Wu J, Guo Y (2020) Influence maximization based on the realistic independent cascade model. Knowl Based Syst 191:105265","journal-title":"Knowl Based Syst"},{"key":"1244_CR11","doi-asserted-by":"crossref","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","DOI":"10.1145\/502512.502525"},{"issue":"3","key":"1244_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3):211\u2013223","journal-title":"Mark Lett"},{"key":"1244_CR13","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining, pp 211\u2013220. IEEE","DOI":"10.1109\/ICDM.2011.132"},{"key":"1244_CR14","unstructured":"Grafstr\u00f6m J, Jakobsson L, Wiede P (2018) The impact of influencer marketing on consumers\u2019 attitudes by Influencer Marketing\nin Sweden. J\u00f6nk\u00f6ping University, School of Business and Economics"},{"issue":"6","key":"1244_CR15","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443","journal-title":"Am J Sociol"},{"key":"1244_CR16","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the 31st international conference on neural information processing systems, pp 1025\u20131035"},{"key":"1244_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jnca.2018.10.003","volume":"125","author":"V Indu","year":"2019","unstructured":"Indu V, Thampi SM (2019) A nature-inspired approach based on forest fire model for modeling rumor propagation in social networks. J Netw Comput Appl 125:28\u201341","journal-title":"J Netw Comput Appl"},{"key":"1244_CR18","doi-asserted-by":"publisher","DOI":"10.26483\/ijarcs.v8i3.2998","author":"M Kaur","year":"2017","unstructured":"Kaur M, Kaur H (2017) Implementation of enhanced graph layout algorithm for visualizing social network data using networkx library. Int J Adv Res Comput Sci. https:\/\/doi.org\/10.26483\/ijarcs.v8i3.2998","journal-title":"Int J Adv Res Comput Sci"},{"key":"1244_CR19","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"},{"key":"1244_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114168","volume":"167","author":"S Kianian","year":"2021","unstructured":"Kianian S, Rostamnia M (2021) An efficient path-based approach for influence maximization in social networks. Expert Syst Appl 167:114168","journal-title":"Expert Syst Appl"},{"key":"1244_CR21","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. arXiv preprint arXiv:1611.07308"},{"key":"1244_CR22","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International conference on learning representations"},{"issue":"9","key":"1244_CR23","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1109\/TKDE.2015.2419666","volume":"27","author":"N Kourtellis","year":"2015","unstructured":"Kourtellis N, Morales GDF, Bonchi F (2015) Scalable online betweenness centrality in evolving graphs. IEEE Trans Knowl Data Eng 27(9):2494\u20132506","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1244_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1177\/0091026019859906","volume":"49","author":"HW Kwon","year":"2020","unstructured":"Kwon HW (2020) Performance appraisal politics in the public sector: the effects of political skill and social similarity on performance rating. Public Pers Manag 49(2):239\u2013261","journal-title":"Public Pers Manag"},{"key":"1244_CR25","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":"1244_CR26","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.neucom.2017.03.003","volume":"260","author":"D Li","year":"2017","unstructured":"Li D, Wang C, Zhang S, Zhou G, Chu D, Wu C (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69\u201378","journal-title":"Neurocomputing"},{"issue":"10","key":"1244_CR27","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan K-L (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1244_CR28","doi-asserted-by":"crossref","unstructured":"Li Y, Chen W, Wang Y, Zhang Z-L (2013) Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the sixth ACM international conference on web search and data mining, pp 657\u2013666","DOI":"10.1145\/2433396.2433478"},{"key":"1244_CR29","doi-asserted-by":"crossref","unstructured":"Li Q, Han Z, Wu X-M (2018) Deeper insights into graph convolutional networks for semi-supervised learning. In: Thirty-Second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"1244_CR30","doi-asserted-by":"crossref","unstructured":"Li Y, Qiu B, Chen Y, Zhao HV (2019) Analysis of information diffusion with irrational users: a graphical evolutionary game approach. In: ICASSP 2019\u20132019 IEEE international conference on acoustics, speech and signal processing (ICASSP), IEEE. pp 2527\u20132531","DOI":"10.1109\/ICASSP.2019.8682973"},{"key":"1244_CR31","doi-asserted-by":"crossref","unstructured":"Padmanabhan MR. Somisetty N, Basu S, Pavan A (2018) Influence maximization in social networks with non-target constraints. In: 2018 IEEE international conference on big data (big data), pp 771\u2013780. IEEE","DOI":"10.1109\/BigData.2018.8621973"},{"issue":"3","key":"1244_CR33","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","volume":"42","author":"K Rahimkhani","year":"2015","unstructured":"Rahimkhani K, Aleahmad A, Rahgozar M, Moeini A (2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst Appl 42(3):1353\u20131361","journal-title":"Expert Syst Appl"},{"key":"1244_CR34","volume-title":"Management and the worker","author":"FJ Roethlisberger","year":"2003","unstructured":"Roethlisberger FJ, Dickson WJ (2003) Management and the worker, vol 5. Psychology Press, London"},{"key":"1244_CR35","doi-asserted-by":"crossref","unstructured":"Saxena A, Gera R, Iyengar S (2017) A faster method to estimate closeness centrality ranking. arXiv preprint arXiv:1706.02083","DOI":"10.1145\/3110025.3110064"},{"key":"1244_CR36","doi-asserted-by":"crossref","unstructured":"Saxena R, Jadeja M (2022) Network centrality measures: role and importance in social networks. In: Principles of social networking. Springer, Berlin, pp. 29\u201354","DOI":"10.1007\/978-981-16-3398-0_2"},{"key":"1244_CR37","doi-asserted-by":"crossref","unstructured":"Saxena R, Jadeja M, Bhateja V (2021) Propagation analysis of Covid-19: an sir model-based investigation of the pandemic. Arab J Sci Eng pp 1\u201313","DOI":"10.1007\/978-981-19-4175-7_3"},{"key":"1244_CR38","unstructured":"Shchur O, Mumme M, Bojchevski A, G\u00fcnnemann S (2018) Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868"},{"key":"1244_CR39","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.procs.2020.06.037","volume":"173","author":"N Trivedi","year":"2020","unstructured":"Trivedi N, Singh A (2020) Efficient influence maximization in social-networks under independent cascade model. Procedia Comput Sci 173:315\u2013324","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"1244_CR40","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s12145-023-00940-w","volume":"16","author":"A Utku","year":"2023","unstructured":"Utku A, Can U, Aslan S (2023) Detection of hateful twitter users with graph convolutional network model. Earth Sci Inf 16(1):329\u2013343","journal-title":"Earth Sci Inf"},{"key":"1244_CR41","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"1244_CR42","unstructured":"Wang H, Leskovec J (2020) Unifying graph convolutional neural networks and label propagation. arXiv preprint arXiv:2002.06755"},{"key":"1244_CR43","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019-networks. Nature 393:440\u2013442","journal-title":"Nature"},{"issue":"1","key":"1244_CR44","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"3","key":"1244_CR45","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1007\/s12559-021-09822-z","volume":"14","author":"H Xu","year":"2022","unstructured":"Xu H, Jiang B, Ding C (2022) MVINF: social influence prediction with multi-view graph attention learning. Cogn Comput 14(3):1182\u20131188","journal-title":"Cogn Comput"},{"key":"1244_CR46","doi-asserted-by":"crossref","unstructured":"Yin C, Yuan M (2022) GCN-based text classification research. In: International conference on artificial intelligence and security, Springer, Berlin. pp 55\u201366","DOI":"10.1007\/978-3-031-06761-7_5"},{"key":"1244_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-019-0069-y","volume":"6","author":"S Zhang","year":"2019","unstructured":"Zhang S, Tong H, Xu J, Maciejewski R (2019) Graph convolutional networks: a comprehensive review. Comput Soc Netw 6:1\u201323","journal-title":"Comput Soc Netw"},{"key":"1244_CR48","doi-asserted-by":"crossref","unstructured":"Zhang W, Yang Z, Wang Y, Shen Y, Li Y, Wang L, Cui B (2021) Grain: improving data efficiency of graph neural networks via diversified influence maximization. arXiv preprint arXiv:2108.00219","DOI":"10.14778\/3476249.3476295"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01244-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-024-01244-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01244-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T14:20:51Z","timestamp":1740493251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-024-01244-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,12]]},"references-count":48,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1244"],"URL":"https:\/\/doi.org\/10.1007\/s13278-024-01244-7","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,12]]},"assertion":[{"value":"27 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2024","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 declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The reported work does not involve any experiment over any animals or human beings and, hence, not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}],"article-number":"81"}}