{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:58Z","timestamp":1740109318511,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T00:00:00Z","timestamp":1645142400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T00:00:00Z","timestamp":1645142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["Graduate Research Fellowship"],"award-info":[{"award-number":["Graduate Research Fellowship"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006751","name":"U.S. Army","doi-asserted-by":"publisher","award":["W9-11NF1810397"],"award-info":[{"award-number":["W9-11NF1810397"]}],"id":[{"id":"10.13039\/100006751","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS 1845491"],"award-info":[{"award-number":["IIS 1845491"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004344","name":"Adobe Systems","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100004344","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100016443","name":"Amazon","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100016443","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10115-021-01632-x","type":"journal-article","created":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T05:02:42Z","timestamp":1645160562000},"page":"743-771","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A hidden challenge of link prediction: which pairs to check?"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6256-3381","authenticated-orcid":false,"given":"Caleb","family":"Belth","sequence":"first","affiliation":[]},{"given":"Alican","family":"B\u00fcy\u00fck\u00e7ak\u0131r","sequence":"additional","affiliation":[]},{"given":"Danai","family":"Koutra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,18]]},"reference":[{"issue":"3","key":"1632_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"},{"issue":"6","key":"1632_CR2","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1016\/j.neuron.2012.06.006","volume":"74","author":"AP Alivisatos","year":"2012","unstructured":"Alivisatos AP, Chun M, Church GM, Greenspan RJ, Roukes ML, Yuste R (2012) The brain activity map project and the challenge of functional connectomics. Neuron 74(6):970\u2013974","journal-title":"Neuron"},{"key":"1632_CR3","doi-asserted-by":"crossref","unstructured":"Bawa M, Condie T, Ganesan P (2005) Lsh forest: self-tuning indexes for similarity search. In WWW, pp 651\u2013660","DOI":"10.1145\/1060745.1060840"},{"key":"1632_CR4","doi-asserted-by":"crossref","unstructured":"Belth C, B\u00fcy\u00fck\u00e7ak\u0131r A, Koutra D (2020) A hidden challenge of link prediction: Which pairs to check? In: ICDM, pp 831\u2013840. IEEE","DOI":"10.1109\/ICDM50108.2020.00092"},{"key":"1632_CR5","doi-asserted-by":"crossref","unstructured":"Belth C, Zheng X, Koutra D (2020) Mining persistent activity in continually evolving networks. In: KDD","DOI":"10.1145\/3394486.3403136"},{"key":"1632_CR6","doi-asserted-by":"crossref","unstructured":"Charikar MS (2002) Similarity estimation techniques from rounding algorithms. In: STOC","DOI":"10.1145\/509907.509965"},{"key":"1632_CR7","doi-asserted-by":"crossref","unstructured":"Donnat C, Zitnik M, Hallac D, Leskovec J (2018) Learning structural node embeddings via diffusion wavelets. In: KDD, pp 1320\u20131329. ACM","DOI":"10.1145\/3219819.3220025"},{"key":"1632_CR8","doi-asserted-by":"crossref","unstructured":"Duan L, Ma S, Aggarwal C, Ma T, Huai J (2017) An ensemble approach to link prediction. In: IEEE TKDE 29(11)","DOI":"10.1109\/TKDE.2017.2730207"},{"key":"1632_CR9","doi-asserted-by":"crossref","unstructured":"Gao M, Chen L, He X, Aoying Z (2018) Bipartite network embedding. In: SIGIR, Bine","DOI":"10.1145\/3209978.3209987"},{"key":"1632_CR10","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: KDD, pp 855\u2013864. ACM","DOI":"10.1145\/2939672.2939754"},{"issue":"3","key":"1632_CR11","first-page":"52","volume":"40","author":"WL Hamilton","year":"2017","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. IEEE Data Eng Bull 40(3):52\u201374","journal-title":"IEEE Data Eng Bull"},{"key":"1632_CR12","doi-asserted-by":"crossref","unstructured":"Heimann M, Shen H, Safavi T, Danai K (2018) Representation learning-based graph alignment. In: CIKM, REGAL","DOI":"10.1145\/3269206.3271788"},{"key":"1632_CR13","doi-asserted-by":"crossref","unstructured":"Di\u00a0Jin, Heimann M, Safavi, T Wang M, Lee W, Snider L, Koutra D (2019) Smart roles: inferring professional roles in email networks. In: KDD, pp 2923\u20132933. ACM","DOI":"10.1145\/3292500.3330735"},{"key":"1632_CR14","doi-asserted-by":"crossref","unstructured":"Joshi U, Urbani J (2020)Searching for embeddings in a haystack: link prediction on knowledge graphs with subgraph pruning. In: WebConf","DOI":"10.1145\/3366423.3380043"},{"key":"1632_CR15","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. In: NeurIPS workshop on Bayesian deep learning"},{"key":"1632_CR16","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: WWW","DOI":"10.1145\/2487788.2488173"},{"issue":"1","key":"1632_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1214\/10-AOAS382","volume":"5","author":"P Latouche","year":"2011","unstructured":"Latouche P, Birmel\u00e9 E, Ambroise C et al (2011) Overlapping stochastic block models with application to the French political blogosphere. Ann Appl Stat 5(1):309\u2013336","journal-title":"Ann Appl Stat"},{"key":"1632_CR18","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"1632_CR19","doi-asserted-by":"crossref","unstructured":"Levin DA, Peres Y (2017) Markov chains and mixing times, volume 107. American Mathematical Soc","DOI":"10.1090\/mbk\/107"},{"issue":"7","key":"1632_CR20","first-page":"1019","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. ASIS&T 58(7):1019\u20131031","journal-title":"ASIS&T"},{"issue":"4","key":"1632_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2016","unstructured":"Mart\u00ednez V, Berzal F, Cubero J-C (2016) A survey of link prediction in complex networks. CSUR 49(4):1\u201333","journal-title":"CSUR"},{"key":"1632_CR22","unstructured":"Mehta N, Carin L, Rai P (2019) Stochastic blockmodels meet graph neural networks. In: ICML"},{"key":"1632_CR23","unstructured":"Miller K, Michael IJ, Thomas LG (2009) Nonparametric latent feature models for link prediction. In: NeurIPS"},{"key":"1632_CR24","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2003) Mixing patterns in networks. Phys Rev E 67(2)","DOI":"10.1103\/PhysRevE.67.026126"},{"issue":"455","key":"1632_CR25","first-page":"1077","volume":"96","author":"K Nowicki","year":"2001","unstructured":"Nowicki K, Snijders TAB (2001) Estimation and prediction for stochastic blockstructures. ASIS&T 96(455):1077\u20131087","journal-title":"ASIS&T"},{"issue":"1","key":"1632_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1093\/comnet\/cnx021","volume":"6","author":"B Pachev","year":"2018","unstructured":"Pachev B, Webb B (2018) Fast link prediction for large networks using spectral embedding. J Complex Netw 6(1):79\u201394","journal-title":"J Complex Netw"},{"key":"1632_CR27","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: KDD, pp 701\u2013710. ACM","DOI":"10.1145\/2623330.2623732"},{"key":"1632_CR28","doi-asserted-by":"crossref","unstructured":"Qiu J, Dong Y, Ma H, Li J, Wang K, Tang J (2018) Network embedding as matrix factorization: unifying deepwalk, line, pte, and node2vec. In: WSDM, pp 459\u2013467. ACM","DOI":"10.1145\/3159652.3159706"},{"key":"1632_CR29","doi-asserted-by":"crossref","unstructured":"Ribeiro LFR, Saverese PHP, Figueiredo DR (2017) struc2vec: learning node representations from structural identity. In: KDD, pp 385\u2013394. ACM","DOI":"10.1145\/3097983.3098061"},{"key":"1632_CR30","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: AAAI","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"1632_CR31","doi-asserted-by":"crossref","unstructured":"Rossi RA, Di J, Kim S, Ahmed S, Koutra D, Lee JB (2020) On proximity and structural role-based embeddings in networks: Misconceptions, techniques, and applications. TKDD","DOI":"10.1145\/3397191"},{"key":"1632_CR32","doi-asserted-by":"crossref","unstructured":"Safavi T, Koutra D, Meij E (2020) Evaluating the calibration of knowledge graph embeddings for trustworthy link prediction. In: EMNLP","DOI":"10.18653\/v1\/2020.emnlp-main.667"},{"key":"1632_CR33","doi-asserted-by":"crossref","unstructured":"Song D, Meyer DA, Tao D (2015) Top-k link recommendation in social networks. In: ICDM, pp 389\u2013398. IEEE","DOI":"10.1109\/ICDM.2015.136"},{"issue":"4","key":"1632_CR34","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0010042","volume":"1","author":"O Sporns","year":"2005","unstructured":"Sporns O, Tononi G, K\u00f6tter R (2005) The human connectome: a structural description of the human brain. PLoS Comput Biol 1(4):e42","journal-title":"PLoS Comput Biol"},{"key":"1632_CR35","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Mei Q (2015) Pte: predictive text embedding through large-scale heterogeneous text networks. In: KDD, pp 1165\u20131174. ACM","DOI":"10.1145\/2783258.2783307"},{"key":"1632_CR36","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: large-scale information network embedding. In: WWW, pp 1067\u20131077. ACM","DOI":"10.1145\/2736277.2741093"},{"key":"1632_CR37","doi-asserted-by":"crossref","unstructured":"Tsybakov AB (2008) Introduction to nonparametric estimation. Springer Science & Business Media, Berlin","DOI":"10.1007\/b13794"},{"issue":"2","key":"1632_CR38","doi-asserted-by":"publisher","first-page":"e1001066","DOI":"10.1371\/journal.pcbi.1001066","volume":"7","author":"LR Varshney","year":"2011","unstructured":"Varshney LR, Chen BL, Paniagua E, Hall DH, Chklovskii DB (2011) Structural properties of the caenorhabditis elegans neuronal network. PLoS Comput Biol 7(2):e1001066","journal-title":"PLoS Comput Biol"},{"key":"1632_CR39","unstructured":"Wang J, Shen HT, Song J, Ji J (2014) Hashing for similarity search: a survey. arXiv preprint arXiv:1408.2927"},{"key":"1632_CR40","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. In: NeurIPS, pp 5165\u20135175"},{"key":"1632_CR41","doi-asserted-by":"crossref","unstructured":"Zhu J, Xingyu L, Heimann M, Koutra D (2021) Node proximity is all you need: Unified structural and positional node and graph embedding. In: SDM, SIAM","DOI":"10.1137\/1.9781611976700.19"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01632-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-021-01632-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01632-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T09:04:38Z","timestamp":1674810278000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-021-01632-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,18]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1632"],"URL":"https:\/\/doi.org\/10.1007\/s10115-021-01632-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2022,2,18]]},"assertion":[{"value":"10 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}