{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:32Z","timestamp":1740169292289,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18K11547"],"award-info":[{"award-number":["JP18K11547"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3246128","type":"journal-article","created":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T23:07:44Z","timestamp":1676588864000},"page":"16974-16983","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Model Selection for Graph Neural Networks"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3878-5830","authenticated-orcid":false,"given":"Yuga","family":"Oishi","sequence":"first","affiliation":[{"name":"Department of Computer and Network Engineering, Graduate School of Informatics and Engineering, The University of Electro-Communications, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8519-3865","authenticated-orcid":false,"given":"Ken","family":"Kaneiwa","sequence":"additional","affiliation":[{"name":"Department of Computer and Network Engineering, Graduate School of Informatics and Engineering, The University of Electro-Communications, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"volume-title":"Learning from labeled and unlabeled data with label propagation","year":"2002","author":"Zhu","key":"ref2"},{"key":"ref3","article-title":"Skip vectors for RDF data: Extraction based on the complexity of feature patterns","author":"Minami","year":"2022","journal-title":"arXiv:2201.01996"},{"key":"ref4","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent. (ICLR)","author":"Kipf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref6","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Represent. (ICLR)","author":"Velickovic"},{"key":"ref7","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. 7th Int. Conf. Learn. Represent. (ICLR)","author":"Xu"},{"key":"ref8","first-page":"5449","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. 35th Int. Conf. Mach. Learn. (ICML)","author":"Xu"},{"key":"ref9","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Zhu"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450068"},{"key":"ref11","first-page":"47","article-title":"Hierarchical model selection for graph neural networks","volume-title":"Proc. 127th Meeting Special Interest Group Knowl. Based Syst. (SIG-KBS)","author":"Oishi"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.21236\/ad0256582"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00031"},{"key":"ref14","article-title":"Unifying graph convolutional neural networks and label propagation","author":"Wang","year":"2020","journal-title":"arXiv:2002.06755"},{"key":"ref15","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref16","first-page":"1","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. 8th Int. Conf. Learn. Represent. (ICLR)","author":"Pei"},{"key":"ref17","first-page":"1","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Rong"},{"key":"ref18","first-page":"1","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Klicpera"},{"key":"ref19","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. 37th Int. Conf. Mach. Learn. (ICML)","author":"Chen"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref22","first-page":"1","article-title":"Query-driven active surveying for collective classification","volume-title":"Proc. 10th Int. Workshop Mining Learn. Graphs (MLG)","author":"Namata"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref24","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kingma"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10047858.pdf?arnumber=10047858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T20:57:59Z","timestamp":1709413079000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10047858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3246128","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}