{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:55:36Z","timestamp":1760597736365,"version":"3.37.3"},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T00:00:00Z","timestamp":1495411200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s13278-017-0440-7","type":"journal-article","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T13:25:34Z","timestamp":1495459534000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["HellRank: a Hellinger-based centrality measure for bipartite social networks"],"prefix":"10.1007","volume":"7","author":[{"given":"Seyed Mohammad","family":"Taheri","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2605-9719","authenticated-orcid":false,"given":"Hamidreza","family":"Mahyar","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Firouzi","sequence":"additional","affiliation":[]},{"given":"Elahe","family":"Ghalebi K.","sequence":"additional","affiliation":[]},{"given":"Radu","family":"Grosu","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Movaghar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,22]]},"reference":[{"unstructured":"Abdi H (2007) The Kendall rank correlation coefficient. Encyclopedia of measurement and statistics. pp. 508\u2013510. https:\/\/www.utdallas.edu\/~herve\/Abdi-KendallCorrelation2007-pretty.pdf","key":"440_CR1"},{"issue":"2","key":"440_CR2","first-page":"7","volume":"8","author":"NK Ahmed","year":"2014","unstructured":"Ahmed NK, Neville J, Kompella R (2014) Network sampling: from static to streaming graphs. ACM Trans Knowl Discovery Data (TKDD) 8(2):7","journal-title":"ACM Trans Knowl Discovery Data (TKDD)"},{"doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Kumar R, Mahdian M (2008) Influence and correlation in social networks. In: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 7\u201315. ACM","key":"440_CR3","DOI":"10.1145\/1401890.1401897"},{"doi-asserted-by":"publisher","unstructured":"Beguerisse D\u00edaz M, Porter MA, Onnela JP (2010) Competition for popularity in bipartite networks. Chaos 20(4): 043101. doi: 10.1063\/1.3475411 . http:\/\/www.ncbi.nlm.nih.gov\/pubmed\/21198071","key":"440_CR4","DOI":"10.1063\/1.3475411"},{"doi-asserted-by":"crossref","unstructured":"Benevenuto F, Rodrigues T, Cha M, Almeida V (2009) Characterizing user behavior in online social networks. In: Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference, pp. 49\u201362. ACM","key":"440_CR5","DOI":"10.1145\/1644893.1644900"},{"doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks.\u00a0International Workshop on Web and Internet Economics. Springer Berlin Heidelberg, pp 306\u2013311","key":"440_CR6","DOI":"10.1007\/978-3-540-77105-0_31"},{"doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s B (1984) The evolution of random graphs. Trans. Am. Math. Soc. 286(1):257\u2013257. doi: 10.1090\/S0002-9947-1984-0756039-5 . http:\/\/www.citeulike.org\/group\/3509\/article\/4012374","key":"440_CR7","DOI":"10.1090\/S0002-9947-1984-0756039-5"},{"issue":"1","key":"440_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Soc 2(1):113\u2013120. doi: 10.1080\/0022250X.1972.9989806","journal-title":"J Math Soc"},{"doi-asserted-by":"publisher","unstructured":"Borgatti SP, Everett MG (1997) Network analysis of 2-mode data. Soc Netw 19(3):243\u2013269. doi: 10.1016\/s0378-8733(96)00301-2 . URL<Go to ISI>:\/\/WOS:A1997XE81300004","key":"440_CR9","DOI":"10.1016\/s0378-8733(96)00301-2"},{"key":"440_CR10","first-page":"417","volume":"1941","author":"SP Borgatti","year":"2011","unstructured":"Borgatti SP, Halgin DS (2011) Analyzing affiliation networks. Sage Handb Soc Netw Anal 1941:417\u2013433","journal-title":"Sage Handb Soc Netw Anal"},{"issue":"10\u201317","key":"440_CR11","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"},{"issue":"10","key":"440_CR12","doi-asserted-by":"publisher","first-page":"e77,455","DOI":"10.1371\/journal.pone.0077455","volume":"8","author":"DB Chen","year":"2013","unstructured":"Chen DB, Gao H, L\u00fc L, Zhou T (2013) Identifying influential nodes in large-scale directed networks: the role of clustering. PLoS ONE 8(10):e77,455. doi: 10.1371\/journal.pone.0077455","journal-title":"PLoS ONE"},{"doi-asserted-by":"crossref","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. ACM","key":"440_CR13","DOI":"10.1145\/1557019.1557047"},{"issue":"6","key":"440_CR14","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.3390\/e12061532","volume":"12","author":"A Cichocki","year":"2010","unstructured":"Cichocki A, Amari Si (2010) Families of alpha-beta-and gamma-divergences: flexible and robust measures of similarities. Entropy 12(6):1532\u20131568","journal-title":"Entropy"},{"doi-asserted-by":"crossref","unstructured":"Crandall D, Cosley D, Huttenlocher D, Kleinberg J, Suri S (2008) Feedback effects between similarity and social influence in online communities. In: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 160\u2013168. ACM","key":"440_CR15","DOI":"10.1145\/1401890.1401914"},{"doi-asserted-by":"publisher","unstructured":"Csisz\u00e1r I, Shields PC (2004) Information theory and statistics: a tutorial. Found Trends\u00ae Commun Inf Theory 1(4):417\u2013528. doi: 10.1561\/0100000004","key":"440_CR16","DOI":"10.1561\/0100000004"},{"unstructured":"Davis A, Gardner BB, Gardner MR (2009) Deep south: a social anthropological study of caste and class. University of South Carolina Press","key":"440_CR17"},{"doi-asserted-by":"crossref","unstructured":"Davoodi E, Afsharchi M, Kianmehr K (2012) A social network-based approach to expert recommendation system. In: International conference on hybrid artificial intelligence systems, pp. 91\u2013102. Springer","key":"440_CR18","DOI":"10.1007\/978-3-642-28942-2_9"},{"issue":"3","key":"440_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/scientificamerican0907-1sp","volume":"17","author":"M DiChristina","year":"2007","unstructured":"DiChristina M (2007) Small world. Sci Am sp 17(3):1\u20131. doi: 10.1038\/scientificamerican0907-1sp","journal-title":"Sci Am sp"},{"key":"440_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.physa.2013.12.031","volume":"399","author":"Y Du","year":"2014","unstructured":"Du Y, Gao C, Hu Y, Mahadevan S, Deng Y (2014) A new method of identifying influential nodes in complex networks based on TOPSIS. Phys A Stat Mech Appl 399:57\u201369. doi: 10.1016\/j.physa.2013.12.031","journal-title":"Phys A Stat Mech Appl"},{"issue":"2","key":"440_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0378-8733(96)00300-0","volume":"19","author":"K Faust","year":"1997","unstructured":"Faust K (1997) Centrality in affiliation networks. Soc Netw 19(2):157\u2013191. doi: 10.1016\/S0378-8733(96)00300-0","journal-title":"Soc Netw"},{"doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341. JSTOR, http:\/\/www.jstor.org\/stable\/3033543","key":"440_CR22","DOI":"10.2307\/3033543"},{"issue":"3","key":"440_CR23","doi-asserted-by":"crossref","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"},{"doi-asserted-by":"crossref","unstructured":"Friedkin NE, Johnsen EC (2011) Social influence network theory: a sociological examination of small group dynamics, vol 33. Cambridge University Press \u00a0","key":"440_CR24","DOI":"10.1017\/CBO9780511976735"},{"doi-asserted-by":"crossref","unstructured":"Giroire F, Chandrashekar J, Iannaccone G, Papagiannaki K, Schooler EM, Taft N (2008) The cubicle vs. the coffee shop: behavioral modes in enterprise end-users. In: International conference on passive and active network measurement, pp. 202\u2013211. Springer","key":"440_CR25","DOI":"10.1007\/978-3-540-79232-1_21"},{"doi-asserted-by":"publisher","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on Web search and data mining - WSDM \u201910 p 241. doi: 10.1145\/1718487.1718518","key":"440_CR26","DOI":"10.1145\/1718487.1718518"},{"unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th python in science ... 836, 11\u201315","key":"440_CR27"},{"unstructured":"Hunter JK (2012) An introduction to real analysis. University of California at Davis, California","key":"440_CR28"},{"doi-asserted-by":"crossref","unstructured":"Johnson O (2004) Information theory and the central limit theorem, vol 8. World Scientific, Imperial College Press, London","key":"440_CR29","DOI":"10.1142\/p341"},{"doi-asserted-by":"crossref","unstructured":"Kang U (2011) Centralities in large networks : algorithms and observations. In: SIAM international conference on data pp 119\u2013130","key":"440_CR30","DOI":"10.1137\/1.9781611972818.11"},{"unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2033) 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. ACM","key":"440_CR31"},{"doi-asserted-by":"publisher","unstructured":"Kettle D (2012) Street art. Strad 123(1467):56\u201359. doi: 10.3386\/w19846 . http:\/\/www.nber.org\/papers\/w19846","key":"440_CR32","DOI":"10.3386\/w19846"},{"doi-asserted-by":"publisher","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse Ha (2010) Identifying influential spreaders in complex networks. Nat Phys 6(11):36. doi: 10.1038\/nphys1746 . http:\/\/arxiv.org\/abs\/1001.5285","key":"440_CR33","DOI":"10.1038\/nphys1746"},{"doi-asserted-by":"publisher","unstructured":"Kitsak, M., Krioukov, D.: Hidden variables in bipartite networks. Phys Rev E Stat Nonlinear Soft Matter Phys 84(2):026114 (2011). doi: 10.1103\/PhysRevE.84.026114","key":"440_CR34","DOI":"10.1103\/PhysRevE.84.026114"},{"issue":"5","key":"440_CR35","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604\u2013632. doi: 10.1145\/324133.324140","journal-title":"J ACM"},{"key":"440_CR36","doi-asserted-by":"crossref","DOI":"10.4337\/9781849806916","volume-title":"Social capital: an introduction to managing networks","author":"KW Koput","year":"2010","unstructured":"Koput KW (2010) Social capital: an introduction to managing networks. Edward Elgar Publishing, Cheltenham"},{"issue":"1","key":"440_CR37","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386","journal-title":"Ann Math Stat"},{"doi-asserted-by":"crossref","unstructured":"Landauer TK (1988) Research methods in human-computer interaction. In: Helander M (ed) Handbook of human-computer interaction. Elsevier, New York, pp 905\u2013928","key":"440_CR38","DOI":"10.1016\/B978-0-444-70536-5.50047-6"},{"issue":"1","key":"440_CR39","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2007.04.006","volume":"30","author":"M Latapy","year":"2008","unstructured":"Latapy M, Magnien C, Vecchio ND (2008) Basic notions for the analysis of large two-mode networks. Soc Netw 30(1):31\u201348. doi: 10.1016\/j.socnet.2007.04.006","journal-title":"Soc Netw"},{"key":"440_CR40","first-page":"481","volume-title":"JMP For Basic Univariate And Multivariate Statistics. A step-by-step guide","author":"A Lehamn","year":"2005","unstructured":"Lehamn A, O\u2019Rourke N, Stepanski L (2005) JMP For Basic Univariate And Multivariate Statistics. A step-by-step guide. SAS Institute, Cary, p 481"},{"doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 631\u2013636. ACM","key":"440_CR41","DOI":"10.1145\/1150402.1150479"},{"key":"440_CR42","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.physa.2014.02.041","volume":"404","author":"Q Li","year":"2014","unstructured":"Li Q, Zhou T, L\u00fc L, Chen D (2014) Identifying influential spreaders by weighted LeaderRank. Phys A Stat Mech Appl 404:47\u201355. doi: 10.1016\/j.physa.2014.02.041","journal-title":"Phys A Stat Mech Appl"},{"unstructured":"Liebig J, Rao A (2015) Identifying influential nodes in bipartite networks using the clustering coefficient. In:Proceedings\u201410th International conference on signal-image technology and internet-based systems, SITIS 2014 pp 323\u2013330","key":"440_CR43"},{"doi-asserted-by":"crossref","unstructured":"Lind PG, Gonz\u00e1lez MC, Herrmann HJ (2005) Cycles and clustering in bipartite networks. Phys Rev E 72(5)","key":"440_CR001","DOI":"10.1103\/PhysRevE.72.056127"},{"issue":"2","key":"440_CR45","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14(2):95\u2013116. doi: 10.1007\/BF02289146","journal-title":"Psychometrika"},{"doi-asserted-by":"crossref","unstructured":"Mahyar H (2015) Detection of top-K central nodes in social networks: a compressive sensing approach. In: IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), Paris, France, pp 902\u2013909","key":"440_CR46","DOI":"10.1145\/2808797.2808811"},{"doi-asserted-by":"publisher","unstructured":"Mahyar H, Ghalebi\u00a0K. E, Morshedi SM, Khalili S, Grosu R, Movaghar A (2017) Centrality-based group formation in group recommender systems. In: Proceedings of the 26th international conference on world wide web companion (WWW), Perth, Australia, pp 1343\u20131351. doi: 10.1145\/3041021.3051153","key":"440_CR47","DOI":"10.1145\/3041021.3051153"},{"doi-asserted-by":"crossref","unstructured":"Mahyar H, Rabiee HR, Hashemifar ZS (2013) UCS-NT: an unbiased compressive sensing framework for network tomography. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP), Vancouver, Canada, pp 4534\u20134538","key":"440_CR48","DOI":"10.1109\/ICASSP.2013.6638518"},{"unstructured":"Mahyar H, Rabiee HR, Hashemifar ZS, Siyari P (2013) UCS-WN: an unbiased compressive sensing framework for weighted networks. in: conference on information sciences and systems (CISS), Baltimore, USA, pp 1\u20136","key":"440_CR49"},{"doi-asserted-by":"publisher","unstructured":"Mahyar H, Rabiee HR, Movaghar A, Ghalebi\u00a0K E, Nazemian A (2015) CS-ComDet: a compressive sensing approach for inter-community detection in social networks. In: IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), Paris, France, pp 89\u201396. doi: 10.1145\/2808797.2808856","key":"440_CR50","DOI":"10.1145\/2808797.2808856"},{"doi-asserted-by":"crossref","unstructured":"Mahyar H, Rabiee HR, Movaghar A, Hasheminezhad R, Ghalebi\u00a0K, E, Nazemian A (2015) A Low-cost sparse recovery framework for weighted networks under compressive sensing. In: IEEE international conference on social computing and networking (SocialCom), Chengdu, China, pp 183\u2013190","key":"440_CR51","DOI":"10.1109\/SmartCity.2015.68"},{"doi-asserted-by":"crossref","unstructured":"Maia M, Almeida J, Almeida V (2008) Identifying user behavior in online social networks. In: Proceedings of the 1st workshop on Social network systems, pp 1\u20136. ACM","key":"440_CR52","DOI":"10.1145\/1435497.1435498"},{"doi-asserted-by":"crossref","unstructured":"Maiya AS, Berger-Wolf TY (2011) Benefits of bias: towards better characterization of network sampling. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 105\u2013113. ACM","key":"440_CR53","DOI":"10.1145\/2020408.2020431"},{"issue":"1","key":"440_CR55","first-page":"1","volume":"73","author":"A Muruganantham","year":"2015","unstructured":"Muruganantham A, Road RG, Nadu T, Road RG, Nadu T (2015) Ranking the influence users in a social networking site using an improved topsis. J Theor Appl Inf Technol 73(1):1\u201311","journal-title":"J Theor Appl Inf Technol"},{"issue":"2","key":"440_CR56","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.021544898021544898","volume":"98","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci USA 98(2):404\u2013409. doi: 10.1073\/pnas.021544898021544898","journal-title":"Proc Natl Acad Sci USA"},{"key":"440_CR57","doi-asserted-by":"publisher","DOI":"10.1145\/1361684.1361686","volume-title":"Hellinger distance. Hazewinkel, Michiel, Encyclopedia of mathematics","author":"M Nikulin","year":"2001","unstructured":"Nikulin M (2001) Hellinger distance. Hazewinkel, Michiel, Encyclopedia of mathematics. Springer, Berlin. doi: 10.1145\/1361684.1361686"},{"doi-asserted-by":"crossref","unstructured":"Okamoto K, Chen W, Li XY (2008) Ranking of closeness centrality for large-scale social networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5059 LNCS, 186\u2013195","key":"440_CR58","DOI":"10.1007\/978-3-540-69311-6_21"},{"issue":"2","key":"440_CR59","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl T (2013) Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc Netw 35(2):159\u2013167. doi: 10.1016\/j.socnet.2011.07.001","journal-title":"Soc Netw"},{"issue":"2","key":"440_CR60","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Soc Netw 31(2):155\u2013163. doi: 10.1016\/j.socnet.2009.02.002","journal-title":"Soc Netw"},{"issue":"3","key":"440_CR61","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TKDE.2011.254","volume":"25","author":"M Papagelis","year":"2013","unstructured":"Papagelis M, Das G, Koudas N (2013) Sampling online social networks. IEEE Trans Knowl data Eng 25(3):662\u2013676","journal-title":"IEEE Trans Knowl data Eng"},{"doi-asserted-by":"publisher","unstructured":"Robins GL, Alexander M (2004) Small worlds among interlocking directors: network structure and distance in bipartite graphs. Comput Math Organ Theory 10(1):69\u201394. doi: 10.1023\/B:CMOT.0000032580.12184.c0 . http:\/\/www.springerlink.com\/content\/q567773rj070xvj2\/","key":"440_CR62","DOI":"10.1023\/B:CMOT.0000032580.12184.c0"},{"issue":"4","key":"440_CR63","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581\u2013603","journal-title":"Psychometrika"},{"unstructured":"Sawant S, Pai G (2013) Yelp food recommendation system. stanford machine learning project (CS229) (2013). http:\/\/cs229.stanford.edu\/proj2013\/SawantPai-YelpFoodRecommendationSystem.pdf","key":"440_CR64"},{"doi-asserted-by":"publisher","unstructured":"Silva A, Guimar\u00e3es S, Meira W, Zaki M (2013) ProfileRank. Proceedings of the 7th workshop on social network mining and analysis\u2014SNAKDD \u201913 pp 1\u20139. doi: 10.1145\/2501025.2501033 . http:\/\/dl.acm.org\/citation.cfm?doid=2501025.2501033","key":"440_CR65","DOI":"10.1145\/2501025.2501033"},{"doi-asserted-by":"crossref","unstructured":"Singla P, Richardson M (2008) Yes, there is a correlation:-from social networks to personal behavior on the web. In: Proceedings of the 17th international conference on World Wide Web, pp 655\u2013664. ACM","key":"440_CR66","DOI":"10.1145\/1367497.1367586"},{"issue":"1","key":"440_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K Stephenson","year":"1989","unstructured":"Stephenson K, Zelen M (1989) Rethinking centrality: methods and examples. Soc Netw 11(1):1\u201337. doi: 10.1016\/0378-8733(89)90016-6","journal-title":"Soc Netw"},{"unstructured":"Sun K, Mohamed H, Marchand-Maillet S (2015) Sparsity on statistical simplexes and diversity in social ranking. In: Asian conference on machine learning","key":"440_CR68"},{"doi-asserted-by":"crossref","unstructured":"Sun K, Morrison D, Bruno E, Marchand-Maillet S (2013) Learning representative nodes in social networks. In: Pacific-Asia conference on knowledge discovery and data mining, pp 25\u201336. Springer","key":"440_CR69","DOI":"10.1007\/978-3-642-37456-2_3"},{"doi-asserted-by":"publisher","unstructured":"Taheri SM, Mahyar H, Firouzi M, Ghalebi\u00a0K E, Grosu R, Movaghar A (2017) Extracting implicit social relation for social recommendation techniques in user rating prediction. In: Proceedings of the 26th international conference on world wide web companion (WWW), Perth, Australia, pp 1187\u20131196 (2017). doi: 10.1145\/3041021.3055363","key":"440_CR70","DOI":"10.1145\/3041021.3055363"},{"doi-asserted-by":"crossref","unstructured":"Tang J, Sun J, Wang C, Yang Z (2009) Social influence analysis in large-scale networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 807\u2013816. ACM","key":"440_CR71","DOI":"10.1145\/1557019.1557108"},{"doi-asserted-by":"publisher","unstructured":"Tang J, Sun J, Wang C, Yang Z (2009) Social influence analysis in large-scale networks. Proceedings of SIGKDD\u201909 pp 807\u2013816 (2009). doi: 10.1145\/1557019.1557108","key":"440_CR72","DOI":"10.1145\/1557019.1557108"},{"doi-asserted-by":"crossref","unstructured":"Tang J, Zhang C, Cai K, Zhang L, Su Z (2015) Sampling representative users from large social networks. In: AAAI, pp 304\u2013310. Citeseer","key":"440_CR73","DOI":"10.1609\/aaai.v29i1.9202"},{"issue":"4","key":"440_CR74","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2337542.2337558","volume":"3","author":"X Tang","year":"2012","unstructured":"Tang X, Yang CC (2012) Ranking user influence in healthcare social media (). ACM Trans Intell Syst Technol 3(4):1\u201321. doi: 10.1145\/2337542.2337558","journal-title":"ACM Trans Intell Syst Technol"},{"key":"440_CR75","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511666353","volume-title":"Comparison of statistical experiments 36.","author":"E Torgersen","year":"1991","unstructured":"Torgersen E (1991) Comparison of statistical experiments 36. Cambridge University Press, Cambridge"},{"doi-asserted-by":"crossref","unstructured":"Ugander J, Karrer B, Backstrom L, Kleinberg J (2013) Graph cluster randomization: network exposure to multiple universes. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 329\u2013337. ACM","key":"440_CR76","DOI":"10.1145\/2487575.2487695"},{"unstructured":"Van der Vaart AW (2000) Asymptotic statistics, vol 3. Cambridge university press","key":"440_CR54"},{"issue":"13","key":"440_CR77","doi-asserted-by":"publisher","first-page":"2536","DOI":"10.1016\/j.comnet.2013.05.001","volume":"57","author":"K Wehmuth","year":"2013","unstructured":"Wehmuth K, Ziviani A (2013) DACCER: distributed assessment of the closeness centrality ranking in complex networks. Comput Netw 57(13):2536\u20132548. doi: 10.1016\/j.comnet.2013.05.001","journal-title":"Comput Netw"},{"issue":"10","key":"440_CR78","doi-asserted-by":"publisher","first-page":"2564","DOI":"10.1016\/j.physa.2013.01.054","volume":"392","author":"D Wei","year":"2013","unstructured":"Wei D, Deng X, Zhang X, Deng Y, Mahadevan S (2013) Identifying influential nodes in weighted networks based on evidence theory. Phys A Stat Mech Appl 392(10):2564\u20132575. doi: 10.1016\/j.physa.2013.01.054","journal-title":"Phys A Stat Mech Appl"},{"doi-asserted-by":"publisher","unstructured":"Weng J, Lim Ep, Jiang J (2010) TwitterRank : finding topic-sensitive influential twitterers. New York Paper 504, 261\u2013270. doi: 10.1145\/1718487.1718520 . http:\/\/portal.acm.org\/citation.cfm?id=1718520","key":"440_CR79","DOI":"10.1145\/1718487.1718520"},{"issue":"4","key":"440_CR80","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.elerap.2012.01.002","volume":"11","author":"K Xu","year":"2012","unstructured":"Xu K, Guo X, Li J, Lau RYK, Liao SSY (2012) Discovering target groups in social networking sites: an effective method for maximizing joint influential power. Electr Commer Res Appl 11(4):318\u2013334. doi: 10.1016\/j.elerap.2012.01.002","journal-title":"Electr Commer Res Appl"},{"unstructured":"You K, Tempo R, Qiu L (2015) Distributed algorithms for computation of centrality measures in complex networks pp 1\u201314. http:\/\/arxiv.org\/abs\/1507.01694","key":"440_CR81"},{"key":"440_CR82","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.procs.2015.07.559","volume":"59","author":"Y Yustiawan","year":"2015","unstructured":"Yustiawan Y, Maharani W, Gozali AA (2015) Degree centrality for social network with opsahl method. Proc Comput Sci 59:419\u2013426. doi: 10.1016\/j.procs.2015.07.559","journal-title":"Proc Comput Sci"},{"issue":"27","key":"440_CR83","doi-asserted-by":"publisher","first-page":"6869","DOI":"10.1016\/j.physa.2008.09.006","volume":"387","author":"P Zhang","year":"2008","unstructured":"Zhang P, Wang J, Li X, Li M, Di Z, Fan Y (2008) Clustering coefficient and community structure of bipartite networks. Phys A Stat Mech Appl 387(27):6869\u20136875. doi: 10.1016\/j.physa.2008.09.006","journal-title":"Phys A Stat Mech Appl"},{"issue":"2","key":"440_CR84","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/MIS.2013.104","volume":"29","author":"K Zhao","year":"2014","unstructured":"Zhao K, Wang X, Yu M, Gao B (2014) User recommendations in reciprocal and bipartite social networks\u2014an online dating case study. IEEE Intell Syst 29(2):27\u201335. doi: 10.1109\/MIS.2013.104","journal-title":"IEEE Intell Syst"},{"issue":"4","key":"440_CR85","doi-asserted-by":"publisher","first-page":"046,115","DOI":"10.1103\/PhysRevE.76.046115","volume":"76","author":"T Zhou","year":"2007","unstructured":"Zhou T, Ren J, Medo M, Zhang YC (2007) Bipartite network projection and personal recommendation. Phys Rev E Stat Nonlinear Soft Matter Phys 76(4):046,115. doi: 10.1103\/PhysRevE.76.046115","journal-title":"Phys Rev E Stat Nonlinear Soft Matter Phys"},{"unstructured":"Zhu X, Goldberg AB, Van\u00a0Gael J, Andrzejewski D (2007) Improving diversity in ranking using absorbing random walks. In: HLT-NAACL, pp 97\u2013104","key":"440_CR86"},{"issue":"16","key":"440_CR87","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 Stat Mech Appl 392(16):3459\u20133469. doi: 10.1016\/j.physa.2013.03.035","journal-title":"Phys A Stat Mech Appl"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-017-0440-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-017-0440-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-017-0440-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T19:54:53Z","timestamp":1659038093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-017-0440-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,22]]},"references-count":87,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["440"],"URL":"https:\/\/doi.org\/10.1007\/s13278-017-0440-7","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2017,5,22]]},"article-number":"22"}}