{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:52:45Z","timestamp":1775296365556,"version":"3.50.1"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T00:00:00Z","timestamp":1543968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13278-018-0545-7","type":"journal-article","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T01:18:14Z","timestamp":1543972694000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A heuristic approach to estimate nodes\u2019 closeness rank using the properties of real world networks"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7151-6309","authenticated-orcid":false,"given":"Akrati","family":"Saxena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralucca","family":"Gera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. R. S.","family":"Iyengar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"545_CR1","unstructured":"(2016) Spanish book network dataset \u2013 KONECT. URL http:\/\/konect.uni-koblenz.de\/networks\/lasagne-spanishbook"},{"key":"545_CR2","unstructured":"Bader DA, Madduri K (2006) Parallel algorithms for evaluating centrality indices in real-world networks. In: Parallel rocessing, 2006. ICPP 2006. International Conference on, IEEE, pp 539\u2013550"},{"issue":"5439","key":"545_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"545_CR4","doi-asserted-by":"crossref","unstructured":"Barzinpour F, Ali-Ahmadi BH, Alizadeh S, Jalali\u00a0Naini SG (2014) Clustering networks heterogeneous data in defining a comprehensive closeness centrality index. Math Probl Eng","DOI":"10.1155\/2014\/202350"},{"key":"545_CR5","doi-asserted-by":"crossref","unstructured":"Bergamini E, Borassi M, Crescenzi P, Marino A, Meyerhenke H (2016) Computing top-k closeness centrality faster in unweighted graphs. In: 2016 Proceedings of the eighteenth workshop on algorithm engineering and experiments (ALENEX). SIAM, pp 68\u201380","DOI":"10.1137\/1.9781611974317.6"},{"key":"545_CR6","doi-asserted-by":"crossref","unstructured":"Bollacker KD, Lawrence S, Giles CL(1998) Citeseer: An autonomous web agent for automatic retrieval and identification of interesting publications. In: Proceedings of the second international conference on autonomous agents, ACM, pp 116\u2013123","DOI":"10.1145\/280765.280786"},{"issue":"07","key":"545_CR7","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes U, Pich C (2007) Centrality estimation in large networks. Int J Bifurcat Chaos 17(07):2303\u20132318","journal-title":"Int J Bifurcat Chaos"},{"key":"545_CR8","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"},{"key":"545_CR9","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine In: Seventh international world-wide web conference (www 1998), april 14-18, 1998, brisbane, australia. Brisbane, Australia"},{"key":"545_CR10","unstructured":"Carbaugh J, Debnath J, Fletcher M, Gera R, Lee WC, Nelson R (2017) Extracting information based on partial or complete network data. In: International conference on communication, management and information technology"},{"key":"545_CR11","doi-asserted-by":"crossref","unstructured":"Chan SY, Leung IXY, Li\u00f2 P (2009) Fast centrality approximation in modular networks. In: Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management, ACM, pp 31\u201338","DOI":"10.1145\/1651274.1651282"},{"issue":"4","key":"545_CR12","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen D, L\u00fc L, Shang MS, Zhang YC, Zhou T (2012) Identifying influential nodes in complex networks. Phys A Stat Mech Appl 391(4):1777\u20131787","journal-title":"Phys A Stat Mech Appl"},{"key":"545_CR13","doi-asserted-by":"crossref","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 1082\u20131090","DOI":"10.1145\/2020408.2020579"},{"key":"545_CR15","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck R (2014) Computing classic closeness centrality, at scale. In: Proceedings of the second ACM conference on online social networks. ACM, pp 37\u201350","DOI":"10.1145\/2660460.2660465"},{"key":"545_CR14","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, vol 6. MIT press, Cambridge"},{"issue":"3","key":"545_CR16","first-page":"033,112","volume":"25","author":"Y Du","year":"2015","unstructured":"Du Y, Gao C, Chen X, Hu Y, Sadiq R, Deng Y (2015) A new closeness centrality measure via effective distance in complex networks. Chaos: an Interdisciplinary. J. Nonlin. Sci. 25(3):033,112","journal-title":"J. Nonlin. Sci."},{"key":"545_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.7155\/jgaa.00081","volume":"8","author":"D Eppstein","year":"2004","unstructured":"Eppstein D, Wang J (2004) Fast approximation of centrality. J Graph Algorithms Appl 8:39\u201345","journal-title":"J Graph Algorithms Appl"},{"key":"545_CR18","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 35\u201341","DOI":"10.2307\/3033543"},{"issue":"3","key":"545_CR19","doi-asserted-by":"publisher","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"},{"issue":"1","key":"545_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjds5","volume":"1","author":"T Hogg","year":"2012","unstructured":"Hogg T, Lerman K (2012) Social dynamics of digg. EPJ Data Sci 1(1):1\u201326","journal-title":"EPJ Data Sci"},{"issue":"2","key":"545_CR21","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1527\/tjsai.29.234","volume":"29","author":"S Jarukasemratana","year":"2014","unstructured":"Jarukasemratana S, Murata T, Liu X (2014) Community detection algorithm based on centrality and node closeness in scale-free networks. Trans Jpn Soc Artif Intell 29(2):234\u2013244","journal-title":"Trans Jpn Soc Artif Intell"},{"issue":"6833","key":"545_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong H, Mason SP, Barab\u00e1si AL, Oltvai ZN (2001) Lethality and centrality in protein networks. Nature 411(6833):41\u201342","journal-title":"Nature"},{"issue":"1","key":"545_CR23","first-page":"428","volume":"33","author":"G Joshi-Tope","year":"2005","unstructured":"Joshi-Tope G, Gillespie M, Vastrik I, D\u2019Eustachio P, Schmidt E, de Bono B, Jassal B, Gopinath G, Wu G, Matthews L (2005) Reactome: a knowledgebase of biological pathways. Nucl Acids Res 33(1):428\u2013432","journal-title":"Nucl Acids Res"},{"issue":"7","key":"545_CR24","doi-asserted-by":"publisher","first-page":"e95","DOI":"10.1371\/journal.pcbi.0020095","volume":"2","author":"M Kaiser","year":"2006","unstructured":"Kaiser M, Hilgetag CC (2006) Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems. PLoS Comput Biol 2(7):e95","journal-title":"PLoS Comput Biol"},{"key":"545_CR25","doi-asserted-by":"crossref","unstructured":"Kas M, Wachs M, Carley KM, Carley LR (2013) Incremental algorithm for updating betweenness centrality in dynamically growing networks. In: Proceedings of the 2013 IEEE\/ACM international conference on advances in social networks analysis and mining, ACM, pp 33\u201340","DOI":"10.1145\/2492517.2492533"},{"issue":"1","key":"545_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"issue":"3","key":"545_CR27","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/biomet\/33.3.239","volume":"33","author":"MG Kendall","year":"1945","unstructured":"Kendall MG (1945) The treatment of ties in ranking problems. Biometrika 33(3):239\u2013251","journal-title":"Biometrika"},{"issue":"3","key":"545_CR28","first-page":"1454","volume":"10","author":"J Kim","year":"2016","unstructured":"Kim J, Ahn H, Park M, Kim S, Kim KP (2016) An estimated closeness centrality ranking algorithm and its performance analysis in Large-Scale workflow-supported social networks. KSII Trans Int Inf Syst 10(3):1454\u20131466","journal-title":"KSII Trans Int Inf Syst"},{"key":"545_CR29","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-30115-8_22","volume-title":"European conference on machine learning (ECML 2004)","author":"B Klimt","year":"2004","unstructured":"Klimt B, Yang Y (2004) The enron corpus: a new dataset for email classification research. In: Boulicaut JF, Esposito F, Giannotti F, Pedreschi D (eds) European conference on machine learning (ECML 2004). Springer, Berlin, Heidelberg, pp 217\u2013226"},{"issue":"1","key":"545_CR30","first-page":"4","volume":"28","author":"K Ko","year":"2008","unstructured":"Ko K, Lee KJ, Park C (2008) Rethinking preferential attachment scheme: degree centrality versus closeness centrality. Connections 28(1):4\u201315","journal-title":"Connections"},{"key":"545_CR31","unstructured":"Lehmann KA, Kaufmann M (2003) Decentralized algorithms for evaluating centrality in complex networks"},{"issue":"1","key":"545_CR32","doi-asserted-by":"publisher","first-page":"2","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 1(1):2","journal-title":"ACM Trans Knowl Discov Data"},{"key":"545_CR33","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems, ACM, pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"key":"545_CR34","unstructured":"Lu F, Osthoff C, Ramos D, Nardes R, et\u00a0al (2015) Mdaccer: Modified distributed assessment of the closeness centrality ranking in complex networks for massively parallel environments. In: 2015 International symposium on computer architecture and high performance computing workshop (SBAC-PADW), IEEE, pp 43\u201348"},{"key":"545_CR35","unstructured":"McAuley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. In: NIPS 2012:548\u201356"},{"key":"545_CR36","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BFb0067700","volume-title":"Numerical analysis","author":"JJ Mor\u00e9","year":"1978","unstructured":"Mor\u00e9 JJ (1978) The levenberg-marquardt algorithm: implementation and theory. In: Watson GA (ed) Numerical analysis. Springer, Berlin, Heidelberg, pp 105\u2013116"},{"issue":"1","key":"545_CR37","doi-asserted-by":"publisher","first-page":"016,132","DOI":"10.1103\/PhysRevE.64.016132","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) Scientific collaboration networks. ii. Shortest paths, weighted networks, and centrality. Phys Rev E 64(1):016,132","journal-title":"Phys Rev E"},{"issue":"2","key":"545_CR38","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"key":"545_CR39","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","volume-title":"International workshop on Frontiers in algorithmics","author":"K Okamoto","year":"2008","unstructured":"Okamoto K, Chen W, Li XY (2008) Ranking of closeness centrality for large-scale social networks. In: Preparata FP, Wu X, Yin J (eds) International workshop on Frontiers in algorithmics. Springer, Berlin, Heidelberg, pp 186\u2013195"},{"key":"545_CR40","doi-asserted-by":"crossref","unstructured":"Olsen PW, Labouseur AG, Hwang JH (2014) Efficient top-k closeness centrality search. In: Data engineering (ICDE), 2014 IEEE 30th international conference on, IEEE, pp 196\u2013207","DOI":"10.1109\/ICDE.2014.6816651"},{"key":"545_CR41","unstructured":"Opsahl T (2011) Why anchorage is not (that) important: Binary ties and sample selection. online] https:\/\/www.toreopsahlcom\/2011\/08\/12\/ why-anchorage-is-not-that-important-binary-tiesand-sample-selection (accessed Sept 2013)"},{"key":"545_CR42","unstructured":"Park S, Park M, Kim H, Kim H, Yoon W, Yoon TB, Kim KP (2013) A closeness centrality analysis algorithm for workflow-supported social networks. In: Advanced communication technology (ICACT), 2013 15th International conference on, IEEE, pp 158\u2013161"},{"key":"545_CR43","doi-asserted-by":"crossref","unstructured":"Pfeffer J, Carley KM (2012) k-centralities: local approximations of global measures based on shortest paths. In: Proceedings of the 21st international conference companion on World Wide Web, ACM, pp 1043\u20131050","DOI":"10.1145\/2187980.2188239"},{"key":"545_CR44","doi-asserted-by":"crossref","unstructured":"Rattigan MJ, Maier M, Jensen D (2006) Using structure indices for efficient approximation of network properties. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 357\u2013366","DOI":"10.1145\/1150402.1150443"},{"key":"545_CR45","doi-asserted-by":"crossref","unstructured":"Richardson M, Agrawal R, Domingos P(2003) Trust management for the semantic web. In: International semantic Web conference, Springer, pp 351\u2013368","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"545_CR46","unstructured":"Rochat Y (2009) Closeness centrality extended to unconnected graphs: The harmonic centrality index. In: ASNA, EPFL-CONF-200525"},{"key":"545_CR47","doi-asserted-by":"crossref","unstructured":"Ruslan N, Sharif S (2015) Improved closeness centrality using arithmetic mean approach. In: innovation and analytics conference and exhibition(IACE 2015): Proceedings of the 2nd innovation and analytics conference & Exhibition, AIP Publishing, vol 1691, p 050022","DOI":"10.1063\/1.4937104"},{"issue":"4","key":"545_CR48","doi-asserted-by":"publisher","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"},{"key":"545_CR49","unstructured":"Sariyuce AE, Kaya K, Saule E, Catalyurek UV (2013) Incremental algorithms for network management and analysis based on closeness centrality. arXiv preprint arXiv:13030422"},{"key":"545_CR50","unstructured":"Saxena A, Iyengar S (2017) Global rank estimation. arXiv preprint arXiv:171011341"},{"key":"545_CR51","unstructured":"Saxena A, Iyengar S (2018) Estimating shell-index in a graph with local information. arXiv preprint arXiv:180510391"},{"key":"545_CR52","doi-asserted-by":"crossref","unstructured":"Saxena A, Malik V, Iyengar S (2015a) Estimating the degree centrality ranking of a node. arXiv preprint arXiv:151105732","DOI":"10.1109\/COMSNETS.2016.7440022"},{"key":"545_CR53","unstructured":"Saxena A, Malik V, Iyengar S (2015b) Rank me thou shalln\u2019t compare me. arXiv preprint arXiv:151109050"},{"key":"545_CR54","unstructured":"Saxena A, Gera R, Iyengar S (2017a) Degree ranking using local information. arXiv preprint arXiv:170601205"},{"key":"545_CR55","doi-asserted-by":"crossref","unstructured":"Saxena A, Gera R, Iyengar S (2017b) Fast estimation of closeness centrality ranking. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining 2017, ACM, pp 80\u201385","DOI":"10.1145\/3110025.3110064"},{"key":"545_CR56","doi-asserted-by":"crossref","unstructured":"Saxena A, Gera R, Iyengar S (2017c) A faster method to estimate closeness centrality ranking. arXiv preprint arXiv:170602083","DOI":"10.1145\/3110025.3110064"},{"key":"545_CR57","doi-asserted-by":"crossref","unstructured":"Saxena A, Gera R, Iyengar S (2017d) Observe locally rank globally. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining 2017, ACM, pp 139\u2013144","DOI":"10.1145\/3110025.3110063"},{"issue":"4","key":"545_CR58","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1037\/h0053638","volume":"49","author":"ME Shaw","year":"1954","unstructured":"Shaw ME (1954) Some effects of unequal distribution of information upon group performance in various communication nets. J Abnorm Soc Psychol 49(4):547\u2013553","journal-title":"J Abnorm Soc Psychol"},{"issue":"10","key":"545_CR59","doi-asserted-by":"publisher","first-page":"e1049","DOI":"10.1371\/journal.pone.0001049","volume":"2","author":"O Sporns","year":"2007","unstructured":"Sporns O, Honey CJ, K\u00f6tter R (2007) Identification and classification of hubs in brain networks. PloS One 2(10):e1049","journal-title":"PloS One"},{"issue":"1","key":"545_CR60","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","journal-title":"Soc Netw"},{"issue":"1","key":"545_CR61","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1111\/j.1756-8765.2011.01178.x","volume":"4","author":"S Sudarshan Iyengar","year":"2012","unstructured":"Sudarshan Iyengar S, Veni Madhavan C, Zweig KA, Natarajan A (2012) Understanding human navigation using network analysis. Top Cogn Sci 4(1):121\u2013134","journal-title":"Top Cogn Sci"},{"key":"545_CR62","unstructured":"Tallberg C (2000) Comparing degree-based and closeness-based centrality measures. Univ, Department of Statistics"},{"key":"545_CR63","unstructured":"Szczepa\u0144ski P, Rahwan T, Michalak TP, Wooldridge M (2016) Closeness centrality for networks with overlapping community structure. In: Thirtieth AAAI conference on artificial intelligence"},{"key":"545_CR64","doi-asserted-by":"crossref","unstructured":"Ufimtsev V, Bhowmick S (2014) An extremely fast algorithm for identifying high closeness centrality vertices in large-scale networks. In: Proceedings of the fourth workshop on irregular applications: architectures and algorithms, IEEE Press, pp 53\u201356","DOI":"10.1109\/IA335182.2014.10612526"},{"key":"545_CR65","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM workshop on Online social networks, ACM, pp 37\u201342","DOI":"10.1145\/1592665.1592675"},{"key":"545_CR66","doi-asserted-by":"crossref","unstructured":"Wang W, Tang CY (2015) Distributed estimation of closeness centrality. In: Decision and Control (CDC), 2015 IEEE 54th annual conference on, IEEE, pp 4860\u20134865","DOI":"10.1109\/CDC.2015.7402978"},{"key":"545_CR67","doi-asserted-by":"crossref","unstructured":"Wehmuth K, Ziviani A (2012) Distributed assessment of the closeness centrality ranking in complex networks. In: Proceedings of the fourth annual workshop on simplifying complex networks for practitioners, ACM, pp 43\u201348","DOI":"10.1145\/2184356.2184368"},{"issue":"10","key":"545_CR68","doi-asserted-by":"publisher","first-page":"2107","DOI":"10.1002\/asi.21128","volume":"60","author":"E Yan","year":"2009","unstructured":"Yan E, Ding Y (2009) Applying centrality measures to impact analysis: a coauthorship network analysis. J Am Soc Inf Sci Technol 60(10):2107\u20132118","journal-title":"J Am Soc Inf Sci Technol"},{"issue":"1","key":"545_CR69","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"545_CR70","doi-asserted-by":"crossref","unstructured":"Yen CC, Yeh MY, Chen MS (2013) An efficient approach to updating closeness centrality and average path length in dynamic networks. In: Data mining (ICDM), 2013 IEEE 13th international conference on, IEEE, pp 867\u2013876","DOI":"10.1109\/ICDM.2013.135"},{"issue":"339","key":"545_CR71","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1080\/01621459.1972.10481251","volume":"67","author":"JH Zar","year":"1972","unstructured":"Zar JH (1972) Significance testing of the spearman rank correlation coefficient. J Am Stat Assoc 67(339):578\u2013580","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"545_CR72","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/1052812.1052825","volume":"35","author":"B Zhang","year":"2005","unstructured":"Zhang B, Liu R, Massey D, Zhang L (2005) Collecting the internet as-level topology. ACM SIGCOMM Comput Commun Rev 35(1):53\u201361","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"545_CR73","doi-asserted-by":"crossref","unstructured":"Zhang J, Ma X, Liu W, Bai Y (2012) Inferring community members in social networks by closeness centrality examination. In: Web information systems and applications conference (WISA), 2012 Ninth, IEEE, pp 131\u2013134","DOI":"10.1109\/WISA.2012.52"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0545-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-018-0545-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0545-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:07:13Z","timestamp":1775293633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-018-0545-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,5]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["545"],"URL":"https:\/\/doi.org\/10.1007\/s13278-018-0545-7","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,5]]},"assertion":[{"value":"21 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"3"}}