{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T18:44:52Z","timestamp":1767725092831,"version":"3.48.0"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Applied Basic Research Project of Liaoning Province","award":["2023JH2\/101300185"],"award-info":[{"award-number":["2023JH2\/101300185"]}]},{"name":"Key Technologies Research and Development Program of Liaoning Province in China","award":["2021JH1\/10400079"],"award-info":[{"award-number":["2021JH1\/10400079"]}]},{"name":"Natural Science Foundation of Liaoning Provincial Department of Science and Technology","award":["No.2022-KF-11-04"],"award-info":[{"award-number":["No.2022-KF-11-04"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tcss.2024.3487993","type":"journal-article","created":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T13:58:51Z","timestamp":1731938331000},"page":"2358-2370","source":"Crossref","is-referenced-by-count":0,"title":["AutoDAW: Automated Data Augmentation for Graphs With Weak Information"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1862-1521","authenticated-orcid":false,"given":"Mingshuo","family":"Nie","sequence":"first","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7863-1230","authenticated-orcid":false,"given":"Dongming","family":"Chen","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2572-7658","authenticated-orcid":false,"given":"Dongqi","family":"Wang","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6730-7471","authenticated-orcid":false,"given":"Huilin","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Engineering, Computing and Cybernetics, Australian National University, Canberra, ACT, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"13366","article-title":"Diffusion improves graph learning","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Gasteiger","year":"2019"},{"key":"ref2","article-title":"Sign: Scalable inception graph neural networks","volume-title":"Proc. ICML Workshop Graph Representation Learn. Beyond, Virtual Event","author":"Frasca","year":"2020"},{"key":"ref3","first-page":"12154","article-title":"Dp-mix: Mixup-based data augmentation for differentially private learning","volume-title":"Proc. 37th Int. Conf. Neural Inf. Process. Syst.","volume":"36","author":"Bao","year":"2023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2023.3344597"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3371592"},{"key":"ref6","first-page":"20310","article-title":"How universal polynomial bases enhance spectral graph neural networks: Heterophily, over-smoothing, and over-squashing","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","volume":"235","author":"Huang","year":"2024"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3487553.3524718"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599410"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3393109"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2024.3403503"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3349850"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25622"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109301"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3575637.3575646"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2024.3373633"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26168"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3222545"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"ref20","first-page":"11815","article-title":"Knowledge distillation improves graph structure augmentation for graph neural networks","volume-title":"Proc. 36th Int. Conf. Neural Inf. Process. Syst.","volume":"35","author":"Wu","year":"2022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109262"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103348"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/s43586-024-00294-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109874"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3389966"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918"},{"key":"ref27","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent.","author":"Kipf","year":"2017"},{"key":"ref28","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3190922"},{"key":"ref30","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3237741"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3373608"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403088"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449822"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3178153"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i10.21360"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557640"},{"key":"ref38","first-page":"1","article-title":"AutoGDA: Automated graph data augmentation for node classification","volume-title":"Proc. 1st Learn. Graphs Conf.","volume":"198","author":"Zhao","year":"2022"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531830"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.03.021"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2022.3167380"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00059"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3091022"},{"key":"ref47","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"Proc. 6th Int. Conf. Learn. Represent.","author":"Gasteiger","year":"2018"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"},{"article-title":"Wiki-CS: A wikipedia-based benchmark for graph neural networks","year":"2020","author":"Mernyei","key":"ref49"},{"key":"ref50","article-title":"Pitfalls of graph neural network evaluation","volume-title":"NeurIPS Workshop Relational Representation Learn.","author":"Shchur","year":"2018"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref53","article-title":"How to find your friendly neighborhood: Graph attention design with self-supervision","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Kim","year":"2021"},{"key":"ref54","article-title":"Just jump: Dynamic neighborhood aggregation in graph neural networks","volume-title":"Proc. 7th Int. Conf. Learn. Represent.","author":"Fey","year":"2019"},{"article-title":"Attention-based graph neural network for semi-supervised learning","year":"2018","author":"Thekumparampil","key":"ref55"},{"key":"ref56","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. 36th Int. Conf. Mach Learn.","author":"Wu","year":"2019"},{"article-title":"Topology adaptive graph convolutional networks","year":"2017","author":"Du","key":"ref57"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20605"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378063"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599374"},{"key":"ref62","first-page":"4839","article-title":"Fisher information embedding for node and graph learning","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","volume":"202","author":"Chen","year":"2023"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/229"},{"key":"ref64","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Gilmer","year":"2017"},{"issue":"1","key":"ref65","first-page":"115","article-title":"Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","volume":"28","author":"Bergstra","year":"2013"},{"issue":"11","key":"ref66","first-page":"2579","article-title":"Visualizing data using t-sne","volume":"9","author":"Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570650\/11194048\/10755963.pdf?arnumber=10755963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T18:37:01Z","timestamp":1767724621000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10755963\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":66,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2024.3487993","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"type":"electronic","value":"2329-924X"},{"type":"electronic","value":"2373-7476"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}