{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T10:51:35Z","timestamp":1784631095780,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1422918"],"award-info":[{"award-number":["IIS-1422918"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1546488"],"award-info":[{"award-number":["IIS-1546488"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1909528"],"award-info":[{"award-number":["CCF-1909528"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1830274"],"award-info":[{"award-number":["DMS-1830274"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Army Research Organization","award":["W911NF19-1-0057"],"award-info":[{"award-number":["W911NF19-1-0057"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s13278-020-00671-6","type":"journal-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T12:02:36Z","timestamp":1596110556000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Neighborhood and PageRank methods for pairwise link prediction"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-2909-5202","authenticated-orcid":false,"given":"Huda","family":"Nassar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Austin R.","family":"Benson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"issue":"3","key":"671_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"key":"671_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal M, Zitnik M, Leskovec J (2018) Large-scale analysis of disease pathways in the human interactome. In: Pacific symposium on biocomputing, vol\u00a023, p 111. World Scientific","DOI":"10.1101\/189787"},{"key":"671_CR3","doi-asserted-by":"crossref","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. IEEE","DOI":"10.1109\/FOCS.2006.44"},{"key":"671_CR4","doi-asserted-by":"crossref","unstructured":"Avin C et al (2015) Core size and densification in preferential attachment networks. In: International colloquium on automata. languages, and programming, ICALP 2015. Springer, Berlin, pp 492\u2013503","DOI":"10.1007\/978-3-662-47666-6_39"},{"key":"671_CR5","doi-asserted-by":"crossref","unstructured":"Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. WSDM \u201911, pp 635\u2013644. ACM, New York, NY, USA","DOI":"10.1145\/1935826.1935914"},{"key":"671_CR6","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si A.L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439), 509\u2013512 . https:\/\/2.zoppoz.workers.dev:443\/https\/science.sciencemag.org\/content\/286\/5439\/509.full.pdf","DOI":"10.1126\/science.286.5439.509"},{"key":"671_CR7","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT, Jadbabaie A, Kleinberg J (2018) Simplicial closure and higher-order link prediction. Proc Natl Acad Sci 115:E11221\u2013E11230","journal-title":"Proc Natl Acad Sci"},{"issue":"6295","key":"671_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"issue":"2","key":"671_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/16M1074023","volume":"59","author":"AR Benson","year":"2017","unstructured":"Benson AR, Gleich DF, Lim LH (2017) The spacey random walk: a stochastic process for higher-order data. SIAM Rev 59(2):321\u2013345","journal-title":"SIAM Rev"},{"key":"671_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453:98. https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1038\/nature06830","journal-title":"Nature"},{"key":"671_CR11","doi-asserted-by":"crossref","unstructured":"Dave V, Hasan M (2019) Triangle completion time prediction using time-conserving embedding. ECMLPKDD","DOI":"10.1007\/978-3-030-46150-8_32"},{"key":"671_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, crowds, and markets: reasoning about a highly connected world","author":"D Easley","year":"2010","unstructured":"Easley D, Kleinberg J (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, Cambridge"},{"key":"671_CR13","doi-asserted-by":"crossref","unstructured":"Eikmeier N, Ramani AS, Gleich DF (2018) The hyperkron graph model for higher-order features. In: IEEE international conference on data mining, ICDM 2018, Singapore, 2018","DOI":"10.1109\/ICDM.2018.00115"},{"issue":"3","key":"671_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich DF (2015) PageRank beyond the web. SIAM Rev 57(3):321\u2013363","journal-title":"SIAM Rev"},{"issue":"4","key":"671_CR15","first-page":"13:1","volume":"6","author":"CA Gomez-Uribe","year":"2015","unstructured":"Gomez-Uribe CA, Hunt N (2015) The netflix recommender system: algorithms, business value, and innovation. ACM Trans Manag Inf Syst 6(4):13:1\u201313:19","journal-title":"ACM Trans Manag Inf Syst"},{"key":"671_CR16","doi-asserted-by":"crossref","unstructured":"Granovetter M.S (1977) The strength of weak ties. In: Social networks, pp 347\u2013367. Elsevier","DOI":"10.1016\/B978-0-12-442450-0.50025-0"},{"key":"671_CR17","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimer\u00e0","year":"2003","unstructured":"Guimer\u00e0 R, Danon L, D\u00edaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68:065103","journal-title":"Phys Rev E"},{"key":"671_CR18","doi-asserted-by":"crossref","unstructured":"Holland P.W, Leinhardt S (1977) A method for detecting structure in sociometric data. In: Social networks, pp 411\u2013432. Elsevier","DOI":"10.1016\/B978-0-12-442450-0.50028-6"},{"issue":"1","key":"671_CR19","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":"4","key":"671_CR20","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte R, Rosvall M, Scholtes I (2019) From networks to optimal higher-order models of complex systems. Nat Phys 15(4):313\u2013320","journal-title":"Nat Phys"},{"issue":"7","key":"671_CR21","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"key":"671_CR22","doi-asserted-by":"crossref","unstructured":"Lin C.H, Konecki D.M, Liu M, Wilson S.J, Nassar H, Wilkins A.D, Gleich D.F, Lichtarge O (2018) Multimodal network diffusion predicts future disease-gene-chemical associations","DOI":"10.1093\/bioinformatics\/bty858"},{"key":"671_CR23","doi-asserted-by":"crossref","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, WSDM \u201916, pp 163\u2013172. ACM, New York","DOI":"10.1145\/2835776.2835823"},{"issue":"6","key":"671_CR24","doi-asserted-by":"publisher","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":"6","key":"671_CR25","doi-asserted-by":"publisher","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 (2011b) Link prediction in complex networks: a survey. Phys A 390(6):1150\u20131170","journal-title":"Phys A"},{"issue":"5663","key":"671_CR26","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R (2004) Superfamilies of evolved and designed networks. Science 303(5663):1538\u20131542","journal-title":"Science"},{"key":"671_CR27","doi-asserted-by":"crossref","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: Simple building blocks of complex networks. Science 298(5594), 824\u2013827. https:\/\/2.zoppoz.workers.dev:443\/https\/science.sciencemag.org\/content\/298\/5594\/824.full.pdf","DOI":"10.1126\/science.298.5594.824"},{"key":"671_CR28","doi-asserted-by":"crossref","unstructured":"Nassar H, Benson AR, Gleich DF (2019) Pairwise link prediction. ASONAM","DOI":"10.1145\/3341161.3342897"},{"key":"671_CR29","unstructured":"Nassar H, Gleich DF (2018) Matrixnetworks.jl. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/nassarhuda\/MatrixNetworks.jl"},{"key":"671_CR30","doi-asserted-by":"publisher","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman MEJ (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64:025102","journal-title":"Phys Rev E"},{"key":"671_CR31","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Technical report 1999-66, Stanford InfoLab . Previous number = SIDL-WP-1999-0120"},{"issue":"5","key":"671_CR32","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1002\/asi.21015","volume":"60","author":"P Panzarasa","year":"2009","unstructured":"Panzarasa P, Opsahl T, Carley KM (2009) Patterns and dynamics of users\u2019 behavior and interaction: network analysis of an online community. J Am Soc Inform Sci Technol 60(5):911\u2013932","journal-title":"J Am Soc Inform Sci Technol"},{"issue":"4","key":"671_CR33","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/BF02476440","volume":"15","author":"A Rapoport","year":"1953","unstructured":"Rapoport A (1953) Spread of information through a population with socio-structural bias: I. assumption of transitivity. Bull Math Biophys 15(4):523\u2013533","journal-title":"Bull Math Biophys"},{"key":"671_CR34","doi-asserted-by":"publisher","unstructured":"Schoenebeck G (2013) Potential networks, contagious communities, and understanding social network structure. In: Proceedings of the 22nd international conference on World Wide Web, WWW \u201913, pp 1123\u20131132. Association for computing machinery, New York. https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/2488388.2488486","DOI":"10.1145\/2488388.2488486"},{"key":"671_CR35","doi-asserted-by":"crossref","unstructured":"Soundarajan S, Hopcroft J (2012) Using community information to improve the precision of link prediction methods. In: Proceedings of the 21st international conference on World Wide Web, pp 607\u2013608","DOI":"10.1145\/2187980.2188150"},{"key":"671_CR36","unstructured":"Stanford SNAP Group: (2017) Miner: Gigascale multimodal biological network. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/snap-stanford\/miner-data"},{"key":"671_CR37","doi-asserted-by":"publisher","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Phys A Stat Mechan Appl 391(16):4165\u20134180. https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.physa.2011.12.021. https:\/\/2.zoppoz.workers.dev:443\/http\/www.sciencedirect.com\/science\/article\/pii\/S0378437111009186","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"671_CR38","doi-asserted-by":"publisher","first-page":"D1074","DOI":"10.1093\/nar\/gkx1037","volume":"46","author":"DS Wishart","year":"2017","unstructured":"Wishart DS et al (2017) DrugBank 5.0: a major update to the DrugBank database for 2018. Nucleic Acids Res 46:D1074\u2013D1082","journal-title":"Nucleic Acids Res"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00671-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s13278-020-00671-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00671-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T00:24:41Z","timestamp":1627604681000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s13278-020-00671-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["671"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s13278-020-00671-6","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,30]]},"assertion":[{"value":"23 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"63"}}