{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:01:45Z","timestamp":1775016105658,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":55,"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\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GU 1409\/2-1"],"award-info":[{"award-number":["GU 1409\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IGSSE","award":["GSC 81"],"award-info":[{"award-number":["GSC 81"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403296","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:17:27Z","timestamp":1597965447000},"page":"2464-2473","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":295,"title":["Scaling Graph Neural Networks with Approximate PageRank"],"prefix":"10.1145","author":[{"given":"Aleksandar","family":"Bojchevski","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]},{"given":"Johannes","family":"Gasteiger","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]},{"given":"Bryan","family":"Perozzi","sequence":"additional","affiliation":[{"name":"Google Research, New York City, NY, USA"}]},{"given":"Amol","family":"Kapoor","sequence":"additional","affiliation":[{"name":"Google Research, New York City, NY, USA"}]},{"given":"Martin","family":"Blais","sequence":"additional","affiliation":[{"name":"Google Research, New York City, NY, USA"}]},{"given":"Benedek","family":"R\u00f3zemberczki","sequence":"additional","affiliation":[{"name":"Google Research, New York City, NY, USA"}]},{"given":"Michal","family":"Lukasik","sequence":"additional","affiliation":[{"name":"Google Research, Zurich, Switzerland"}]},{"given":"Stephan","family":"G\u00fcnnemann","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"S. Abu-El-Haija A. Kapoor B. Perozzi and J. Lee. 2018. N-gcn: multi-scale graph convolution for semi-supervised node classification. arXiv preprint arXiv:1802.08888. S. Abu-El-Haija A. Kapoor B. Perozzi and J. Lee. 2018. N-gcn: multi-scale graph convolution for semi-supervised node classification. arXiv preprint arXiv:1802.08888."},{"key":"e_1_3_2_1_2_1","volume-title":"Abu-El-Haija et al","author":"S.","year":"2019","unstructured":"S. Abu-El-Haija et al . 2019 . MixHop: higher-order graph convolutional architectures via sparsified neighborhood mixing. ICML , 21--29. S. Abu-El-Haija et al. 2019. MixHop: higher-order graph convolutional architectures via sparsified neighborhood mixing. ICML, 21--29."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129302"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"R. Andersen F. Chung and K. Lang. 2006. Local graph partitioning using pagerank vectors. FOCS 475--486. R. Andersen F. Chung and K. Lang. 2006. Local graph partitioning using pagerank vectors. FOCS 475--486.","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_5_1","unstructured":"P. W. Battaglia etal 2018. Relational inductive biases deep learning and graph networks. arXiv preprint arXiv:1806.01261. P. W. Battaglia et al. 2018. Relational inductive biases deep learning and graph networks. arXiv preprint arXiv:1806.01261."},{"key":"e_1_3_2_1_6_1","unstructured":"A. Bojchevski and S. G\u00fcnnemann. 2018. Deep gaussian embedding of graphs: unsupervised inductive learning via ranking. A. Bojchevski and S. G\u00fcnnemann. 2018. Deep gaussian embedding of graphs: unsupervised inductive learning via ranking."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2006004"},{"key":"e_1_3_2_1_8_1","unstructured":"J. Bruna W. Zaremba A. Szlam and Y. LeCun. 2013. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203. J. Bruna W. Zaremba A. Szlam and Y. LeCun. 2013. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"E. Buchnik and E. Cohen. 2018. Bootstrapped graph diffusions: exposing the power of nonlinearity. SIGMETRICS 8--10. E. Buchnik and E. Cohen. 2018. Bootstrapped graph diffusions: exposing the power of nonlinearity. SIGMETRICS 8--10.","DOI":"10.1145\/3292040.3219621"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809028.1806638"},{"key":"e_1_3_2_1_11_1","unstructured":"I. Chami S. Abu-El-Haija B. Perozzi C. R\u00e9 and K. Murphy. 2020. Machine learning on graphs: a model and comprehensive taxonomy. arXiv preprint arXiv:2005.03675. I. Chami S. Abu-El-Haija B. Perozzi C. R\u00e9 and K. Murphy. 2020. Machine learning on graphs: a model and comprehensive taxonomy. arXiv preprint arXiv:2005.03675."},{"key":"e_1_3_2_1_12_1","unstructured":"J. Chen J. Zhu and L. Song. 2018. Stochastic training of graph convolutional networks with variance reduction. ICML 941--949. J. Chen J. Zhu and L. Song. 2018. Stochastic training of graph convolutional networks with variance reduction. ICML 941--949."},{"key":"e_1_3_2_1_13_1","unstructured":"J. Chen T. Ma and C. Xiao. 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247. J. Chen T. Ma and C. Xiao. 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247."},{"key":"e_1_3_2_1_14_1","unstructured":"Z. Chen L. Li and J. Bruna. 2018. Supervised community detection with line graph neural networks. Z. Chen L. Li and J. Bruna. 2018. Supervised community detection with line graph neural networks."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"W. Chiang X. Liu S. Si Y. Li S. Bengio and C. Hsieh. 2019. Cluster-gcn: an efficient algorithm for training deep and large graph convolutional networks. KDD. ACM 257--266. W. Chiang X. Liu S. Si Y. Li S. Bengio and C. Hsieh. 2019. Cluster-gcn: an efficient algorithm for training deep and large graph convolutional networks. KDD. ACM 257--266.","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_2_1_16_1","unstructured":"M. Defferrard X. Bresson and P. Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in Neural Information Processing Systems 3844--3852. M. Defferrard X. Bresson and P. Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in Neural Information Processing Systems 3844--3852."},{"key":"e_1_3_2_1_17_1","unstructured":"M. Fey and J. E. Lenssen. 2019. Fast graph representation learning with pytorch geometric. CoRR abs\/1903.02428. arXiv: 1903.02428. M. Fey and J. E. Lenssen. 2019. Fast graph representation learning with pytorch geometric. CoRR abs\/1903.02428. arXiv: 1903.02428."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"D. Fogaras and B. R\u00e1cz. 2004. Towards scaling fully personalized pagerank. WAW. D. Fogaras and B. R\u00e1cz. 2004. Towards scaling fully personalized pagerank. WAW.","DOI":"10.1007\/978-3-540-30216-2_9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Y. Fujiwara M. Nakatsuji H. Shiokawa T. Mishima and M. Onizuka. 2013. Fast and exact top-k algorithm for pagerank. AAAI. Y. Fujiwara M. Nakatsuji H. Shiokawa T. Mishima and M. Onizuka. 2013. Fast and exact top-k algorithm for pagerank. AAAI.","DOI":"10.1609\/aaai.v27i1.8454"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"H. Gao Z. Wang and S. Ji. 2018. Large-scale learnable graph convolutional networks. KDD 1416--1424. H. Gao Z. Wang and S. Ji. 2018. Large-scale learnable graph convolutional networks. KDD 1416--1424.","DOI":"10.1145\/3219819.3219947"},{"key":"e_1_3_2_1_21_1","unstructured":"J. Gilmer S. S. Schoenholz P. F. Riley O. Vinyals and G. E. Dahl. 2017. Neural message passing for quantum chemistry. arXiv preprint arXiv:1704.01212. J. Gilmer S. S. Schoenholz P. F. Riley O. Vinyals and G. E. Dahl. 2017. Neural message passing for quantum chemistry. arXiv preprint arXiv:1704.01212."},{"key":"e_1_3_2_1_22_1","unstructured":"D. F. Gleich K. Kloster and H. Nassar. 2015. Localization in seeded pagerank. arXiv preprint arXiv:1509.00016. D. F. Gleich K. Kloster and H. Nassar. 2015. Localization in seeded pagerank. arXiv preprint arXiv:1509.00016."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"M. Gori G. Monfardini and F. Scarselli. 2005. A new model for learning in graph domains. IJCNN 729--734. M. Gori G. Monfardini and F. Scarselli. 2005. A new model for learning in graph domains. IJCNN 729--734.","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"e_1_3_2_1_24_1","unstructured":"W. Hamilton Z. Ying and J. Leskovec. 2017. Inductive representation learning on large graphs. Advances in Neural Information Processing Systems 1024--1034. W. Hamilton Z. Ying and J. Leskovec. 2017. Inductive representation learning on large graphs. Advances in Neural Information Processing Systems 1024--1034."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"K. He X. Zhang S. Ren and J. Sun. 2016. Deep Residual Learning for Image Recognition. CVPR 770--778. K. He X. Zhang S. Ren and J. Sun. 2016. Deep Residual Learning for Image Recognition. CVPR 770--778.","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_1_26_1","unstructured":"W. Huang T. Zhang Y. Rong and J. Huang. 2018. Adaptive sampling towards fast graph representation learning. Advances in Neural Information Processing Systems 4563--4572. W. Huang T. Zhang Y. Rong and J. Huang. 2018. Adaptive sampling towards fast graph representation learning. Advances in Neural Information Processing Systems 4563--4572."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"G. Jeh and J. Widom. 2003. Scaling personalized web search. WWW. G. Jeh and J. Widom. 2003. Scaling personalized web search. WWW.","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"A. Kannan etal 2016. Smart reply: automated response suggestion for email. KDD 955--964. A. Kannan et al. 2016. Smart reply: automated response suggestion for email. KDD 955--964.","DOI":"10.1145\/2939672.2939801"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing 20 1. G. Karypis and V. Kumar. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing 20 1.","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_30_1","unstructured":"D. P. Kingma and J. Ba. 2014. Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980. D. P. Kingma and J. Ba. 2014. Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"e_1_3_2_1_31_1","unstructured":"T. N. Kipf and M. Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907. T. N. Kipf and M. Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"J. Gasteiger A. Bojchevski and S. G\u00fcnnemann. 2019. Predict then propagate: graph neural networks meet personalized pagerank. ICLR. J. Gasteiger A. Bojchevski and S. G\u00fcnnemann. 2019. Predict then propagate: graph neural networks meet personalized pagerank. ICLR.","DOI":"10.1145\/3394486.3403296"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Q. Li Z. Han and X.-M. Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. arXiv preprint arXiv:1801.07606. Q. Li Z. Han and X.-M. Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. arXiv preprint arXiv:1801.07606.","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"P. Lofgren S. Banerjee and A. Goel. 2016. Personalized pagerank estimation and search: a bidirectional approach. WSDM. P. Lofgren S. Banerjee and A. Goel. 2016. Personalized pagerank estimation and search: a bidirectional approach. WSDM.","DOI":"10.1145\/2835776.2835823"},{"key":"e_1_3_2_1_35_1","volume-title":"International Workshop on Algorithms and Models for the Web-Graph. Springer, 190--202","author":"Nassar H.","unstructured":"H. Nassar , K. Kloster , and D. F. Gleich . 2015. Strong localization in personalized pagerank vectors . International Workshop on Algorithms and Models for the Web-Graph. Springer, 190--202 . H. Nassar, K. Kloster, and D. F. Gleich. 2015. Strong localization in personalized pagerank vectors. International Workshop on Algorithms and Models for the Web-Graph. Springer, 190--202."},{"key":"e_1_3_2_1_36_1","volume-title":"ICML","author":"Niepert M.","unstructured":"M. Niepert , M. Ahmed , and K. Kutzkov . 2016. Learning convolutional neural networks for graphs . ICML , 2014--2023. M. Niepert, M. Ahmed, and K. Kutzkov. 2016. Learning convolutional neural networks for graphs. ICML, 2014--2023."},{"key":"e_1_3_2_1_37_1","unstructured":"L. Page S. Brin R. Motwani and T. Winograd. 1998. The pagerank citation ranking: bringing order to the web. L. Page S. Brin R. Motwani and T. Winograd. 1998. The pagerank citation ranking: bringing order to the web."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"B. Perozzi M. Schueppert J. Saalweachter and M. Thakur. 2016. When recommendation goes wrong: anomalous link discovery in recommendation networks. KDD 569--578. B. Perozzi M. Schueppert J. Saalweachter and M. Thakur. 2016. When recommendation goes wrong: anomalous link discovery in recommendation networks. KDD 569--578.","DOI":"10.1145\/2939672.2939734"},{"key":"e_1_3_2_1_39_1","unstructured":"S. Ravi. 2016. Graph-powered machine learning at google. https:\/\/ai.googleblog. com\/2016\/10\/graph-powered-machine-learning-at-google.html. (2016). S. Ravi. 2016. Graph-powered machine learning at google. https:\/\/ai.googleblog. com\/2016\/10\/graph-powered-machine-learning-at-google.html. (2016)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"R. Al-Rfou D. Zelle and B. Perozzi. 2019. Ddgk: learning graph representations for deep divergence graph kernels. WWW 37--48. R. Al-Rfou D. Zelle and B. Perozzi. 2019. Ddgk: learning graph representations for deep divergence graph kernels. WWW 37--48.","DOI":"10.1145\/3308558.3313668"},{"key":"e_1_3_2_1_41_1","unstructured":"R. Sato M. Yamada and H. Kashima. 2019. Constant time graph neural networks. arXiv preprint arXiv:1901.07868. R. Sato M. Yamada and H. Kashima. 2019. Constant time graph neural networks. arXiv preprint arXiv:1901.07868."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742839"},{"key":"e_1_3_2_1_44_1","unstructured":"P. Velickovic G. Cucurull A. Casanova A. Romero P. Lio and Y. Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 1 2. P. Velickovic G. Cucurull A. Casanova A. Romero P. Lio and Y. Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 1 2."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021936"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"S. Wang R. Yang X. Xiao Z. Wei and Y. Yang. 2017. Fora: simple and effective approximate single-source personalized pagerank. KDD. S. Wang R. Yang X. Xiao Z. Wei and Y. Yang. 2017. Fora: simple and effective approximate single-source personalized pagerank. KDD.","DOI":"10.1145\/3097983.3098072"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"X. Wang A. Shakery and T. Tao. 2005. Dirichlet pagerank. SIGIR. X. Wang A. Shakery and T. Tao. 2005. Dirichlet pagerank. SIGIR.","DOI":"10.1145\/1076034.1076178"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Z. Wei X. He X. Xiao S. Wang S. Shang and J.-R. Wen. 2018. Topppr: topk personalized pagerank queries with precision guarantees on large graphs. SIGMOD. Z. Wei X. He X. Xiao S. Wang S. Shang and J.-R. Wen. 2018. Topppr: topk personalized pagerank queries with precision guarantees on large graphs. SIGMOD.","DOI":"10.1145\/3183713.3196920"},{"key":"e_1_3_2_1_49_1","volume-title":"C. Fifty, T. Yu, and K. Q. Weinberger.","author":"Wu F.","year":"2019","unstructured":"F. Wu , T. Zhang , A. H. d. Souza Jr , C. Fifty, T. Yu, and K. Q. Weinberger. 2019 . Simplifying graph convolutional networks. arXiv preprint arXiv:1902.07153. F. Wu, T. Zhang, A. H. d. Souza Jr, C. Fifty, T. Yu, and K. Q. Weinberger. 2019. Simplifying graph convolutional networks. arXiv preprint arXiv:1902.07153."},{"key":"e_1_3_2_1_50_1","unstructured":"Z. Wu S. Pan F. Chen G. Long C. Zhang and P. S. Yu. 2019. A comprehensive survey on graph neural networks. arXiv preprint arXiv:1901.00596. Z. Wu S. Pan F. Chen G. Long C. Zhang and P. S. Yu. 2019. A comprehensive survey on graph neural networks. arXiv preprint arXiv:1901.00596."},{"key":"e_1_3_2_1_51_1","unstructured":"K. Xu W. Hu J. Leskovec and S. Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826. K. Xu W. Hu J. Leskovec and S. Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826."},{"key":"e_1_3_2_1_52_1","unstructured":"K. Xu C. Li Y. Tian T. Sonobe K.-i. Kawarabayashi and S. Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. arXiv preprint arXiv:1806.03536. K. Xu C. Li Y. Tian T. Sonobe K.-i. Kawarabayashi and S. Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. arXiv preprint arXiv:1806.03536."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"R. Ying R. He K. Chen P. Eksombatchai W. L. Hamilton and J. Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. arXiv preprint arXiv:1806.01973. R. Ying R. He K. Chen P. Eksombatchai W. L. Hamilton and J. Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. arXiv preprint arXiv:1806.01973.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_1_55_1","unstructured":"M. Zhang and Y. Chen. 2018. Link prediction based on graph neural networks. arXiv preprint arXiv:1802.09691. M. Zhang and Y. Chen. 2018. Link prediction based on graph neural networks. arXiv preprint arXiv:1802.09691."}],"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.3403296","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403296","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.3403296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":55,"alternative-id":["10.1145\/3394486.3403296","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403296","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"}}]}}