{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:40:11Z","timestamp":1754109611240,"version":"3.41.2"},"reference-count":68,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":["62076004"],"award-info":[{"award-number":["62076004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Anhui Provincial Key Research and Development Program","award":["2022i01020014"],"award-info":[{"award-number":["2022i01020014"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tsipn.2025.3588087","type":"journal-article","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T17:49:33Z","timestamp":1752169773000},"page":"859-871","source":"Crossref","is-referenced-by-count":0,"title":["RNGCNs: Robust Norm Graph Convolutional Networks in the Presence of Missing Data and Large Noises"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9429-1635","authenticated-orcid":false,"given":"Ziyan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6238-1596","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9689-8657","authenticated-orcid":false,"given":"Zhengzheng","family":"Tu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1414-3307","authenticated-orcid":false,"given":"Bin","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2022.3140477"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2023.3266949"},{"key":"ref5","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bruna","year":"2014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11691"},{"key":"ref8","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref9","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velikovi","year":"2019"},{"key":"ref10","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velikovi","year":"2018"},{"key":"ref11","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","year":"2019"},{"key":"ref12","article-title":"Adaptive structural fingerprints for graph attention networks","volume-title":"Int. Conf. Learn. Representations","author":"Zhang","year":"2020"},{"key":"ref13","first-page":"2641","article-title":"Learning conjoint attentions for graph neural nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"He","year":"2021"},{"key":"ref14","article-title":"Diffusion convolutional recurrent neural network: Data-driven traffic forecasting","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2018"},{"key":"ref15","first-page":"1993","article-title":"Diffusion-convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Atwood","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3120100"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3032189"},{"key":"ref18","first-page":"11:1","article-title":"On the unreasonable effectiveness of feature propagation in learning on graphs with missing node features","volume-title":"Proc. Learn. Graphs Conf.","volume":"198","author":"Rossi","year":"2022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/669"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371789"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.11.016"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330851"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441735"},{"key":"ref24","first-page":"9720","article-title":"Graph neural networks with adaptive residual","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Liu","year":"2021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3306545"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2024.3386499"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143880"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.309"},{"key":"ref29","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume-title":"Proc. Adv. neural Inf. Process. Syst.","author":"Wright","year":"2009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.322"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2023.3244112"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2020.3044913"},{"key":"ref34","first-page":"27387","article-title":"Nodeformer: A scalable graph structure learning transformer for node classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Wu","year":"2022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25593"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104129"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3363703"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25553"},{"key":"ref39","article-title":"How attentive are graph attention networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Brody","year":"2022"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2025.3525961"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI51031.2022.10022288"},{"key":"ref42","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer","year":"2017"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref44","first-page":"321","article-title":"Learning with local and global consistency","volume-title":"Proc. Adv. neural Inf. Process. Syst.","author":"Zhou","year":"2004"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2555239"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016892"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF00131148"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2044958"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/563"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.88"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2039566"},{"key":"ref55","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen","year":"2018"},{"key":"ref56","first-page":"941","article-title":"Stochastic training of graph convolutional networks with variance reduction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2018"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00981"},{"key":"ref58","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2020"},{"key":"ref59","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhu","year":"2020"},{"key":"ref60","first-page":"20887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume-title":"Proc. Adv. neural Inf. Process. Syst.","volume":"34","author":"Lim","year":"2021"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714673"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2019.2892416"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.06.005"},{"key":"ref64","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma","year":"2015"},{"key":"ref65","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Glorot","year":"2010"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.68"},{"key":"ref67","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv Neural Inf. Process. Syst.","volume":"33","author":"Hu","year":"2020"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6884276\/10789318\/11077452.pdf?arnumber=11077452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:19:27Z","timestamp":1754108367000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11077452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":68,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2025.3588087","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"type":"electronic","value":"2373-776X"},{"type":"electronic","value":"2373-7778"}],"subject":[],"published":{"date-parts":[[2025]]}}}