{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T05:10:02Z","timestamp":1744261802093,"version":"3.40.4"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100008858","name":"Research Start-Up Funding for High-Level Talent of Jiangsu University of Science and Technology","doi-asserted-by":"publisher","award":["1132932301","1022932208"],"award-info":[{"award-number":["1132932301","1022932208"]}],"id":[{"id":"10.13039\/501100008858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3555997","type":"journal-article","created":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T21:58:37Z","timestamp":1743544717000},"page":"58699-58709","source":"Crossref","is-referenced-by-count":0,"title":["Augmented Graph Convolutional Network for Enhancing Label Reachability"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4927-3330","authenticated-orcid":false,"given":"Xiangyi","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5850-1922","authenticated-orcid":false,"given":"Fengjun","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Teng","sequence":"additional","affiliation":[{"name":"School of Computer, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoda","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent.","author":"Kipf"},{"key":"ref2","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Represent.","author":"Velickovic"},{"key":"ref3","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.09.021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.01.076"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.03.022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.11.015"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.10.060"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6783"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25907"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.04.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-023-02013-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6048"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121805"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.111283"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123520"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2023.102175"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.09.035"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref20","first-page":"205","article-title":"Graph neural networks for predicting gene interactions in bioinformatics","volume":"38","author":"Chang","year":"2020","journal-title":"Bioinf. Adv."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-024-00888-6"},{"key":"ref22","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107616"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109850"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122385"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref27","first-page":"841","article-title":"N-GCN: Multi-scale graph convolution for semi-supervised node classification","volume-title":"Proc. 35th Conf. Uncertainty Artif. Intell.","author":"Abu-El-Haija"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103708"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.05.057"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26168"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i13.29328"},{"key":"ref32","first-page":"7865","article-title":"On over-squashing in message passing neural networks: The impact of width, depth, and topology","volume-title":"Proc. 40th Int. Conf. Learn. Represent.","author":"Giovanni"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330851"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i15.29668"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3105984"},{"key":"ref36","first-page":"85","article-title":"Adversarial attack and defense strategies for graph neural networks: A survey","volume":"458","author":"Tang","year":"2021","journal-title":"Neurocomputing"},{"key":"ref37","first-page":"243","article-title":"Graph generator-enhanced graph neural networks for semi-supervised node classification","volume":"150","author":"Liu","year":"2022","journal-title":"Neural Netw."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109301"},{"issue":"12","key":"ref39","first-page":"895","article-title":"Geometric deep learning: Grids, groups, graphs, geodesics, and gauges","volume":"3","author":"Bronstein","year":"2021","journal-title":"Nature Rev. Phys."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/jfm.2020.769"},{"issue":"4","key":"ref41","first-page":"1","article-title":"Graph convolutional recommendation with user-specific hubs","volume":"12","author":"Wu","year":"2021","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5929"},{"key":"ref43","first-page":"24934","article-title":"Debiasing graph neural networks via learning disentangled causal substructure","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Fan"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3446229"},{"issue":"6","key":"ref45","first-page":"4963","article-title":"Beyond homophily in graph neural networks: A survey and perspective","volume":"35","author":"Bo","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref46","first-page":"1457","article-title":"Graph convolutional neural networks on billion-scale graphs","volume-title":"Proc. 14th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining","author":"Ying"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.02.054"},{"key":"ref48","first-page":"13366","article-title":"Diffusion improves graph learning","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","volume":"32","author":"Gasteiger"},{"key":"ref49","first-page":"10247","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Pei"},{"key":"ref50","first-page":"11983","article-title":"Graph transformer networks","volume-title":"Proc. 34th Adv. Neural Inf. Process. Syst.","volume":"33","author":"Ying"},{"issue":"5","key":"ref51","first-page":"1021","article-title":"Node propagation modeling for improving long-range dependencies in GNNs","volume":"34","author":"Sinha","year":"2023","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref52","first-page":"50","article-title":"Bridging heterogeneous nodes in graph learning through auxiliary connections","volume":"634","author":"Zhou","year":"2023","journal-title":"Inf. Sci."},{"key":"ref53","article-title":"Learning robust graph representations with auxiliary node generation","volume":"241","author":"Wang","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"ref54","first-page":"1205","article-title":"A survey on graph data augmentation techniques for deep learning","volume":"34","author":"Li","year":"2023","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525087"},{"key":"ref56","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref61","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref62","first-page":"315","article-title":"Deep sparse rectifier neural networks","volume-title":"Proc. 14th Int. Conf. Artif. Intell. Statist.","author":"Glorot"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.5555\/3104322.3104425"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.111020"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121708"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25618"},{"key":"ref67","first-page":"428","article-title":"A comparison of document clustering techniques","volume-title":"Proc. Workshop Text Mining","author":"Steinbach"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref69","first-page":"1","article-title":"A comparative analysis of feature learning in graph-based models for network data","volume-title":"Proc. 2016 Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref70","first-page":"2579","article-title":"Visualizing data using t-SNE","volume-title":"Proc. J. Mach. Learn. Res.","volume":"9","author":"Maaten"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-024-3853-2"},{"key":"ref72","first-page":"1","article-title":"A unified approach to interpreting model predictions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Lundberg"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-3020"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10946672.pdf?arnumber=10946672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:42:58Z","timestamp":1744260178000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10946672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3555997","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}