{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T09:07:54Z","timestamp":1785316074921,"version":"3.55.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":["2021R1A2C3004345"],"award-info":[{"award-number":["2021R1A2C3004345"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2023-00220762"],"award-info":[{"award-number":["RS-2023-00220762"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation","award":["2021-0-00347"],"award-info":[{"award-number":["2021-0-00347"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Topics Comput."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/tetc.2023.3292240","type":"journal-article","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T17:25:37Z","timestamp":1689096337000},"page":"150-162","source":"Crossref","is-referenced-by-count":4,"title":["Edgeless-GNN: Unsupervised Representation Learning for Edgeless Nodes"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7402-5065","authenticated-orcid":false,"given":"Yong-Min","family":"Shin","sequence":"first","affiliation":[{"name":"School of Mathematics and Computing (Computational Science and Engineering), Yonsei University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9467-4978","authenticated-orcid":false,"given":"Cong","family":"Tran","sequence":"additional","affiliation":[{"name":"Machine Intelligence & Data Science Laboratory, Yonsei University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6533-3469","authenticated-orcid":false,"given":"Won-Yong","family":"Shin","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computing (Computational Science and Engineering), Yonsei University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3519-7013","authenticated-orcid":false,"given":"Xin","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, University of New South Wales, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.191"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref3","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref4","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Rep.","author":"Kipf"},{"key":"ref5","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref6","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Rep.","author":"Velickovic"},{"key":"ref7","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. 7th Int. Conf. Learn. Rep.","author":"Xu"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref9","first-page":"5171","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. 29th Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref10","first-page":"7134","article-title":"Position-aware graph neural networks","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"You"},{"key":"ref11","first-page":"874","article-title":"Spectral clustering with graph neural networks for graph pooling","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Bianchi"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/486"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2010.10.008"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PerComW.2012.6197508"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2015.05.045"},{"key":"ref16","first-page":"1","article-title":"Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking","volume-title":"Proc. 6th Int. Conf. Learn. Rep.","author":"Bojchevski"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/168"},{"key":"ref18","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. 33nd Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref19","first-page":"5449","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref20","first-page":"1","article-title":"Deep graph infomax","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Velickovic"},{"key":"ref21","first-page":"1","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. 6th Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref22","first-page":"1","article-title":"GraphSAINT: Graph sampling based inductive learning method","volume-title":"Proc. 8th Int. Conf. Learn. Representations","author":"Zeng"},{"key":"ref23","first-page":"3294","article-title":"GNNAutoScale: Scalable and expressive graph neural networks via historical embeddings","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Fey"},{"key":"ref24","first-page":"1","article-title":"PipeGCN: Efficient full-graph training of graph convolutional networks with pipelined feature communication","volume-title":"Proc. 10th Int. Conf. Learn. Rep.","author":"Wan"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref26","first-page":"6437","article-title":"Training graph neural networks with 1000 layers","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref27","first-page":"18762","article-title":"EIGNN: Efficient infinite-depth graph neural networks","volume-title":"Proc. 35th Conf. Neural Inf. Proc. Sys.","author":"Liu"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403177"},{"key":"ref29","first-page":"1972","article-title":"Learning discrete structures for graph neural networks","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Franceschi"},{"key":"ref30","article-title":"A tutorial on energy-based learning","volume-title":"Predicting Structured Data","author":"LeCun","year":"2006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220052"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"ref35","volume-title":"Introduction to Modern Information Retrieval","author":"Salton","year":"1984"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref37","first-page":"1","article-title":"Query-driven active surveying for collective classification","volume-title":"Proc. Workshop Mining Learn. Graphs","author":"Namata"},{"key":"ref38","first-page":"2111","article-title":"Network representation learning with rich text information","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Yang"},{"key":"ref39","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018"},{"key":"ref40","first-page":"1","article-title":"Variational graph auto-encoders","volume-title":"Proc. Proc. Int. Conf. Neural Inf. Process. Syst. Workshop Bayesian Deep Learn.","author":"Kipf"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/362"},{"key":"ref42","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref43","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. 34th Conf. Neural Inf. Proc. Sys.","author":"Zhu"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245516\/10474150\/10179257.pdf?arnumber=10179257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T13:54:54Z","timestamp":1711461294000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10179257\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2023.3292240","relation":{},"ISSN":["2168-6750","2376-4562"],"issn-type":[{"value":"2168-6750","type":"electronic"},{"value":"2376-4562","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}