{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:37:06Z","timestamp":1762508226240,"version":"3.37.3"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T00:00:00Z","timestamp":1596672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T00:00:00Z","timestamp":1596672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A problem that frequently occurs when mining complex networks is selecting algorithms with which to rank the relevance of nodes to metadata groups characterized by a small number of examples. The best algorithms are often found through experiments on labeled networks or unsupervised structural community quality measures. However, new networks could exhibit characteristics different from the labeled ones, whereas structural community quality measures favor dense congregations of nodes but not metadata groups spanning a wide breadth of the network. To avoid these shortcomings, in this work we propose using unsupervised measures that assess node rank quality across multiple metadata groups through their ability to reconstruct the local structures of network nodes; these are retrieved from the network and not assumed. Three types of local structures are explored: linked nodes, nodes up to two hops away and nodes forming triangles. We compare the resulting measures alongside unsupervised structural community quality ones to the AUC and NDCG of supervised evaluation in one synthetic and four real-world labelled networks. Our experiments suggest that our proposed local structure measures are often more accurate for unsupervised pairwise comparison of ranking algorithms, especially when few example nodes are provided. Furthermore, the ability to reconstruct the extended neighborhood, which we call HopAUC, manages to select a near-best among many ranking algorithms in most networks.<\/jats:p>","DOI":"10.1007\/s41109-020-00287-x","type":"journal-article","created":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T09:03:15Z","timestamp":1596704595000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unsupervised evaluation of multiple node ranks by reconstructing local structures"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3947-222X","authenticated-orcid":false,"given":"Emmanouil","family":"Krasanakis","sequence":"first","affiliation":[]},{"given":"Symeon","family":"Papadopoulos","sequence":"additional","affiliation":[]},{"given":"Yiannis","family":"Kompatsiaris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,6]]},"reference":[{"issue":"1","key":"287_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.2015.2490670","volume":"62","author":"E Abbe","year":"2016","unstructured":"Abbe, E, Bandeira AS, Hall G (2016) Exact recovery in the stochastic block model. IEEE Trans Inf Theory 62(1):471\u2013487.","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"287_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2180861.2180866","volume":"6","author":"LM Aiello","year":"2012","unstructured":"Aiello, LM, Barrat A, Schifanella R, Cattuto C, Markines B, Menczer F (2012) Friendship prediction and homophily in social media. ACM Trans Web (TWEB) 6(2):1\u201333.","journal-title":"ACM Trans Web (TWEB)"},{"key":"287_CR3","unstructured":"Amazon product co-purchasing network metadata (2007). https:\/\/snap.stanford.edu\/data\/amazon-meta.html. Accessed 28 Feb 2020."},{"key":"287_CR4","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1109\/FOCS.2006.44","volume-title":"2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906)","author":"R Andersen","year":"2006","unstructured":"Andersen, R, Chung F, Lang K (2006) Local graph partitioning using pagerank vectors In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), 475\u2013486.. IEEE, New York."},{"issue":"1-2","key":"287_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/15427951.2008.10129297","volume":"5","author":"R Andersen","year":"2008","unstructured":"Andersen, R, Chung F, Lang K (2008) Local partitioning for directed graphs using pagerank. Internet Math 5(1-2):3\u201322.","journal-title":"Internet Math"},{"issue":"3-4","key":"287_CR6","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1007\/s10955-018-2099-5","volume":"173","author":"K Avrachenkov","year":"2018","unstructured":"Avrachenkov, K, Kadavankandy A, Litvak N (2018) Mean field analysis of personalized pagerank with implications for local graph clustering. J Stat Phys 173(3-4):895\u2013916.","journal-title":"J Stat Phys"},{"key":"287_CR7","doi-asserted-by":"crossref","unstructured":"Berry, G, Sirianni A, Weber I, An J, Macy M (2020) Going beyond accuracy: estimating homophily insocial networks using predictions. arXiv preprint arXiv:2001.11171.","DOI":"10.31235\/osf.io\/jgdtz"},{"issue":"6","key":"287_CR8","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1086\/228667","volume":"92","author":"RS Burt","year":"1987","unstructured":"Burt, RS (1987) Social contagion and innovation: Cohesion versus structural equivalence. Am J Sociol 92(6):1287\u20131335.","journal-title":"Am J Sociol"},{"key":"287_CR9","unstructured":"Chalupa, D (2017) A memetic algorithm for the minimum conductance graph partitioning problem. arXiv preprint arXiv:1704.02854."},{"key":"287_CR10","unstructured":"CiteSeer network (2003). CiteSeer for Document Classification from https:\/\/linqs.soe.ucsc.edu\/data. Accessed 28 Feb 2020."},{"key":"287_CR11","first-page":"21","volume":"2","author":"NS Dash","year":"2018","unstructured":"Dash, NS (2018) Context and contextual word meaning. SKASE J Theor Linguist 2:21\u201331.","journal-title":"SKASE J Theor Linguist"},{"key":"287_CR12","unstructured":"DBLP Citation network (2011). DBLP-Citation-network V4 from https:\/\/aminer.org\/citation. Accessed 28 Feb 2020."},{"key":"287_CR13","doi-asserted-by":"crossref","first-page":"6868","DOI":"10.1038\/ncomms7868","volume":"6","author":"M De Domenico","year":"2015","unstructured":"De Domenico, M, Sol\u00e9-Ribalta A, Omodei E, G\u00f3mez S, Arenas A (2015) Ranking in interconnected multilayer networks reveals versatile nodes. Nat Commun 6:6868.","journal-title":"Nat Commun"},{"issue":"3","key":"287_CR14","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1037\/xge0000139","volume":"145","author":"M Dehghani","year":"2016","unstructured":"Dehghani, M, Johnson K, Hoover J, Sagi E, Garten J, Parmar NJ, Vaisey S, Iliev R, Graham J (2016) Purity homophily in social networks. J Exp Psychol Gen 145(3):366.","journal-title":"J Exp Psychol Gen"},{"issue":"11","key":"287_CR15","doi-asserted-by":"crossref","first-page":"2402","DOI":"10.1109\/TKDE.2017.2730207","volume":"29","author":"L Duan","year":"2017","unstructured":"Duan, L, Ma S, Aggarwal C, Ma T, Huai J (2017) An ensemble approach to link prediction. IEEE Trans Knowl Data Eng 29(11):2402\u20132416.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"287_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato, S, Hric D (2016) Community detection in networks: A user guide. Phys Rep 659:1\u201344.","journal-title":"Phys Rep"},{"issue":"3","key":"287_CR17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1177\/0049124184012003001","volume":"12","author":"NE Friedkin","year":"1984","unstructured":"Friedkin, NE (1984) Structural cohesion and equivalence explanations of social homogeneity. Sociol Methods Res 12(3):235\u2013261.","journal-title":"Sociol Methods Res"},{"key":"287_CR18","unstructured":"Goldberg, Y, Levy O (2014) word2vec explained: deriving mikolov et al.\u2019s negative-sampling word-embedding method. arXiv preprint arXiv:1402.3722."},{"key":"287_CR19","first-page":"3","volume":"19","author":"R G\u00f6rke","year":"2015","unstructured":"G\u00f6rke, R, Kappes A, Wagner D (2015) Experiments on density-constrained graph clustering. J Exp Algorithmics (JEA) 19:3\u20133.","journal-title":"J Exp Algorithmics (JEA)"},{"issue":"1","key":"287_CR20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley, JA, McNeil BJ (1982) The meaning and use of the area under a receiver operating characteristic (roc) curve. Radiology 143(1):29\u201336.","journal-title":"Radiology"},{"key":"287_CR21","first-page":"657","volume-title":"Advances in Neural Information Processing Systems","author":"P Hoff","year":"2008","unstructured":"Hoff, P (2008) Modeling homophily and stochastic equivalence in symmetric relational data In: Advances in Neural Information Processing Systems, 657\u2013664.. MIT Press, Cambridge."},{"issue":"2","key":"287_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: First steps. Soc Netw 5(2):109\u2013137.","journal-title":"Soc Netw"},{"issue":"6","key":"287_CR23","doi-asserted-by":"crossref","first-page":"062805","DOI":"10.1103\/PhysRevE.90.062805","volume":"90","author":"D Hric","year":"2014","unstructured":"Hric, D, Darst RK, Fortunato S (2014) Community detection in networks: Structural communities versus ground truth. Phys Rev E 90(6):062805.","journal-title":"Phys Rev E"},{"issue":"3","key":"287_CR24","first-page":"031038","volume":"6","author":"D Hric","year":"2016","unstructured":"Hric, D, Peixoto TP, Fortunato S (2016) Network structure, metadata, and the prediction of missing nodes and annotations. Phys Rev X 6(3):031038.","journal-title":"Phys Rev X"},{"issue":"1","key":"287_CR25","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1086\/687533","volume":"79","author":"GA Huber","year":"2017","unstructured":"Huber, GA, Malhotra N (2017) Political homophily in social relationships: Evidence from online dating behavior. J Polit 79(1):269\u2013283.","journal-title":"J Polit"},{"key":"287_CR26","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1145\/3018661.3018668","volume-title":"Proceedings of the Tenth ACM International Conference on Web Search and Data Mining","author":"C-C Hsu","year":"2017","unstructured":"Hsu, C-C, Lai Y-A, Chen W-H, Feng M-H, Lin S-D (2017) Unsupervised ranking using graph structures and node attributes In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 771\u2013779.. ACM, New York."},{"issue":"3","key":"287_CR27","first-page":"261","volume":"16","author":"F Isinkaye","year":"2015","unstructured":"Isinkaye, F, Folajimi Y, Ojokoh B (2015) Recommendation systems: Principles, methods and evaluation. Egypt Inf J 16(3):261\u2013273.","journal-title":"Egypt Inf J"},{"issue":"1","key":"287_CR28","doi-asserted-by":"crossref","first-page":"012821","DOI":"10.1103\/PhysRevE.91.012821","volume":"91","author":"LG Jeub","year":"2015","unstructured":"Jeub, LG, Balachandran P, Porter MA, Mucha PJ, Mahoney MW (2015) Think locally, act locally: Detection of small, medium-sized, and large communities in large networks. Phys Rev E 91(1):012821.","journal-title":"Phys Rev E"},{"issue":"4","key":"287_CR29","doi-asserted-by":"crossref","first-page":"046132","DOI":"10.1103\/PhysRevE.64.046132","volume":"64","author":"EM Jin","year":"2001","unstructured":"Jin, EM, Girvan M, Newman ME (2001) Structure of growing social networks. Phys Rev E 64(4):046132.","journal-title":"Phys Rev E"},{"issue":"7","key":"287_CR30","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/jps.3030390704","volume":"39","author":"J Keith Borland","year":"1950","unstructured":"Keith Borland, J (1950) The fallacy of the square root sampling rule. J Am Pharm Assoc 39(7):373\u2013377.","journal-title":"J Am Pharm Assoc"},{"issue":"1","key":"287_CR31","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1186\/1471-2105-11-521","volume":"11","author":"J Kim","year":"2010","unstructured":"Kim, J, Tan K (2010) Discover protein complexes in protein-protein interaction networks using parametric local modularity. BMC Bioinformatics 11(1):521.","journal-title":"BMC Bioinformatics"},{"key":"287_CR32","unstructured":"Kipf, TN, Welling M (2016) Semi-supervised classification with graph convolutional networks In: 5th International Conference on Learning Representations (ICLR 2017), Toulon. arXiv preprint arXiv:1609.02907."},{"key":"287_CR33","unstructured":"Klicpera, J, Bojchevski A, G\u00fcnnemann S2018. Predict then propagate: Graph neural networks meet personalized pagerank, New Orleans. arXiv preprint arXiv:1810.05997."},{"key":"287_CR34","doi-asserted-by":"crossref","first-page":"1386","DOI":"10.1145\/2623330.2623706","volume-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"K Kloster","year":"2014","unstructured":"Kloster, K, Gleich DF (2014) Heat kernel based community detection In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1386\u20131395.. ACM, New York."},{"key":"287_CR35","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/11940128_56","volume-title":"International Symposium on Algorithms and Computation","author":"\u0141 Kowalik","year":"2006","unstructured":"Kowalik, \u0141 (2006) Approximation scheme for lowest outdegree orientation and graph density measures In: International Symposium on Algorithms and Computation, 557\u2013566.. Springer, Berlin."},{"key":"287_CR36","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4899-7637-6_3","volume-title":"Recommender Systems Handbook","author":"Y Koren","year":"2015","unstructured":"Koren, Y, Bell R (2015) Advances in collaborative filtering In: Recommender Systems Handbook, 77\u2013118.. Springer, Boston."},{"key":"287_CR37","doi-asserted-by":"crossref","unstructured":"Krasanakis, E, Papadopoulos S, Kompatsiaris Y (2019a) LinkAUC: Unsupervised evaluation of multiple network node ranks using link prediction In: International Conference on Complex Networks and Their Applications, Vol. 1, 3\u201314.. Springer, Cham.","DOI":"10.1007\/978-3-030-36687-2_1"},{"key":"287_CR38","doi-asserted-by":"crossref","unstructured":"Krasanakis, E, Schinas E, Papadopoulos S, Kompatsiaris Y, Symeonidis A (2019b) Boosted Seed Oversampling. Inf Process Manag 57(2):102053. Elsevier, Amsterdam.","DOI":"10.1016\/j.ipm.2019.06.002"},{"issue":"1","key":"287_CR39","first-page":"1","volume":"15","author":"Y Kuwashima","year":"2016","unstructured":"Kuwashima, Y (2016) Structural equivalence and cohesion can explain bandwagon and snob effect. Ann Bus Adm Sci 15(1):1\u201314.","journal-title":"Ann Bus Adm Sci"},{"issue":"3","key":"287_CR40","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A, Fortunato S, Kert\u00e9sz J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033015.","journal-title":"New J Phys"},{"issue":"1","key":"287_CR41","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web (TWEB) 1(1):5.","journal-title":"ACM Trans Web (TWEB)"},{"issue":"1","key":"287_CR42","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123.","journal-title":"Internet Math"},{"key":"287_CR43","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/1772690.1772755","volume-title":"Proceedings of the 19th International Conference on World Wide Web","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J, Lang KJ, Mahoney M (2010) Empirical comparison of algorithms for network community detection In: Proceedings of the 19th International Conference on World Wide Web, 631\u2013640.. ACM, New York."},{"key":"287_CR44","first-page":"2177","volume-title":"Advances in Neural Information Processing Systems","author":"O Levy","year":"2014","unstructured":"Levy, O, Goldberg Y (2014) Neural word embedding as implicit matrix factorization In: Advances in Neural Information Processing Systems, 2177\u20132185.. MIT Press, Cambridge."},{"key":"287_CR45","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, Palo Alto.","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"287_CR46","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D, Kleinberg J (2007) J Am Soc Inf Sci Technol 58(7):1019\u20131031.","DOI":"10.1002\/asi.20591"},{"key":"287_CR47","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/2835776.2835823","volume-title":"Proceedings of the Ninth ACM International Conference on Web Search and Data Mining","author":"P Lofgren","year":"2016","unstructured":"Lofgren, P, Banerjee S, Goel A (2016) Personalized pagerank estimation and search: A bidirectional approach In: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 163\u2013172.. ACM, New York."},{"issue":"6","key":"287_CR48","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc, L, Zhou T (2011) Link prediction in complex networks: A survey. Phys A Stat Mech Appl 390(6):1150\u20131170.","journal-title":"Phys A Stat Mech Appl"},{"issue":"4","key":"287_CR49","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, V, Berzal F, Cubero J-C (2017) A survey of link prediction in complex networks. ACM Comput Surv (CSUR) 49(4):69.","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"584","key":"287_CR50","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1256\/003590002320603584","volume":"128","author":"SJ Mason","year":"2002","unstructured":"Mason, SJ, Graham NE (2002) Areas beneath the relative operating characteristics (roc) and relative operating levels (rol) curves: Statistical significance and interpretation. Q J R Meteorol Soc 128(584):2145\u20132166.","journal-title":"Q J R Meteorol Soc"},{"issue":"1","key":"287_CR51","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson, M, Smith-Lovin L, Cook JM (2001) Birds of a feather: Homophily in social networks. Annu Rev Sociol 27(1):415\u2013444.","journal-title":"Annu Rev Sociol"},{"key":"287_CR52","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-642-23783-6_28","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"AK Menon","year":"2011","unstructured":"Menon, AK, Elkan C (2011) Link prediction via matrix factorization In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, 437\u2013452.. Springer, Berlin."},{"key":"287_CR53","unstructured":"Namata, G, London B, Getoor L, Huang B, EDU U (2012) Query-driven active surveying for collective classification In: 10th International Workshop on Mining and Learning with Graphs, vol. 8."},{"issue":"23","key":"287_CR54","doi-asserted-by":"crossref","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.","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"287_CR55","doi-asserted-by":"crossref","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.","journal-title":"Soc Netw"},{"issue":"5","key":"287_CR56","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1109\/JPROC.2018.2820126","volume":"106","author":"A Ortega","year":"2018","unstructured":"Ortega, A, Frossard P, Kova\u010devi\u0107 J, Moura JM, Vandergheynst P (2018) Graph signal processing: Overview, challenges, and applications. Proc IEEE 106(5):808\u2013828.","journal-title":"Proc IEEE"},{"issue":"3","key":"287_CR57","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S, Kompatsiaris Y, Vakali A, Spyridonos P (2012) Community detection in social media. Data Min Knowl Disc 24(3):515\u2013554.","journal-title":"Data Min Knowl Disc"},{"issue":"5","key":"287_CR58","doi-asserted-by":"crossref","first-page":"1602548","DOI":"10.1126\/sciadv.1602548","volume":"3","author":"L Peel","year":"2017","unstructured":"Peel, L, Larremore DB, Clauset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):1602548.","journal-title":"Sci Adv"},{"issue":"5","key":"287_CR59","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1109\/TVCG.2006.122","volume":"12","author":"A Perer","year":"2006","unstructured":"Perer, A, Shneiderman B (2006) Balancing systematic and flexible exploration of social networks. IEEE Trans Vis Comput Graph 12(5):693\u2013700.","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"287_CR60","unstructured":"PubMed network (2012). PubMed Diabetes from https:\/\/linqs.soe.ucsc.edu\/data. Accessed 28 Feb 2020."},{"key":"287_CR61","unstructured":"Python Graph Ranking (pygrank) library (2019). https:\/\/github.com\/MKLab-ITI\/pygrank. Accessed 28 Feb 2020."},{"issue":"4","key":"287_CR62","doi-asserted-by":"crossref","first-page":"1878","DOI":"10.1214\/11-AOS887","volume":"39","author":"K Rohe","year":"2011","unstructured":"Rohe, K, Chatterjee S, Yu B, et al. (2011) Spectral clustering and the high-dimensional stochastic blockmodel. Ann Stat 39(4):1878\u20131915.","journal-title":"Ann Stat"},{"issue":"1","key":"287_CR63","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, SE (2007) Graph clustering. Comput Scie Rev 1(1):27\u201364.","journal-title":"Comput Scie Rev"},{"issue":"3","key":"287_CR64","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93\u201393.","journal-title":"AI Mag"},{"key":"287_CR65","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-0-387-85820-3_8","volume-title":"Recommender Systems Handbook","author":"G Shani","year":"2011","unstructured":"Shani, G, Gunawardana A (2011) Evaluating recommendation systems In: Recommender Systems Handbook, 257\u2013297.. Springer, Berlin."},{"key":"287_CR66","doi-asserted-by":"crossref","first-page":"106124","DOI":"10.1109\/ACCESS.2019.2932396","volume":"7","author":"B Shi","year":"2019","unstructured":"Shi, B, Zhou C, Qiu H, Xu X, Liu J (2019) Unifying structural proximity and equivalence for network embedding. IEEE Access 7:106124\u2013106138.","journal-title":"IEEE Access"},{"key":"287_CR67","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2957610","volume-title":"Local symmetry in random graphs, IEEE Transactions on Network Science and Engineering","author":"JE Sim\u00f5es","year":"2019","unstructured":"Sim\u00f5es, JE, Figueiredo DR, Barbosa VC (2019) Local symmetry in random graphs, IEEE Transactions on Network Science and Engineering. IEEE, New York. https:\/\/doi.org\/10.1109\/TNSE.2019.2957610."},{"key":"287_CR68","unstructured":"Stanford Network Analysis Project (SNAP) datasets (2009). https:\/\/snap.stanford.edu\/data\/. Accessed 28 Feb 2020."},{"issue":"22","key":"287_CR69","doi-asserted-by":"crossref","first-page":"5772","DOI":"10.1016\/j.physa.2013.07.021","volume":"392","author":"SA Tabrizi","year":"2013","unstructured":"Tabrizi, SA, Shakery A, Asadpour M, Abbasi M, Tavallaie MA (2013) Personalized pagerank clustering: A graph clustering algorithm based on random walks. Phys A Stat Mech Appl 392(22):5772\u20135785.","journal-title":"Phys A Stat Mech Appl"},{"key":"287_CR70","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.cam.2016.08.034","volume":"313","author":"X Tan","year":"2017","unstructured":"Tan, X (2017) A new extrapolation method for pagerank computations. J Comput Appl Math 313:383\u2013392.","journal-title":"J Comput Appl Math"},{"key":"287_CR71","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1145\/2736277.2741093","volume-title":"Proceedings of the 24th International Conference on World Wide Web","author":"J Tang","year":"2015","unstructured":"Tang, J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: Large-scale information network embedding In: Proceedings of the 24th International Conference on World Wide Web, 1067\u20131077.. ACM, New York."},{"key":"287_CR72","doi-asserted-by":"crossref","unstructured":"Tang, J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: extraction and mining of academic social networks In: Proceedings of the 14th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 990\u2013998.. ACM.","DOI":"10.1145\/1401890.1402008"},{"key":"287_CR73","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1145\/2939672.2939753","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"D Wang","year":"2016","unstructured":"Wang, D, Cui P, Zhu W (2016) Structural deep network embedding In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1225\u20131234.. ACM, New York."},{"key":"287_CR74","first-page":"6","volume-title":"Proceedings of the 26th Annual Conference on Learning Theory (COLT 2013), vol. 8","author":"Y Wang","year":"2013","unstructured":"Wang, Y, Wang L, Li Y, He D, Chen W, Liu T-Y (2013) A theoretical analysis of ndcg ranking measures In: Proceedings of the 26th Annual Conference on Learning Theory (COLT 2013), vol. 8, 6.. PMLR, Paris."},{"issue":"5","key":"287_CR75","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","volume":"28","author":"JJ Whang","year":"2016","unstructured":"Whang, JJ, Gleich DF, Dhillon IS (2016) Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans Knowl Data Eng 28(5):1272\u20131284.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"287_CR76","first-page":"3077","volume-title":"Advances in Neural Information Processing Systems","author":"X-M Wu","year":"2012","unstructured":"Wu, X-M, Li Z, So AM, Wright J, Chang S-F (2012) Learning with partially absorbing random walks In: Advances in Neural Information Processing Systems, 3077\u20133085.. MIT Press, Cambridge."},{"key":"287_CR77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physa.2016.01.038","volume":"452","author":"Z Wu","year":"2016","unstructured":"Wu, Z, Lin Y, Wang J, Gregory S (2016) Link prediction with node clustering coefficient. Phys A Stat Mech Appl 452:1\u20138.","journal-title":"Phys A Stat Mech Appl"},{"issue":"4","key":"287_CR78","first-page":"43","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie, J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput Surv (CSUR) 45(4):43.","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"1","key":"287_CR79","doi-asserted-by":"crossref","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. ACM, New York.","journal-title":"Knowl Inf Syst"},{"key":"287_CR80","doi-asserted-by":"crossref","unstructured":"Yang, C, Sun M, Liu Z, Tu C (2017) Fast network embedding enhancement via high order proximity approximation In: IJCAI, 3894\u20133900.","DOI":"10.24963\/ijcai.2017\/544"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00287-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-020-00287-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00287-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T23:20:14Z","timestamp":1667690414000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-020-00287-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,6]]},"references-count":80,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["287"],"URL":"https:\/\/doi.org\/10.1007\/s41109-020-00287-x","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2020,8,6]]},"assertion":[{"value":"28 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"48"}}