{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T05:18:22Z","timestamp":1738300702341,"version":"3.35.0"},"reference-count":49,"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":[{"name":"National Key R&D Program","award":["2022L3029"],"award-info":[{"award-number":["2022L3029"]}]},{"name":"Research on Key Technologies for Intelligent and Cloud Service Testing (2022 Central Government-Guided Local Development Science and Technology Special Project)."}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3532806","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T18:57:45Z","timestamp":1737572265000},"page":"16787-16799","source":"Crossref","is-referenced-by-count":0,"title":["Graph Convolution for Large-Scale Graph Node Classification Task Based on Spatial and Frequency Domain Fusion"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7098-2789","authenticated-orcid":false,"given":"Junwen","family":"Lu","sequence":"first","affiliation":[{"name":"School of Computer and Information and Engineering, Xiamen University of Technology, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0181-0774","authenticated-orcid":false,"given":"Lingrui","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer and Information and Engineering, Xiamen University of Technology, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianmei","family":"Hua","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Xiamen Institute of Technology, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yankun","family":"Wang","sequence":"additional","affiliation":[{"name":"Eastern Michigan Joint College of Engineering, Beibu Gulf University, Beihai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Representation learning on graphs: Methods and applications","author":"Hamilton","year":"2017","journal-title":"arXiv:1709.05584"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/3336191.3371853"},{"key":"ref3","article-title":"Graph inference learning for semi-supervised classification","author":"Xu","year":"2020","journal-title":"arXiv:2001.06137"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.18653\/v1\/D19-1464"},{"key":"ref5","article-title":"Modeling sentiment dependencies with graph convolutional networks for aspect-level sentiment classification","author":"Zhaoa","year":"2019","journal-title":"arXiv:1906.04501"},{"key":"ref6","first-page":"107290","article-title":"Learning dynamic hierarchical topic graph with graph convolutional network for document classification","volume":"8","author":"Wang","year":"2020","journal-title":"IEEE Access"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.18653\/v1\/2020.acl-main.31"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/j.ins.2023.119971"},{"key":"ref9","first-page":"15","article-title":"Synthetic structure of industrial plastics","volume-title":"Plastics","volume":"3","author":"Young","year":"1964"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/3404835.3462834"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/3292500.3330925"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1016\/j.ins.2023.119481"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/j.neunet.2023.09.035"},{"key":"ref14","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref15","article-title":"A representation learning framework for property graphs","author":"Hou","year":"2022","journal-title":"arXiv:2206.13176"},{"key":"ref16","article-title":"PathSAGE: Spatial graph attention neural networks with random path sampling","author":"Ma","year":"2022","journal-title":"arXiv:2203.05793"},{"key":"ref17","article-title":"GraphSAINT: Graph sampling based inductive learning method","author":"Zeng","year":"2019","journal-title":"arXiv:1907.04931"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/s10586-015-0472-6"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/jas.2021.1004311"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/3326362"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.inffus.2021.07.013"},{"key":"ref22","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017","journal-title":"arXiv:1609.02907"},{"key":"ref23","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"key":"ref24","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","author":"Chen","year":"2018","journal-title":"arXiv:1801.10247"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/saner56733.2023.00035"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/s10462-023-10577-2"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1016\/j.patcog.2023.109867"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TPAMI.2021.3111054"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/3240508.3240621"},{"key":"ref30","article-title":"Understanding graph convolutional networks for text classification","author":"Caren Han","year":"2022","journal-title":"arXiv:2203.16060"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"ref32","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","author":"Rong","year":"2019","journal-title":"arXiv:1907.10903"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/978-3-030-01261-8_20"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref35","first-page":"1","article-title":"A survey on graph structure learning: Progress and opportunities","volume":"1","author":"Zhu","year":"2022","journal-title":"IEEE Access"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1186\/s40649-019-0069-y"},{"key":"ref37","article-title":"Unsupervised data augmentation for consistency training","author":"Xie","year":"2019","journal-title":"arXiv:1904.12848"},{"key":"ref38","first-page":"4474","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"6","author":"Srivastava","year":"2018","journal-title":"IEEE Access"},{"key":"ref39","article-title":"SCR: Training graph neural networks with consistency regularization","author":"Zhang","year":"2021","journal-title":"arXiv:2112.04319"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/TIP.2021.3101820"},{"key":"ref41","first-page":"1","article-title":"Training graph neural networks with 1000 layers","volume":"22","author":"Li","year":"2021","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/CVPR52688.2022.00016"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1145\/3394486.3403076"},{"key":"ref44","article-title":"GTNet: A tree-based deep graph learning architecture","author":"Wu","year":"2022","journal-title":"arXiv:2204.12802"},{"key":"ref45","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref46","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Conf. Neural Inf. Process. Syst. (NeurIPS)","volume":"33","author":"Hu"},{"key":"ref47","article-title":"Distilling self-knowledge from contrastive links to classify graph nodes without passing messages","author":"Luo","year":"2021","journal-title":"arXiv:2106.08541"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1145\/2939672.2939754"},{"key":"ref49","article-title":"GraphZoom: A multi-level spectral approach for accurate and scalable graph embedding","author":"Deng","year":"2019","journal-title":"arXiv:1910.02370"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10849571.pdf?arnumber=10849571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T19:22:00Z","timestamp":1738264920000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10849571\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3532806","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}