{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T16:05:01Z","timestamp":1786637101019,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403302","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:03:53Z","timestamp":1597964633000},"page":"2523-2532","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Grale"],"prefix":"10.1145","author":[{"given":"Jonathan","family":"Halcrow","sequence":"first","affiliation":[{"name":"Google Research, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandru","family":"Mosoi","sequence":"additional","affiliation":[{"name":"YouTube, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sam","family":"Ruth","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bryan","family":"Perozzi","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Abu-El-Haija et al","author":"S.","year":"2017","unstructured":"S. Abu-El-Haija et al . 2017 . Learning edge representations via low-rank asymmetric projections. CIKM. S. Abu-El-Haija et al. 2017. Learning edge representations via low-rank asymmetric projections. CIKM."},{"key":"e_1_3_2_2_2_1","volume-title":"SDM Workshops.","author":"Al M.","unstructured":"M. Al Hasan et al. 2006. Link prediction using supervised learning . SDM Workshops. M. Al Hasan et al. 2006. Link prediction using supervised learning. SDM Workshops."},{"key":"e_1_3_2_2_3_1","unstructured":"A. Blum etal 2001. Learning from labeled and unlabeled data using graph mincuts. ICML.  A. Blum et al. 2001. Learning from labeled and unlabeled data using graph mincuts. ICML."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"J. Bromley etal 1994. Signature verification using a \"siamese\" time delay neural network. NIPS.  J. Bromley et al. 1994. Signature verification using a \"siamese\" time delay neural network. NIPS.","DOI":"10.1142\/9789812797926_0003"},{"key":"e_1_3_2_2_5_1","unstructured":"I. Chami etal 2020. Machine learning on graphs: a model and comprehensive taxonomy. arXiv preprint arXiv:2005.03675.  I. Chami et al. 2020. Machine learning on graphs: a model and comprehensive taxonomy. arXiv preprint arXiv:2005.03675."},{"key":"e_1_3_2_2_6_1","unstructured":"H. Chen etal 2018. A tutorial on network embeddings. arXiv preprint arXiv:1808.02590.  H. Chen et al. 2018. A tutorial on network embeddings. arXiv preprint arXiv:1808.02590."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"H. Chen etal 2018. Enhanced network embeddings via exploiting edge labels. CIKM.  H. Chen et al. 2018. Enhanced network embeddings via exploiting edge labels. CIKM.","DOI":"10.1145\/3269206.3269270"},{"key":"e_1_3_2_2_8_1","unstructured":"H. Chen etal 2005. Link prediction approach to collaborative filtering. JCDL.  H. Chen et al. 2005. Link prediction approach to collaborative filtering. JCDL."},{"key":"e_1_3_2_2_9_1","unstructured":"P. Cui etal 2018. A survey on network embedding. TKDE.  P. Cui et al. 2018. A survey on network embedding. TKDE."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"C. A. R. de Sousa etal 2013. Influence of graph construction on semi-supervised learning. ECML\/PKDD.  C. A. R. de Sousa et al. 2013. Influence of graph construction on semi-supervised learning. ECML\/PKDD.","DOI":"10.1007\/978-3-642-40994-3_11"},{"key":"e_1_3_2_2_11_1","unstructured":"C. Kanich etal 2011. Show me the money: characterizing spam-advertised revenue. SEC.  C. Kanich et al. 2011. Show me the money: characterizing spam-advertised revenue. SEC."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"M. Karasuyama etal 2017. Adaptive edge weighting for graph-based learning algorithms. Mach. Learn.  M. Karasuyama et al. 2017. Adaptive edge weighting for graph-based learning algorithms. Mach. Learn.","DOI":"10.1007\/s10994-016-5607-3"},{"key":"e_1_3_2_2_13_1","unstructured":"D. P. Kingma etal 2014. Semi-supervised learning with deep generative models. NIPS.  D. P. Kingma et al. 2014. Semi-supervised learning with deep generative models. NIPS."},{"key":"e_1_3_2_2_14_1","volume-title":"ICML Workshops.","author":"Koch G.","year":"2015","unstructured":"G. Koch . 2015 . Siamese neural networks for one-shot image recognition . ICML Workshops. G. Koch. 2015. Siamese neural networks for one-shot image recognition. ICML Workshops."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"K. Levchenko etal 2011. Click trajectories: end-to-end analysis of the spam value chain. S&P.  K. Levchenko et al. 2011. Click trajectories: end-to-end analysis of the spam value chain. S&P.","DOI":"10.1109\/SP.2011.24"},{"key":"e_1_3_2_2_16_1","volume-title":"v. d. Maaten et al","author":"L.","year":"2008","unstructured":"L. v. d. Maaten et al . 2008 . Visualizing data using t-sne. JMLR. L. v. d. Maaten et al. 2008. Visualizing data using t-sne. JMLR."},{"key":"e_1_3_2_2_17_1","unstructured":"D. McCoy etal 2012. Pharmaleaks: understanding the business of online pharmaceutical affiliate programs. SEC.  D. McCoy et al. 2012. Pharmaleaks: understanding the business of online pharmaceutical affiliate programs. SEC."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"E. M\u00fcller etal 2009. Evaluating clustering in subspace projections of high dimensional data. VLDB.  E. M\u00fcller et al. 2009. Evaluating clustering in subspace projections of high dimensional data. VLDB.","DOI":"10.14778\/1687627.1687770"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186008X318855"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"B. Perozzi etal 2014. Deepwalk: online learning of social representations. KDD.  B. Perozzi et al. 2014. Deepwalk: online learning of social representations. KDD.","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"B. Perozzi etal 2014. Focused clustering and outlier detection in large attributed graphs. KDD.  B. Perozzi et al. 2014. Focused clustering and outlier detection in large attributed graphs. KDD.","DOI":"10.1145\/2623330.2623682"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"B. Perozzi etal 2016. When recommendation goes wrong: anomalous link discovery in recommendation networks. KDD.  B. Perozzi et al. 2016. When recommendation goes wrong: anomalous link discovery in recommendation networks. KDD.","DOI":"10.1145\/2939672.2939734"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"N. Ponomareva etal 2017. Compact multi-class boosted trees. Big Data.  N. Ponomareva et al. 2017. Compact multi-class boosted trees. Big Data.","DOI":"10.1109\/BigData.2017.8257910"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"N. Ponomareva etal 2017. Tf boosted trees: a scalable tensorflow based framework for gradient boosting. ECML\/PKDD. Y. Altun et al. editors.  N. Ponomareva et al. 2017. Tf boosted trees: a scalable tensorflow based framework for gradient boosting. ECML\/PKDD. Y. Altun et al. editors.","DOI":"10.1007\/978-3-319-71273-4_44"},{"key":"e_1_3_2_2_25_1","unstructured":"S. Ravi etal 2016. Large scale distributed semi-supervised learning using streaming approximation. Artificial Intelligence and Statistics 519--528.  S. Ravi et al. 2016. Large scale distributed semi-supervised learning using streaming approximation. Artificial Intelligence and Statistics 519--528."},{"key":"e_1_3_2_2_26_1","unstructured":"G. T. Report. [n. d.] https:\/\/transparencyreport.google.com\/youtube-policy\/ removals. ().  G. T. Report. [n. d.] https:\/\/transparencyreport.google.com\/youtube-policy\/ removals. ()."},{"key":"e_1_3_2_2_27_1","unstructured":"T. Salimans etal 2016. Improved techniques for training gans. NIPS.  T. Salimans et al. 2016. Improved techniques for training gans. NIPS."},{"key":"e_1_3_2_2_28_1","volume-title":"Virus Bulletin Conference.","author":"Samosseiko D.","year":"2009","unstructured":"D. Samosseiko . 2009 . The partnerka-what is it, and why should you care . Virus Bulletin Conference. D. Samosseiko. 2009. The partnerka-what is it, and why should you care. Virus Bulletin Conference."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"X. Wu etal 2018. A quest for structure: jointly learning the graph structure and semi-supervised classification. CIKM.  X. Wu et al. 2018. A quest for structure: jointly learning the graph structure and semi-supervised classification. CIKM.","DOI":"10.1145\/3269206.3271692"},{"key":"e_1_3_2_2_30_1","unstructured":"Z. Yang etal 2016. Revisiting semi-supervised learning with graph embeddings. ICML.  Z. Yang et al. 2016. Revisiting semi-supervised learning with graph embeddings. ICML."},{"key":"e_1_3_2_2_31_1","unstructured":"YouTube. [n. d.] https:\/\/www.youtube.com\/intl\/en-GB\/about\/press\/. ().  YouTube. [n. d.] https:\/\/www.youtube.com\/intl\/en-GB\/about\/press\/. ()."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Y.-M. Zhang etal 2013. Fast knn graph construction with locality sensitive hashing. ECML\/PKKD.  Y.-M. Zhang et al. 2013. Fast knn graph construction with locality sensitive hashing. ECML\/PKKD.","DOI":"10.1007\/978-3-642-40991-2_42"},{"key":"e_1_3_2_2_33_1","unstructured":"D. Zhou etal 2003. Learning with local and global consistency. NIPS.  D. Zhou et al. 2003. Learning with local and global consistency. NIPS."},{"key":"e_1_3_2_2_34_1","unstructured":"X. Zhu etal 2003. Semi-supervised learning using gaussian fields and harmonic functions. ICML.  X. Zhu et al. 2003. Semi-supervised learning using gaussian fields and harmonic functions. ICML."}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:48Z","timestamp":1750197708000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403302"}},"subtitle":["Designing Networks for Graph Learning"],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":34,"alternative-id":["10.1145\/3394486.3403302","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403302","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}