{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:43:16Z","timestamp":1774539796482,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,9]],"date-time":"2011-02-09T00:00:00Z","timestamp":1297209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,2,9]]},"DOI":"10.1145\/1935826.1935914","type":"proceedings-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T15:50:27Z","timestamp":1296575427000},"page":"635-644","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":692,"title":["Supervised random walks"],"prefix":"10.1145","author":[{"given":"Lars","family":"Backstrom","sequence":"first","affiliation":[{"name":"Facebook, Inc., Palo Alto, CA, USA"}]},{"given":"Jure","family":"Leskovec","sequence":"additional","affiliation":[{"name":"Stanford University, Palo Alto, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,2,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273498"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150409"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/24.2.209"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(78)90102-X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972962.8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1086\/228943"},{"key":"e_1_3_2_1_11_1","volume-title":"IJCAI '05","author":"Diligenti M.","year":"2005","unstructured":"M. Diligenti , M. Gori , and M. Maggini . Learning web page scores by error back--propagation . In IJCAI '05 , 2005 . M. Diligenti, M. Gori, and M. Maggini. Learning web page scores by error back--propagation. In IJCAI '05, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/980972.980992"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2086737.2086741"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529607"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796570"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401948"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348550"},{"key":"e_1_3_2_1_24_1","volume-title":"NIPS '10","author":"Myers S.","year":"2010","unstructured":"S. Myers and J. Leskovec . On the convexity of latent social network inference . In NIPS '10 , 2010 . S. Myers and J. Leskovec. On the convexity of latent social network inference. In NIPS '10, 2010."},{"key":"e_1_3_2_1_25_1","volume-title":"Stanford Dig. Lib. Tech. Proj.","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The pagerank citation ranking: Bringing order to the web. Technical report , Stanford Dig. Lib. Tech. Proj. , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Dig. Lib. Tech. Proj., 1998."},{"key":"e_1_3_2_1_26_1","volume-title":"Statistical relational learning for link prediction","author":"Popescul A.","year":"2003","unstructured":"A. Popescul , R. Popescul , and L. H. Ungar . Statistical relational learning for link prediction , 2003 . A. Popescul, R. Popescul, and L. H. Ungar. Statistical relational learning for link prediction, 2003."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526715"},{"key":"e_1_3_2_1_28_1","volume-title":"NIPS '03","author":"Taskar B.","year":"2003","unstructured":"B. Taskar , M. F. Wong , P. Abbeel , and D. Koller . Link prediction in relational data . In NIPS '03 , 2003 . B. Taskar, M. F. Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In NIPS '03, 2003."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150448"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281272"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_1_32_1","first-page":"848","volume-title":"ICML '03","author":"Yan L.","year":"2003","unstructured":"L. Yan , R. Dodier , M. Mozer , and R. Wolniewicz . Optimizing classifier performance via an approximation to the wilcoxon-mann-whitney statistic . In ICML '03 , pages 848 -- 855 , 2003 . L. Yan, R. Dodier, M. Mozer, and R. Wolniewicz. Optimizing classifier performance via an approximation to the wilcoxon-mann-whitney statistic. In ICML '03, pages 848--855, 2003."}],"event":{"name":"WSDM'11: Fourth ACM International Conference on Web Search and Data Mining","location":"Hong Kong China","acronym":"WSDM'11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the fourth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935914","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1935826.1935914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:34Z","timestamp":1750250734000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935914"}},"subtitle":["predicting and recommending links in social networks"],"short-title":[],"issued":{"date-parts":[[2011,2,9]]},"references-count":32,"alternative-id":["10.1145\/1935826.1935914","10.1145\/1935826"],"URL":"https:\/\/doi.org\/10.1145\/1935826.1935914","relation":{},"subject":[],"published":{"date-parts":[[2011,2,9]]},"assertion":[{"value":"2011-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}