{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:18:34Z","timestamp":1758273514364,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Republic of Koreas MSIT","award":["2020-0- 01463"],"award-info":[{"award-number":["2020-0- 01463"]}]},{"DOI":"10.13039\/501100002573","name":"Yonsei University","doi-asserted-by":"publisher","award":["2020-22-0101"],"award-info":[{"award-number":["2020-22-0101"]}],"id":[{"id":"10.13039\/501100002573","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Health and Welfare Republic of Korea","award":["HI20C0127"],"award-info":[{"award-number":["HI20C0127"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tpami.2020.3032286","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T18:17:46Z","timestamp":1603304266000},"page":"1-1","source":"Crossref","is-referenced-by-count":16,"title":["DeepNC: Deep Generative Network Completion"],"prefix":"10.1109","author":[{"given":"Cong","family":"Tran","sequence":"first","affiliation":[]},{"given":"Won-Yong","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Spitz","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Gertz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.07.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaa1465"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/PerComW.2012.6197508"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2013.07.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3461339"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(03)00628-4"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/080734315"},{"key":"ref10","first-page":"5694","article-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref11","first-page":"609","article-title":"NetGAN: Generating graphs via random walks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bojchevski"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918.ch9"},{"key":"ref16","first-page":"4257","article-title":"Efficient graph generation with graph recurrent attention networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liao"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_41"},{"key":"ref18","first-page":"1","article-title":"Variational graph auto-encoders","volume-title":"Proc. NIPS Workshops Bayesian Deep Learn.","author":"Kipf"},{"key":"ref19","first-page":"6410","article-title":"Graph convolutional policy network for goal-directed molecular graph generation","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"You"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2019.00003"},{"article-title":"Learning deep generative models of graphs","year":"2018","author":"Li","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"ref23","first-page":"5165","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref24","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","volume-title":"Proc. 23rd Int. Conf. Neural Inf. Process. Syst.","author":"Jain"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2018223"},{"key":"ref26","first-page":"3697","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Monti"},{"key":"ref27","first-page":"757","article-title":"Online clustering of bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gentile"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392748"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/bf01200757"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23783-6_28"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2536775"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492534"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220123"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.ap08518"},{"key":"ref35","first-page":"1","article-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","volume-title":"Proc. Deep Learn. Representation Learn. Workshops","author":"Chung"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517\u20136161.1977.tb01600.x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/3527602755.ch2"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016118"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.06.014"},{"key":"ref42","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09229516.pdf?arnumber=9229516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:26:29Z","timestamp":1704842789000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9229516\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/tpami.2020.3032286","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2020]]}}}