{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:48Z","timestamp":1740169308436,"version":"3.37.3"},"reference-count":41,"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 (JSPS) Grant-in-Aid for Scientific Research","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.3264596","type":"journal-article","created":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T17:52:59Z","timestamp":1680717179000},"page":"34421-34430","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Duplicated Characterization of Graph Structures Using Information Gain Ratio 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","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Bordes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref3","first-page":"1","article-title":"Composition-based multi-relational graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR), 2020","author":"Vashishth"},{"key":"ref4","first-page":"1","article-title":"A fair comparison of graph neural networks for graph classification","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR), 2020","author":"Errica"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.10.007"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3160477"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"article-title":"Learning from labeled and unlabeled data with label propagation","year":"2002","author":"Zhu","key":"ref8"},{"key":"ref9","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":"ref10","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent. (ICLR)","author":"Kipf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref12","article-title":"Graph neural networks for graphs with heterophily: A survey","author":"Zheng","year":"2022","journal-title":"arXiv:2202.07082"},{"key":"ref13","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. 7th Int. Conf. Learn. Represent. (ICLR)","author":"Xu"},{"key":"ref14","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Represent. (ICLR)","author":"Velickovic"},{"key":"ref15","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":"ref16","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. 37th Int. Conf. Mach. Learn. (ICML)","author":"Chen"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301922"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1247"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00354"},{"key":"ref22","first-page":"1","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. 8th Int. Conf. Learn. Represent. (ICLR)","author":"Pei"},{"key":"ref23","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":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref25","first-page":"3","article-title":"Graph neural networks using an IGR multi-duplicated characterization of graph structures","volume-title":"Proc. 127th Meeting Special Interest Group Knowl. Based Syst. (SIG-KBS)","author":"Oishi"},{"issue":"11","key":"ref26","first-page":"2605","article-title":"Visualizing data using t-SNE","volume":"9","author":"Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref29","first-page":"1","article-title":"Efficient estimation of word representations in vector space","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Mikolov"},{"key":"ref30","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Gilmer"},{"key":"ref31","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. 36th Int. Conf. Mach. Learn. (ICML)","author":"Wu"},{"key":"ref32","article-title":"Unifying graph convolutional neural networks and label propagation","author":"Wang","year":"2020","journal-title":"arXiv:2002.06755"},{"key":"ref33","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":"ref34","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":"ref35","first-page":"21","article-title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Abu-El-Haija"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"ref37","article-title":"Revisiting heterophily for graph neural networks","author":"Luan","year":"2022","journal-title":"arXiv:2210.07606"},{"key":"ref38","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":"ref39","first-page":"1","article-title":"ADAM: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kingma"},{"key":"ref40","article-title":"Neural sheaf diffusion: A topological perspective on heterophily and oversmoothing in GNNs","author":"Bodnar","year":"2022","journal-title":"arXiv:2202.04579"},{"key":"ref41","first-page":"13242","article-title":"Finding global homophily in graph neural networks when meeting heterophily","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Li"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10092749.pdf?arnumber=10092749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T07:37:15Z","timestamp":1710401835000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10092749\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3264596","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}