{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:14:36Z","timestamp":1783700076298,"version":"3.55.0"},"reference-count":282,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","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":[{"name":"National Key Research and Development Program of China","award":["2023YFC3303800"],"award-info":[{"award-number":["2023YFC3303800"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tbdata.2024.3489412","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T18:45:00Z","timestamp":1730918700000},"page":"1-20","source":"Crossref","is-referenced-by-count":8,"title":["Data-Centric Graph Learning: A Survey"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1913-014X","authenticated-orcid":false,"given":"Yuxin","family":"Guo","sequence":"first","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deyu","family":"Bo","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7821-0030","authenticated-orcid":false,"given":"Cheng","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7979-340X","authenticated-orcid":false,"given":"Zhiyuan","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2164-9009","authenticated-orcid":false,"given":"Zhongjian","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jixi","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yufei","family":"Peng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3734-0266","authenticated-orcid":false,"given":"Chuan","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref2","first-page":"488","article-title":"Efficient graphlet Kernels for large graph comparison","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shervashidze"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref5","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref6","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3065386"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3711118"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-024-00857-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01157"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/563"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref16","article-title":"GNNGUARD: Defending graph neural networks against adversarial attacks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref17","article-title":"Training robust graph neural networks with topology adaptive edge dropping","author":"Gao","year":"2021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"ref19","first-page":"11458","article-title":"Robust graph representation learning via neural sparsification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zheng"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3133818"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482313"},{"key":"ref22","first-page":"1","article-title":"Graph information bottleneck for subgraph recognition","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Yu"},{"key":"ref23","first-page":"1448","article-title":"Invariant rationalization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chang"},{"key":"ref24","first-page":"15524","article-title":"Interpretable and generalizable graph learning via stochastic attention mechanism","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Miao"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539347"},{"key":"ref26","first-page":"1","article-title":"Discovering invariant rationales for graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wu"},{"key":"ref27","article-title":"Learning causally invariant representations for out-of-distribution generalization on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref28","article-title":"Learning invariant graph representations for out-of-distribution generalization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref29","article-title":"Revisiting graph contrastive learning from the perspective of graph spectrum","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref30","first-page":"1","article-title":"Spectral augmentation for self-supervised learning on graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lin"},{"key":"ref31","first-page":"11213","article-title":"Spectral augmentations for graph contrastive learning","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Ghose"},{"key":"ref32","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00056"},{"key":"ref35","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","author":"Chen","year":"2018"},{"key":"ref36","first-page":"11247","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":"ref37","article-title":"GraphSAINT: Graph sampling based inductive learning method","author":"Zeng","year":"2019"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"ref40","first-page":"14887","article-title":"Graph adversarial self-supervised learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref41","article-title":"Deep graph infomax","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2957786"},{"key":"ref43","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"You"},{"key":"ref44","article-title":"Large-scale representation learning on graphs via bootstrapping","author":"Thakoor","year":"2021"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403063"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512180"},{"key":"ref47","first-page":"6438","article-title":"Manifold mixup: Better representations by interpolating hidden states","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Verma"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2849727"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3575637.3575646"},{"key":"ref52","article-title":"A survey and taxonomy of graph sampling","author":"Hu","year":"2013"},{"key":"ref53","article-title":"A survey on graph structure learning: Progress and opportunities","author":"Zhu","year":"2021"},{"key":"ref54","article-title":"Towards data-centric graph machine learning: Review and outlook","author":"Zheng","year":"2023"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.2307\/2369436"},{"key":"ref56","first-page":"128","article-title":"Solutio problematis ad geometriam situs pertinentis","volume":"1","author":"Euler","year":"1741","journal-title":"Commentarii academiae scientiarum Petropolitanae"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1201\/9780203490204"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3177455"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"ref60","article-title":"Temporal graph networks for deep learning on dynamic graphs","author":"Rossi","year":"2020"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref62","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":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/070705970"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993647"},{"key":"ref66","article-title":"Fast graph attention networks using effective resistance based graph sparsification","author":"Srinivasa","year":"2020"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100253"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00052"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.113"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.111"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3072345"},{"key":"ref73","first-page":"1","article-title":"Pruned graph scattering transforms","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ioannidis"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-021-00288-8"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47426-3_22"},{"key":"ref76","first-page":"1250","article-title":"Graph sparsification approaches for Laplacian smoothing","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Sadhanala"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/s40324-021-00282-x"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511543258"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1137\/060678397"},{"key":"ref80","first-page":"113","article-title":"Multilevel graph partitioning schemes","volume-title":"Proc. Int. Conf. Parallel Process.","author":"Karypis"},{"key":"ref81","first-page":"3237","article-title":"Spectrally approximating large graphs with smaller graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Loukas"},{"key":"ref82","first-page":"4452","article-title":"Graph coarsening with preserved spectral properties","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Jin"},{"key":"ref83","article-title":"Graph coarsening with neural networks","author":"Cai","year":"2021"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467256"},{"key":"ref85","article-title":"Graph condensation for graph neural networks","author":"Jin","year":"2021"},{"key":"ref86","article-title":"Dataset condensation with gradient matching","author":"Zhao","year":"2020"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539429"},{"key":"ref88","article-title":"Structure-free graph condensation: From large-scale graphs to condensed graph-free data","author":"Zheng","year":"2023"},{"key":"ref89","article-title":"Graph condensation via receptive field distribution matching","author":"Liu","year":"2022"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599398"},{"key":"ref91","article-title":"Does graph distillation see like vision dataset counterpart?","author":"Yang","year":"2023"},{"key":"ref92","article-title":"Graph condensation via eigenbasis matching","author":"Liu","year":"2023"},{"key":"ref93","article-title":"Learning deep generative models of graphs","author":"Li","year":"2018"},{"key":"ref94","first-page":"5694","article-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref95","article-title":"MolecularRNN: Generating realistic molecular graphs with optimized properties","author":"Popova","year":"2019"},{"key":"ref96","first-page":"7192","article-title":"GraphDF: A discrete flow model for molecular graph generation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Luo"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380201"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1093\/oed\/7567627728"},{"key":"ref99","first-page":"4585","article-title":"Efficient and degree-guided graph generation via discrete diffusion modeling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref100","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref101","article-title":"Graph normalizing flows","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref102","first-page":"15159","article-title":"SPECTRE: Spectral conditioning helps to overcome the expressivity limits of one-shot graph generators","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Martinkus"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2023.3344758"},{"key":"ref104","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"ref105","article-title":"Graph random neural networks for semi-supervised learning on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403237"},{"key":"ref107","article-title":"MGAE: Masked autoencoders for self-supervised learning on graphs","author":"Tan","year":"2022"},{"key":"ref108","first-page":"1","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rong"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467186"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512175"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412086"},{"key":"ref112","first-page":"13333","article-title":"Diffusion improves graph learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Klicpera"},{"key":"ref113","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482477"},{"key":"ref115","first-page":"12121","article-title":"Graph contrastive learning automated","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref117","article-title":"Learning graph augmentations to learn graph representations","author":"Hassani","year":"2022"},{"key":"ref118","article-title":"AutoGDA: Automated graph data augmentation for node classification","volume-title":"Proc. Learn. Graphs Conf.","author":"Zhao"},{"key":"ref119","first-page":"1","article-title":"Automated data augmentations for graph classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Luo"},{"key":"ref120","article-title":"Stochastic training of graph convolutional networks with variance reduction","author":"Chen","year":"2017"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467284"},{"key":"ref122","first-page":"6878","article-title":"Bandit samplers for training graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref123","first-page":"8833","article-title":"A biased graph neural network sampler with near-optimal regret","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref124","first-page":"21171","article-title":"Hierarchical graph transformer with adaptive node sampling","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref125","first-page":"4563","article-title":"Adaptive sampling towards fast graph representation learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403192"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570385"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403118"},{"key":"ref129","article-title":"TuneUp: A training strategy for improving generalization of graph neural networks","author":"Hu","year":"2022"},{"key":"ref130","first-page":"19580","article-title":"Directed graph contrastive learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Tong"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.26071"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1145\/3474085.3475439"},{"key":"ref133","article-title":"Graph neural network with curriculum learning for imbalanced node classification","author":"Li","year":"2022"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450025"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/317"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1145\/3322122"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2022.03.018"},{"key":"ref139","doi-asserted-by":"crossref","DOI":"10.1145\/3528667","article-title":"Curriculum pre-training heterogeneous subgraph transformer for top-N recommendation","volume":"41","author":"Wang","year":"2023","journal-title":"ACM Trans. Inf. Syst."},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/564"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3157688"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102433"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i13.26954"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1145\/3564701"},{"key":"ref145","first-page":"2133","article-title":"Self-paced consensus clustering with bipartite graph","volume-title":"Proc. ACM Int. Conf. Inf. Knowl. Manage.","author":"Zhou"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358163"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220041"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539422"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219968"},{"key":"ref150","first-page":"3276","article-title":"A flexible generative framework for graph-based semi-supervised learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ma"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015829"},{"key":"ref152","first-page":"18648","article-title":"Variational inference for graph convolutional networks in the absence of graph data and adversarial settings","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Elinas"},{"key":"ref153","first-page":"1318","article-title":"Non parametric graph learning for Bayesian graph neural networks","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Pal"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20335"},{"key":"ref155","first-page":"1972","article-title":"Learning discrete structures for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Franceschi"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.3390\/e24091228"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2022.3170249"},{"key":"ref158","article-title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16600"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/171"},{"key":"ref161","article-title":"Reinforcement learning based graph-to-sequence model for natural question generation","author":"Chen","year":"2019"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5978"},{"key":"ref163","first-page":"8964","article-title":"GLoMo: Unsupervised learning of transferable relational graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6737"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11691"},{"key":"ref166","article-title":"Deep convolutional networks on graph-structured data","author":"Henaff","year":"2015"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33016762"},{"key":"ref168","article-title":"Retrieval-augmented generation for code summarization via hybrid GNN","author":"Liu","year":"2020"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01157"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/563"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1109\/ICME46284.2020.9102726"},{"key":"ref172","article-title":"Efficient estimation of word representations in vector space","author":"Mikolov","year":"2013"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"ref174","article-title":"A generalization of transformer networks to graphs","author":"Dwivedi","year":"2020"},{"key":"ref175","article-title":"Sign and basis invariant networks for spectral graph representation learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lim"},{"key":"ref176","first-page":"21618","article-title":"Rethinking graph transformers with spectral attention","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Kreuzer"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/291"},{"key":"ref178","first-page":"1","article-title":"Graph neural networks with learnable structural and positional representations","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Dwivedi"},{"key":"ref179","first-page":"7134","article-title":"Position-aware graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref180","article-title":"Distance encoding: Design provably more powerful neural networks for graph representation learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref181","first-page":"28877","article-title":"Do transformers really perform badly for graph representation?","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref182","first-page":"1","article-title":"Equivariant and stable positional encoding for more powerful graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1145\/2408736.2408739"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014586"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109265"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5839"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.1145\/3374135.3385309"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330856"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557543"},{"key":"ref190","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.05.077"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.11.016"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3032189"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3166539"},{"key":"ref194","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.06.005"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449914"},{"key":"ref196","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109171"},{"key":"ref197","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3149997"},{"key":"ref198","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00215"},{"key":"ref199","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.03.034"},{"key":"ref200","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599244"},{"key":"ref201","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599256"},{"key":"ref202","article-title":"PRODIGY: Enabling in-context learning over graphs","author":"Huang","year":"2023"},{"key":"ref203","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583386"},{"key":"ref204","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539249"},{"key":"ref205","first-page":"8230","article-title":"G-mixup: Graph data augmentation for graph classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Han"},{"key":"ref206","first-page":"692","article-title":"Stochastic blockmodel approximation of a graphon: Theory and consistent estimation","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Airoldi"},{"key":"ref207","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10095561"},{"key":"ref208","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20767"},{"key":"ref209","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449796"},{"key":"ref210","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25944"},{"key":"ref211","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539315"},{"key":"ref212","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00710"},{"key":"ref213","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM58522.2023.00172"},{"key":"ref214","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450068"},{"key":"ref215","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN55064.2022.9892159"},{"key":"ref216","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/320"},{"key":"ref217","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570480"},{"key":"ref218","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20354"},{"key":"ref219","first-page":"11815","article-title":"Knowledge distillation improves graph structure augmentation for graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref220","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977653.ch18"},{"key":"ref221","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW58026.2022.00091"},{"key":"ref222","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref223","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.10.016"},{"key":"ref224","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6048"},{"key":"ref225","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00879-4"},{"key":"ref226","article-title":"Active learning for graph embedding","author":"Cai","year":"2017"},{"key":"ref227","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/296"},{"key":"ref228","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/294"},{"key":"ref229","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557701"},{"key":"ref230","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457325"},{"key":"ref231","article-title":"Graph policy network for transferable active learning on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref232","article-title":"Transfer active learning for graph neural networks","author":"Hu","year":"2019"},{"key":"ref233","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512229"},{"key":"ref234","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20897"},{"key":"ref235","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476295"},{"key":"ref236","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615199"},{"key":"ref237","article-title":"Information gain propagation: A new way to graph active learning with soft labels","author":"Zhang","year":"2022"},{"key":"ref238","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539286"},{"key":"ref239","article-title":"Active learning for graph neural networks via node feature propagation","author":"Wu","year":"2019"},{"key":"ref240","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26387-3_4"},{"key":"ref241","article-title":"ScatterSample: Diversified label sampling for data efficient graph neural network learning","author":"Dai","year":"2022"},{"key":"ref242","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3009682"},{"key":"ref243","first-page":"74","article-title":"Active learning on graphs via meta learning","volume-title":"Proc. Int. Conf. Mach. Learn. Workshop","author":"Madhawa"},{"key":"ref244","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3214832"},{"key":"ref245","article-title":"A survey on deep graph generation: Methods and applications","volume-title":"Proc. Learn. Graphs Conf.","author":"Zhu"},{"key":"ref246","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref247","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-019-0069-y"},{"key":"ref248","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3069908"},{"key":"ref249","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/748"},{"key":"ref250","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004311"},{"key":"ref251","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/772"},{"key":"ref252","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref253","article-title":"Knowledge distillation on graphs: A survey","author":"Tian","year":"2023"},{"key":"ref254","article-title":"Graph-based knowledge distillation: A survey and experimental evaluation","author":"Liu","year":"2023"},{"key":"ref255","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3288002"},{"key":"ref256","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75762-5_42"},{"key":"ref257","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00133"},{"key":"ref258","first-page":"22118","article-title":"Better with less: Data-active pre-training of graph neural networks","author":"Xu","year":"2020","journal-title":"Proc. Int. Conf. Neural Inf. Process. Syst."},{"key":"ref259","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3542609"},{"key":"ref260","first-page":"1189","article-title":"Self-paced learning for latent variable models","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Kumar"},{"key":"ref261","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref262","article-title":"Empowering graph representation learning with test-time graph transformation","author":"Jin","year":"2022"},{"key":"ref263","article-title":"Universal prompt tuning for graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Fang"},{"key":"ref264","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.4637382","article-title":"SGL-PT: A strong graph learner with graph prompt tuning","author":"Zhu","year":"2023"},{"key":"ref265","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3201243"},{"key":"ref266","doi-asserted-by":"publisher","DOI":"10.1145\/3394520"},{"key":"ref267","first-page":"1310","article-title":"Certified adversarial robustness via randomized smoothing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cohen"},{"key":"ref268","first-page":"8317","article-title":"Certifiable robustness to graph perturbations","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Bojchevski"},{"key":"ref269","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441782"},{"key":"ref270","first-page":"2114","article-title":"Towards a unified framework for fair and stable graph representation learning","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Agarwal"},{"key":"ref271","article-title":"A survey of imbalanced learning on graphs: Problems, techniques, and future directions","author":"Liu","year":"2023"},{"key":"ref272","article-title":"Uncovering the structural fairness in graph contrastive learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref273","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220082"},{"key":"ref274","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403270"},{"key":"ref275","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3141260"},{"key":"ref276","article-title":"Mixing patterns in networks","volume":"67","author":"Newman","year":"2002","journal-title":"Phys. Rev. E., Statist. Nonlinear Soft Matter Phys."},{"key":"ref277","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref278","first-page":"1","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei"},{"key":"ref279","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403177"},{"key":"ref280","article-title":"Towards graph foundation models: A survey and beyond","author":"Liu","year":"2023"},{"key":"ref281","article-title":"Towards data-centric graph machine learning: Review and outlook","author":"Zheng","year":"2023"},{"key":"ref282","article-title":"A survey of large language models","author":"Zhao","year":"2023"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/10843063\/10746390.pdf?arnumber=10746390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T19:02:59Z","timestamp":1737399779000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10746390\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":282,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2024.3489412","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}