{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T02:47:31Z","timestamp":1778899651521,"version":"3.51.4"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U2241212"],"award-info":[{"award-number":["U2241212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61932001"],"award-info":[{"award-number":["61932001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["4222028"],"award-info":[{"award-number":["4222028"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Outstanding Young Scientist Program","award":["BJJWZYJH012019100020098"],"award-info":[{"award-number":["BJJWZYJH012019100020098"]}]},{"name":"Huawei-Renmin University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tkde.2024.3513533","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T19:08:13Z","timestamp":1733771293000},"page":"896-909","source":"Crossref","is-referenced-by-count":4,"title":["Scalable and Effective Graph Neural Networks via Trainable Random Walk Sampling"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4856-3023","authenticated-orcid":false,"given":"Haipeng","family":"Ding","sequence":"first","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3620-5086","authenticated-orcid":false,"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhang","family":"Ye","sequence":"additional","affiliation":[{"name":"Possion Lab, Huawei, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450120"},{"key":"ref2","first-page":"304","article-title":"Contextual graph Markov model: A deep and generative approach to graph processing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bacciu"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-00126-0_18"},{"key":"ref4","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Duvenaud"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3151618"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3149815"},{"key":"ref7","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref8","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref9","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic"},{"key":"ref10","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref11","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei"},{"key":"ref12","first-page":"20 887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Lim"},{"key":"ref13","first-page":"3837","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref14","article-title":"Convolutional neural networks on graphs with Chebyshev approximation, revisited","author":"He","year":"2022"},{"key":"ref15","first-page":"14 239","article-title":"Bernnet: Learning arbitrary graph spectral filters via bernstein approximation","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"He"},{"key":"ref16","first-page":"23 341","article-title":"How powerful are spectral graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06006-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref20","article-title":"Graph neural networks for graphs with heterophily: A survey","author":"Zheng","year":"2022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-024-3853-2"},{"issue":"2","key":"ref22","article-title":"A comprehensive survey on graph neural network accelerators","volume":"19","author":"Jingyu Liu","year":"2025","journal-title":"Front. Comput. Sci."},{"key":"ref23","first-page":"551","article-title":"P3: Distributed deep graph learning at scale","volume-title":"Proc. USENIX Symp. Operating Syst. Des. Implementation","author":"Gandhi"},{"key":"ref24","article-title":"Learn locally, correct globally: A distributed algorithm for training graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ramezani"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IA351965.2020.00011"},{"key":"ref26","article-title":"PipeGCN: Efficient full-graph training of graph convolutional networks with pipelined feature communication","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wan"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3178153"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00013"},{"key":"ref29","first-page":"673","article-title":"BNS-GCN: Efficient full-graph training of graph convolutional networks with partition-parallelism and random boundary node sampling","volume-title":"Proc. Mach. Learn. Syst.","author":"Wan"},{"key":"ref30","first-page":"10197","article-title":"LD2: Scalable heterophilous graph neural network with decoupled embeddings","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liao"},{"key":"ref31","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref32","first-page":"11 247","article-title":"Layer-dependent importance sampling for training deep and large graph convolutional networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zou"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref34","article-title":"Graphsaint: Graph sampling based inductive learning method","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zeng"},{"key":"ref35","first-page":"38 926","article-title":"LazyGNN: Large-scale graph neural networks via lazy propagation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xue"},{"key":"ref36","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref38","first-page":"941","article-title":"Stochastic training of graph convolutional networks with variance reduction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref39","first-page":"3294","article-title":"Gnnautoscale: Scalable and expressive graph neural networks via historical embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Fey"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/3538598.3538614"},{"key":"ref41","article-title":"LMC: Fast training of GNNs via subgraph sampling with provable convergence","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Shi"},{"key":"ref42","first-page":"5449","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref43","first-page":"21","article-title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija"},{"key":"ref44","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref45","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Klicpera"},{"key":"ref46","article-title":"Adaptive universal generalized pagerank graph neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chien"},{"key":"ref47","first-page":"12 077","article-title":"Graph neural networks with learnable and optimal polynomial bases","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref48","article-title":"Analyzing the expressive power of graph neural networks in a spectral perspective","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Balcilar"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref50","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"ref52","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"ref54","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref55","article-title":"Fast graph representation learning with Pytorch geometric","author":"Fey","year":"2019"},{"key":"ref56","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Paszke"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3288135"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557680"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10837577\/10786281.pdf?arnumber=10786281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:43:29Z","timestamp":1736588609000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10786281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":59,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3513533","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}