{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T12:19:54Z","timestamp":1783081194683,"version":"3.54.6"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"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":["Computing"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00607-023-01159-9","type":"journal-article","created":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T15:59:08Z","timestamp":1674835148000},"page":"1547-1569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Identification of best social media influencers using ICIRS model"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1227-8299","authenticated-orcid":false,"given":"Kalyanee","family":"Devi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rohit","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,27]]},"reference":[{"issue":"1","key":"1159_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3155897","volume":"51","author":"MA Al-Garadi","year":"2018","unstructured":"Al-Garadi MA, Varathan KD, Ravana SD et al (2018) Analysis of online social network connections for identification of influential users: survey and open research issues. ACM Comput Surveys (CSUR) 51(1):1\u201337. https:\/\/doi.org\/10.1145\/3155897","journal-title":"ACM Comput Surveys (CSUR)"},{"key":"1159_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ins.2020.03.060","volume":"527","author":"M Alshahrani","year":"2020","unstructured":"Alshahrani M, Fuxi Z, Sameh A et al (2020) Efficient algorithms based on centrality measures for identification of top-k influential users in social networks. Inf Sci 527:88\u2013107. https:\/\/doi.org\/10.1016\/j.ins.2020.03.060","journal-title":"Inf Sci"},{"key":"1159_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"S Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019) Combim: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl 125:1\u201313. https:\/\/doi.org\/10.1016\/j.eswa.2019.01.070","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1159_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP (2006) Identifying sets of key players in a social network. Comput Math Organ Theory 12(1):21\u201334. https:\/\/doi.org\/10.1007\/s10588-006-7084-x","journal-title":"Comput Math Organ Theory"},{"key":"1159_CR5","volume-title":"Analyzing social networks","author":"SP Borgatti","year":"2018","unstructured":"Borgatti SP, Everett MG, Johnson JC (2018) Analyzing social networks. Sage, London"},{"issue":"6","key":"1159_CR6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111. https:\/\/doi.org\/10.1103\/PhysRevE.70.066111","journal-title":"Phys Rev E"},{"key":"1159_CR7","doi-asserted-by":"publisher","unstructured":"Devi K, Tripathi R (2020) Information diffusion within a limited budget using node centralities and community detection. In: 2020 21st Asia-Pacific network operations and management symposium (APNOMS), IEEE, pp 197\u2013202, https:\/\/doi.org\/10.23919\/APNOMS50412.2020.9236993","DOI":"10.23919\/APNOMS50412.2020.9236993"},{"issue":"122","key":"1159_CR8","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.physa.2019.122921","volume":"546","author":"Q Ding","year":"2020","unstructured":"Ding Q, Li W, Hu X et al (2020) The sis diffusion process in complex networks with independent spreaders. Phys A 546(122):921. https:\/\/doi.org\/10.1016\/j.physa.2019.122921","journal-title":"Phys A"},{"key":"1159_CR9","doi-asserted-by":"publisher","unstructured":"Dong J, Ye F, Chen W, et\u00a0al (2018) Identifying influential nodes in complex networks via semi-local centrality. In: 2018 IEEE international symposium on circuits and systems (ISCAS), IEEE, pp 1\u20135. https:\/\/doi.org\/10.1109\/ISCAS.2018.8351889","DOI":"10.1109\/ISCAS.2018.8351889"},{"issue":"11","key":"1159_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5677","volume":"32","author":"M Gao","year":"2020","unstructured":"Gao M, Xu L, Lin L et al (2020) Influence maximization based on activity degree in mobile social networks. Concurr Comput Pract Exp 32(11):e5677. https:\/\/doi.org\/10.1002\/cpe.5677","journal-title":"Concurr Comput Pract Exp"},{"issue":"6","key":"1159_CR11","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":"1159_CR12","doi-asserted-by":"crossref","unstructured":"Gruhl D, Guha R, Liben-Nowell D, et\u00a0al (2004) Information diffusion through blogspace. In: Proceedings of the 13th international conference on World Wide Web, pp 491\u2013501","DOI":"10.1145\/988672.988739"},{"key":"1159_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2018.12.043","volume":"122","author":"L Jain","year":"2019","unstructured":"Jain L, Katarya R (2019) Discover opinion leader in online social network using firefly algorithm. Expert Syst Appl 122:1\u201315. https:\/\/doi.org\/10.1016\/j.eswa.2018.12.043","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1159_CR14","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.1016\/j.chaos.2006.04.022","volume":"34","author":"Y Jin","year":"2007","unstructured":"Jin Y, Wang W, Xiao S (2007) An sirs model with a nonlinear incidence rate. Chaos Solitons Fractals 34(5):1482\u20131497. https:\/\/doi.org\/10.1016\/j.chaos.2006.04.022","journal-title":"Chaos Solitons Fractals"},{"key":"1159_CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.amc.2013.12.164","volume":"231","author":"K Kandhway","year":"2014","unstructured":"Kandhway K, Kuri J (2014) How to run a campaign: optimal control of sis and sir information epidemics. Appl Math Comput 231:79\u201392","journal-title":"Appl Math Comput"},{"key":"1159_CR16","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":"1159_CR17","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1007\/s11227-020-03355-2","volume":"77","author":"MMD Khomami","year":"2021","unstructured":"Khomami MMD, Rezvanian A, Meybodi MR et al (2021) Cfin: a community-based algorithm for finding influential nodes in complex social networks. J Supercomput 77:2207\u20132236. https:\/\/doi.org\/10.1007\/s11227-020-03355-2","journal-title":"J Supercomput"},{"issue":"11","key":"1159_CR18","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"},{"key":"1159_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-021-00960-8","author":"S Kumar","year":"2021","unstructured":"Kumar S, Lohia D, Pratap D et al (2021) Mder: modified degree with exclusion ratio algorithm for influence maximisation in social networks. Computing. https:\/\/doi.org\/10.1007\/s00607-021-00960-8","journal-title":"Computing"},{"key":"1159_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Transactions on the Web (TWEB) 1(1):5\u2013es","DOI":"10.1145\/1232722.1232727"},{"issue":"10","key":"1159_CR21","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 et al (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872. https:\/\/doi.org\/10.1109\/TKDE.2018.2807843","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"1159_CR22","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/TCNS.2019.2963488","volume":"7","author":"F Liu","year":"2020","unstructured":"Liu F, Buss M (2020) Optimal control for heterogeneous node-based information epidemics over social networks. IEEE Trans Control Network Syst 7(3):1115\u20131126. https:\/\/doi.org\/10.1109\/TCNS.2019.2963488","journal-title":"IEEE Trans Control Network Syst"},{"key":"1159_CR23","doi-asserted-by":"publisher","first-page":"5091","DOI":"10.1109\/ACCESS.2019.2962751","volume":"8","author":"J Ma","year":"2019","unstructured":"Ma J, Fan J (2019) Local optimization for clique-based overlapping community detection in complex networks. IEEE Access 8:5091\u20135103. https:\/\/doi.org\/10.1109\/ACCESS.2019.2962751","journal-title":"IEEE Access"},{"key":"1159_CR24","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 et al (2020) Lgiem: global and local node influence based community detection. Futur Gener Comput Syst 105:533\u2013546. https:\/\/doi.org\/10.1016\/j.future.2019.12.022","journal-title":"Futur Gener Comput Syst"},{"key":"1159_CR25","doi-asserted-by":"publisher","DOI":"10.5121\/csit.2015.51501","author":"N Meghanathan","year":"2015","unstructured":"Meghanathan N (2015) Use of eigenvector centrality to detect graph isomorphism. Comput Sci Inf Technol. https:\/\/doi.org\/10.5121\/csit.2015.51501","journal-title":"Comput Sci Inf Technol"},{"key":"1159_CR26","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.knosys.2015.04.007","volume":"84","author":"P Moradi","year":"2015","unstructured":"Moradi P, Rostami M (2015) Integration of graph clustering with ant colony optimization for feature selection. Knowl Based Syst 84:144\u2013161. https:\/\/doi.org\/10.1016\/j.knosys.2015.04.007","journal-title":"Knowl Based Syst"},{"issue":"2","key":"1159_CR27","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.aci.2017.11.001","volume":"15","author":"JS More","year":"2019","unstructured":"More JS, Lingam C (2019) A si model for social media influencer maximization. Appl Comput Inf 15(2):102\u2013108. https:\/\/doi.org\/10.1016\/j.aci.2017.11.001","journal-title":"Appl Comput Inf"},{"issue":"23","key":"1159_CR28","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proc Natl Acad Sci"},{"issue":"3","key":"1159_CR29","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3233\/FI-2014-994","volume":"130","author":"SK Pal","year":"2014","unstructured":"Pal SK, Kundu S, Murthy C (2014) Centrality measures, upper bound, and influence maximization in large scale directed social networks. Fund Inf 130(3):317\u2013342. https:\/\/doi.org\/10.3233\/FI-2014-994","journal-title":"Fund Inf"},{"key":"1159_CR30","doi-asserted-by":"publisher","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 61\u201370. https:\/\/doi.org\/10.1145\/775047.775057","DOI":"10.1145\/775047.775057"},{"key":"1159_CR31","doi-asserted-by":"publisher","unstructured":"Saadatniaki F, Khan UA (2018) Product adoption in heterogeneous networks: An epidemiological perspective. In: 2018 52nd Asilomar Conference on Signals, Systems, and Computers, IEEE, pp 1043\u20131047. https:\/\/doi.org\/10.1109\/ACSSC.2018.8645221","DOI":"10.1109\/ACSSC.2018.8645221"},{"key":"1159_CR32","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.physa.2017.12.087","volume":"496","author":"C Salavati","year":"2018","unstructured":"Salavati C, Abdollahpouri A, Manbari Z (2018) Bridgerank: a novel fast centrality measure based on local structure of the network. Phys A 496:635\u2013653. https:\/\/doi.org\/10.1016\/j.physa.2017.12.087","journal-title":"Phys A"},{"key":"1159_CR33","doi-asserted-by":"publisher","unstructured":"Shaji A, Belfin R, Kanaga EGM (2018) An innovated sirs model for information spreading. In: Advances in big data and cloud computing. Springer, p 405\u2013413. https:\/\/doi.org\/10.1007\/978-981-10-7200-0_37","DOI":"10.1007\/978-981-10-7200-0_37"},{"key":"1159_CR34","unstructured":"Sztrik J et al (2012) Basic queueing theory. University of Debrecen, Faculty of Informatics 193:60\u201367"},{"key":"1159_CR35","doi-asserted-by":"publisher","first-page":"7390","DOI":"10.1109\/ACCESS.2018.2794324","volume":"6","author":"MM Tulu","year":"2018","unstructured":"Tulu MM, Hou R, Younas T (2018) Identifying influential nodes based on community structure to speed up the dissemination of information in complex network. IEEE Access 6:7390\u20137401. https:\/\/doi.org\/10.1109\/ACCESS.2018.2794324","journal-title":"IEEE Access"},{"key":"1159_CR36","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.ins.2020.07.061","volume":"546","author":"Y Wang","year":"2021","unstructured":"Wang Y, Wang J, Wang H et al (2021) Users\u2019 mobility enhances information diffusion in online social networks. Inf Sci 546:329\u2013348. https:\/\/doi.org\/10.1016\/j.ins.2020.07.061","journal-title":"Inf Sci"},{"issue":"1","key":"1159_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40064-016-1675-x","volume":"5","author":"J Woo","year":"2016","unstructured":"Woo J, Chen H (2016) Epidemic model for information diffusion in web forums: experiments in marketing exchange and political dialog. Springerplus 5(1):1\u201319. https:\/\/doi.org\/10.1186\/s40064-016-1675-x","journal-title":"Springerplus"},{"issue":"1","key":"1159_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10660-018-9316-9","volume":"20","author":"L Zhang","year":"2020","unstructured":"Zhang L, Luo M, Boncella RJ (2020) Product information diffusion in a social network. Electron Commer Res 20(1):3\u201319. https:\/\/doi.org\/10.1007\/s10660-018-9316-9","journal-title":"Electron Commer Res"},{"issue":"16","key":"1159_CR39","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1016\/j.physa.2013.03.035","volume":"392","author":"Z Zhu","year":"2013","unstructured":"Zhu Z (2013) Discovering the influential users oriented to viral marketing based on online social networks. Phys A 392(16):3459\u20133469. https:\/\/doi.org\/10.1016\/j.physa.2013.03.035","journal-title":"Phys A"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01159-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01159-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01159-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T18:56:52Z","timestamp":1701802612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01159-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,27]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1159"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01159-9","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,27]]},"assertion":[{"value":"17 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}