{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:26:33Z","timestamp":1774538793145,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2020R1A2C1012196"],"award-info":[{"award-number":["2020R1A2C1012196"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Consumer Electron."],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1109\/tce.2023.3345390","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:31:50Z","timestamp":1703187110000},"page":"2872-2883","source":"Crossref","is-referenced-by-count":4,"title":["Feature Selection Graph Neural Network for Optimized Node Categorization"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1355-710X","authenticated-orcid":false,"given":"K. R. Sri","family":"Preethaa","sequence":"first","affiliation":[{"name":"Department of Robot and Smart System Engineering, Kyungpook National University, Daegu, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3189-695X","authenticated-orcid":false,"given":"Gitanjali","family":"Wadhwa","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, KPR Institute of Engineering and Technology, Coimbatore, India"}]},{"given":"Yuvaraj","family":"Natarajan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, KPR Institute of Engineering and Technology, Coimbatore, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0335-0674","authenticated-orcid":false,"given":"Anand","family":"Paul","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017","journal-title":"arXiv:1609.02907"},{"key":"ref2","article-title":"Graph attention networks","author":"Velickovic","year":"2018","journal-title":"arXiv:1710.10903"},{"key":"ref3","first-page":"21","article-title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija"},{"key":"ref4","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482487"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref7","article-title":"Graph convolutional matrix completion","author":"van den Berg","year":"2017","journal-title":"arXiv:1706.02263"},{"key":"ref8","first-page":"1","article-title":"Hyperbolic graph convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chami"},{"key":"ref9","first-page":"4805","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/math10020231"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3446217"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1159"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/iccvw54120.2021.00030"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2017.2647904"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ieeeconf53345.2021.9723298"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2020.2978386"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/s21072515"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2022.02.025"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/5901087"},{"key":"ref21","article-title":"Fastgcn: Fast learning with graph convolutional networks via importance sampling","author":"Chen","year":"2018","journal-title":"arXiv:1801.10247"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.045"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0165551515613226"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5909"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/cae.22179"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/cae.22253"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1177\/0165551516677911"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/2497471"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1177\/0165551516638784"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2021.3134200"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-022-10843-4"},{"key":"ref33","article-title":"Graph neural networks for graphs with heterophily: A survey","author":"Zheng","year":"2022","journal-title":"arXiv:2202.07082"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19807-7_29"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3461615.3491104"},{"key":"ref36","article-title":"Adaptive universal generalized pagerank graph neural network","author":"Chien","year":"2020","journal-title":"arXiv:2006.07988"},{"key":"ref37","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/access.2021.3049734"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2945911"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2017.02.008"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2020.3014173"}],"container-title":["IEEE Transactions on Consumer Electronics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/30\/10510045\/10368031.pdf?arnumber=10368031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T18:47:01Z","timestamp":1714762021000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10368031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":41,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tce.2023.3345390","relation":{},"ISSN":["0098-3063","1558-4127"],"issn-type":[{"value":"0098-3063","type":"print"},{"value":"1558-4127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2]]}}}