{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T08:49:15Z","timestamp":1771922955243,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T00:00:00Z","timestamp":1624492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T00:00:00Z","timestamp":1624492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11227-021-03947-6","type":"journal-article","created":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T11:03:51Z","timestamp":1624532631000},"page":"2098-2124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["NodeRank: Finding influential nodes in social networks based on interests"],"prefix":"10.1007","volume":"78","author":[{"given":"Mohammed","family":"Bahutair","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2285-953X","authenticated-orcid":false,"given":"Zaher","family":"Al Aghbari","sequence":"additional","affiliation":[]},{"given":"Ibrahim","family":"Kamel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,24]]},"reference":[{"key":"3947_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.asoc.2017.11.014","volume":"63","author":"A Said","year":"2018","unstructured":"Said A, Abbasi RA, Maqbool O, Daud A, Aljohani NR (2018) Cc-ga: A clustering coefficient based genetic algorithm for detecting communities in social networks. Appl Soft Comput 63:59\u201370","journal-title":"Appl Soft Comput"},{"key":"3947_CR2","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.knosys.2018.09.002","volume":"163","author":"Z Zhao","year":"2019","unstructured":"Zhao Z, Li C, Zhang X, Chiclana F, Viedma EH (2019) An incremental method to detect communities in dynamic evolving social networks. Knowl-Based Syst 163:404\u2013415","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"3947_CR3","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, Ahmed E, Mujtaba G, Khan MUS, Khan SU (2018) Analysis of online social network connections for identification of influential users: Survey and open research issues. ACM Comput Surv (CSUR) 51(1):1\u201337","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2021","key":"3947_CR4","first-page":"2207","volume":"77","author":"MMD Khomami","year":"2020","unstructured":"Khomami MMD, Rezvanian A, Meybodi MR, Bagheri A (2020) Cfin: A community-based algorithm for finding influential nodes in complex social networks. J Supercomput 77(2021):2207\u20132236","journal-title":"J Supercomput"},{"issue":"10","key":"3947_CR5","first-page":"95","volume":"10","author":"M Zaharia","year":"2010","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: Cluster computing with working sets. HotCloud 10(10):95","journal-title":"HotCloud"},{"key":"3947_CR6","first-page":"357","volume-title":"The importance of social capital in building community resilience","author":"DP Aldrich","year":"2017","unstructured":"Aldrich DP (2017) The importance of social capital in building community resilience. Springer, Cham, pp 357\u2013364"},{"key":"3947_CR7","doi-asserted-by":"crossref","unstructured":"Al Aghbari Z, Bahutair M, Kamel I (2019) \u201cGeosimmr: A mapreduce algorithm for detecting communities based on distance and interest in social networks,\u201d Data Science Journal, 18(1),","DOI":"10.5334\/dsj-2019-013"},{"key":"3947_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.chb.2017.02.054","volume":"72","author":"LV Huang","year":"2017","unstructured":"Huang LV, Liu PL (2017) Ties that work: Investigating the relationships among coworker connections, work-related facebook utility, online social capital, and employee outcomes. Comput Hum Behav 72:512\u2013524","journal-title":"Comput Hum Behav"},{"key":"3947_CR9","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) \u201cMining knowledge-sharing sites for viral marketing,\u201d in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp. 61\u201370","DOI":"10.1145\/775047.775057"},{"issue":"4","key":"3947_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2015) Maximizing the spread of influence through a social network. Theory Comput 11(4):105\u2013147","journal-title":"Theory Comput"},{"key":"3947_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-23105-1_4","volume-title":"Diffusion in Social Networks","author":"P Shakarian","year":"2015","unstructured":"Shakarian P, Bhatnagar A, Aleali A, Shaabani E, Guo R (2015) The independent cascade and linear threshold models. Diffusion in Social Networks. Springer, Cham, pp 35\u201348"},{"issue":"1","key":"3947_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130\u2013147","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"3947_CR13","doi-asserted-by":"crossref","unstructured":"Papapetrou P, Gionis A, Mannila H (2011) \u201cA shapley value approach for influence attribution,\u201d in Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, pp. 549\u2013564","DOI":"10.1007\/978-3-642-23783-6_35"},{"key":"3947_CR14","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) \u201cEfficient influence maximization in social networks,\u201d in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp. 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"3947_CR15","doi-asserted-by":"crossref","unstructured":"Ben-Zwi O, Hermelin D, Lokshtanov D, Newman I (2009) \u201cAn exact almost optimal algorithm for target set selection in social networks,\u201d in Proceedings of the 10th ACM conference on Electronic commerce. ACM, pp. 355\u2013362","DOI":"10.1145\/1566374.1566424"},{"issue":"3","key":"3947_CR16","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen N (2009) On the approximability of influence in social networks. SIAM J Discrete Math 23(3):1400\u20131415","journal-title":"SIAM J Discrete Math"},{"key":"3947_CR17","doi-asserted-by":"crossref","unstructured":"Singer Y (2012)\u201cHow to win friends and influence people, truthfully: influence maximization mechanisms for social networks,\u201d in Proceedings of the fifth ACM international conference on Web search and data mining. ACM, pp. 733\u2013742","DOI":"10.1145\/2124295.2124381"},{"key":"3947_CR18","unstructured":"Khorasgani RR, Chen J, Za\u00efane OR (2010) \u201cTop leaders community detection approach in information networks,\u201d in 4th SNA-KDD Workshop on Social Network Mining and Analysis. Citeseer, Washington DC"},{"issue":"1","key":"3947_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1049\/trit.2019.0040","volume":"5","author":"R Hosseini","year":"2020","unstructured":"Hosseini R, Rezvanian A (2020) Antlp: ant-based label propagation algorithm for community detection in social networks. CAAI Trans Intell Technol 5(1):34\u201341","journal-title":"CAAI Trans Intell Technol"},{"key":"3947_CR20","doi-asserted-by":"crossref","unstructured":"Li X, Cao C, Zhang T (2020) \u201cBlock diagonal dominance-based dynamic programming for detecting community,\u201d The Journal of Supercomputing, pp. 1\u201314","DOI":"10.1007\/s11227-020-03151-y"},{"key":"3947_CR21","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2008) \u201cDiscovering leaders from community actions,\u201d in Proceedings of the 17th ACM conference on Information and knowledge management. ACM, pp. 499\u2013508","DOI":"10.1145\/1458082.1458149"},{"key":"3947_CR22","doi-asserted-by":"crossref","unstructured":"Agarwal N, Liu H, Tang L, Yu PS (2008) \u201cIdentifying the influential bloggers in a community,\u201d in Proceedings of the 2008 international conference on web search and data mining. ACM, pp. 207\u2013218","DOI":"10.1145\/1341531.1341559"},{"key":"3947_CR23","doi-asserted-by":"crossref","unstructured":"Ilyas MU, Radha H (2011) \u201cIdentifying influential nodes in online social networks using principal component centrality,\u201d in 2011 IEEE International Conference on Communications (ICC). IEEE, pp. 1\u20135","DOI":"10.1109\/icc.2011.5963147"},{"key":"3947_CR24","doi-asserted-by":"crossref","unstructured":"Ilyas MU, Radha H (2010) \u201cA klt-inspired node centrality for identifying influential neighborhoods in graphs,\u201d in Information Sciences and Systems (CISS), 2010 44th Annual Conference on. IEEE, pp. 1\u20137","DOI":"10.1109\/CISS.2010.5464971"},{"key":"3947_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.future.2018.11.023","volume":"94","author":"A Zareie","year":"2019","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2019) Influential node ranking in social networks based on neighborhood diversity. Future Gener Comput Syst 94:120\u2013129","journal-title":"Future Gener Comput Syst"},{"issue":"10\u201317","key":"3947_CR26","first-page":"30","volume":"10","author":"M Cha","year":"2010","unstructured":"Cha M, Haddadi H, Benevenuto F, Gummadi PK (2010) Measuring user influence in twitter: The million follower fallacy. ICWSM 10(10\u201317):30","journal-title":"ICWSM"},{"key":"3947_CR27","doi-asserted-by":"crossref","unstructured":"Romero DM, Galuba W, Asur S, Huberman BA (2011) \u201cInfluence and passivity in social media,\u201d in Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, pp. 18\u201333","DOI":"10.1007\/978-3-642-23808-6_2"},{"issue":"6092","key":"3947_CR28","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1126\/science.1215842","volume":"337","author":"S Aral","year":"2012","unstructured":"Aral S, Walker D (2012) Identifying influential and susceptible members of social networks. Science 337(6092):337\u2013341","journal-title":"Science"},{"issue":"3","key":"3947_CR29","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/TMM.2014.2298216","volume":"16","author":"Q Fang","year":"2014","unstructured":"Fang Q, Sang J, Xu C, Rui Y (2014) Topic-sensitive influencer mining in interest-based social media networks via hypergraph learning. IEEE Trans Multimedia 16(3):796\u2013812","journal-title":"IEEE Trans Multimedia"},{"key":"3947_CR30","doi-asserted-by":"crossref","unstructured":"Amato F, Moscato V, Picariello A, Sperl\u00ed G (2017) \u201cInfluence maximization in social media networks using hypergraphs,\u201d in International Conference on Green, Pervasive, and Cloud Computing. Springer, pp. 207\u2013221","DOI":"10.1007\/978-3-319-57186-7_17"},{"issue":"11","key":"3947_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller GA (1995) Wordnet: A lexical database for english. Commun ACM 38(11):39\u201341","journal-title":"Commun ACM"},{"key":"3947_CR32","unstructured":"Lin D (1998) \u201cAn information-theoretic definition of similarity,\u201d in Proceedings of the Fifteenth International Conference on Machine Learning, ser. ICML \u201998. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., pp. 296\u2013304"},{"issue":"1","key":"3947_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"3947_CR34","unstructured":"Zheng C, Wang J, Jain A (2015) \u201cAll-pairs shortest paths in spark,\u201d"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03947-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03947-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03947-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T11:22:18Z","timestamp":1643023338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03947-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,24]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["3947"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03947-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,24]]},"assertion":[{"value":"31 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}