{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:46:03Z","timestamp":1776750363133,"version":"3.51.2"},"reference-count":171,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3098417","type":"journal-article","created":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T16:34:38Z","timestamp":1628094878000},"page":"106675-106702","source":"Crossref","is-referenced-by-count":45,"title":["Notice of Removal: Deep Graph Generators: A Survey"],"prefix":"10.1109","volume":"9","author":[{"given":"Faezeh","family":"Faez","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yassaman","family":"Ommi","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdieh Soleymani","family":"Baghshah","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9835-4493","authenticated-orcid":false,"given":"Hamid R.","family":"Rabiee","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kipf"},{"key":"ref2","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref3","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref4","first-page":"1","article-title":"Unsupervised joint k-node graph representations with compositional energy-based models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cotta"},{"key":"ref5","first-page":"1","article-title":"GCN meets GPU: Decoupling \u2018when to sample\u2019 from \u2018how to sample","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Ramezani"},{"issue":"3","key":"ref6","first-page":"52","article-title":"Representation learning on graphs: Methods and applications","volume":"40","author":"Hamilton","year":"2017","journal-title":"IEEE Data Eng. Bull."},{"key":"ref7","first-page":"3835","article-title":"Graph matching networks for learning the similarity of graph structured objects","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref8","first-page":"1","article-title":"Deep graph matching consensus","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Fey"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"},{"key":"ref10","first-page":"1","article-title":"Adversarial attacks on graph neural networks via meta learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Z\u00fcgner"},{"key":"ref11","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref12","first-page":"137","article-title":"Social-BiGAT: Multimodal trajectory forecasting using bicycle-GAN and graph attention networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kosaraju"},{"issue":"1","key":"ref13","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s","year":"1960","journal-title":"Publications Math. Inst. Hung. Acad. Sci."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918.ch9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1511.06434"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_47"},{"key":"ref20","first-page":"4006","article-title":"Adversarial feature matching for text generation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref21","first-page":"284","article-title":"Riemannian normalizing flow on variational Wasserstein autoencoder for text modeling","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics, Hum","volume":"1","author":"Wang"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2017-970"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-018-0287-6"},{"key":"ref25","first-page":"5708","article-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref26","article-title":"MolecularRNN: Generating realistic molecular graphs with optimized properties","volume-title":"arXiv:1905.13372","author":"Popova","year":"2019"},{"key":"ref27","first-page":"95","article-title":"Graph generation by sequential edge prediction","volume-title":"Proc. ESANN","author":"Bacciu"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.11.112"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380201"},{"key":"ref30","first-page":"4257","article-title":"Efficient graph generation with graph recurrent attention networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liao"},{"key":"ref31","article-title":"Scalable generative models for graphs with graph attention mechanism","volume-title":"arXiv:1906.01861","author":"Kawai","year":"2019"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47426-3_34"},{"key":"ref33","article-title":"Learning deep generative models of graphs","volume-title":"arXiv:1803.03324","author":"Li","year":"2018"},{"key":"ref34","first-page":"2302","article-title":"Scalable deep generative modeling for sparse graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai"},{"key":"ref35","first-page":"1","article-title":"GraphAF: A flow-based autoregressive model for molecular graph generation","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Shi"},{"key":"ref36","article-title":"Auto-decoding graphs","volume-title":"arXiv:2006.02879","author":"Shah","year":"2020"},{"key":"ref37","first-page":"4839","article-title":"Hierarchical generation of molecular graphs using structural motifs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jin"},{"key":"ref38","first-page":"7935","article-title":"A model to search for synthesizable molecules","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bradshaw"},{"key":"ref39","first-page":"7795","article-title":"Constrained graph variational autoencoders for molecule design","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref40","article-title":"DEFactor: Differentiable edge factorization-based probabilistic graph generation","volume-title":"arXiv:1811.09766","author":"Assouel","year":"2018"},{"key":"ref41","first-page":"1","article-title":"Graph generation with variational recurrent neural network","volume-title":"Proc. NIPS Workshop Graph Represent. Learn.","author":"Su"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1039\/C9SC04503A"},{"key":"ref43","first-page":"6410","article-title":"Graph convolutional policy network for goal-directed molecular graph generation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00065"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa317"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-020-00454-3"},{"key":"ref47","first-page":"9603","article-title":"GraphOpt: Learning optimization models of graph formation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Trivedi"},{"key":"ref48","first-page":"1","article-title":"Reinforced molecular optimization with neighborhood-controlled grammars","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Xu"},{"key":"ref49","first-page":"1","article-title":"Guiding deep molecular optimization with genetic exploration","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ahn"},{"key":"ref50","first-page":"1","article-title":"Variational graph auto-encoders","volume-title":"Proc. NIPS Workshop Bayesian Deep Learn.","author":"Kipf"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_41"},{"key":"ref52","article-title":"Graph deconvolutional generation","volume-title":"arXiv:2002.07087","author":"Flam-Shepherd","year":"2020"},{"key":"ref53","first-page":"7113","article-title":"Constrained generation of semantically valid graphs via regularizing variational autoencoders","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ma"},{"key":"ref54","first-page":"2434","article-title":"Graphite: Iterative generative modeling of graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Grover"},{"key":"ref55","first-page":"1","article-title":"Node-edge co-disentangled representation learning for attributed graph generation","volume-title":"Proc. 26th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining","author":"Guo"},{"key":"ref56","first-page":"1","article-title":"Dirichlet graph variational autoencoder","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Li"},{"key":"ref57","first-page":"2323","article-title":"Junction tree variational autoencoder for molecular graph generation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jin"},{"key":"ref58","first-page":"3183","article-title":"Molecular hypergraph grammar with its application to molecular optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kajino"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011110"},{"key":"ref60","first-page":"13578","article-title":"Graph normalizing flows","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref61","first-page":"1340","article-title":"Conditional structure generation through graph variational generative adversarial nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref62","first-page":"1","article-title":"Learning multimodal graph-to-graph translation for molecule optimization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Jin"},{"key":"ref63","first-page":"1","article-title":"MolGAN: An implicit generative model for small molecular graphs","volume-title":"Proc. ICML Workshop Theor. Found. Appl. Deep Generative Models","author":"Cao"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969125"},{"key":"ref65","first-page":"609","article-title":"NetGAN: Generating graphs via random walks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bojchevski"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053451"},{"key":"ref67","article-title":"SHADOWCAST: Controllable graph generation","volume-title":"arXiv:2006.03774","author":"Joon-Wie Tann","year":"2020"},{"key":"ref68","article-title":"Learn to generate time series conditioned graphs with generative adversarial nets","volume-title":"arXiv:2003.01436","author":"Yang","year":"2020"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-019-0404-1"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2019.00003"},{"key":"ref71","article-title":"GraphNVP: An invertible flow model for generating molecular graphs","volume-title":"arXiv:1905.11600","author":"Madhawa","year":"2019"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.2981333"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref74","article-title":"Graph neural networks: A review of methods and applications","volume-title":"arXiv:1812.08434","author":"Zhou","year":"2018"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2975067"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.06.006"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3037118"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3055280"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3363574"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2995074"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2021.3070843"},{"key":"ref82","article-title":"Adversarial attack and defense on graph data: A survey","volume-title":"arXiv:1812.10528","author":"Sun","year":"2018"},{"key":"ref83","article-title":"Deep graph similarity learning: A survey","volume-title":"arXiv:1912.11615","author":"Ma","year":"2019"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/694"},{"key":"ref85","article-title":"A systematic survey on deep generative models for graph generation","volume-title":"arXiv:2007.06686","author":"Guo","year":"2020"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1406.1078"},{"key":"ref88","article-title":"Auto-regressive graph generation modeling with improved evaluation methods","volume-title":"Proc. NeurIPS Workshop Graph Represent. Learn.","author":"Liu"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref90","first-page":"2946","article-title":"Graph to graph: A topology aware approach for graph structures learning and generation","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Sun"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW50498.2020.00184"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2020.3032286"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1184038"},{"key":"ref94","article-title":"DeepGG: A deep graph generator","volume-title":"arXiv:2006.04159","author":"Stier","year":"2020"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240306"},{"key":"ref97","first-page":"1","article-title":"Auto-encoding variational Bayes","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kingma"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.11"},{"key":"ref100","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Gilmer"},{"key":"ref101","article-title":"Order matters: Sequence to sequence for sets","volume-title":"arXiv:1511.06391","author":"Vinyals","year":"2015"},{"key":"ref102","first-page":"1","article-title":"Disentangling interpretable generative parameters of random and real-world graphs","volume-title":"Proc. NIPS Workshop Graph Represent. Learn.","author":"Stoehr"},{"key":"ref103","first-page":"1","article-title":"\u03b2-VAE: Learning basic visual concepts with a constrained variational framework","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Higgins"},{"key":"ref104","first-page":"511","article-title":"Kernel topic models","volume-title":"Proc. Artif. Intell. Statist.","author":"Hennig"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720_0002"},{"key":"ref106","first-page":"1945","article-title":"Grammar variational autoencoder","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Kusner"},{"key":"ref107","first-page":"1","article-title":"Gated graph sequence neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Li"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1021\/acscentsci.9b00576"},{"key":"ref109","first-page":"1","article-title":"Wasserstein auto-encoders","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Tolstikhin"},{"key":"ref110","first-page":"3483","article-title":"Learning structured output representation using deep conditional generative models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sohn"},{"key":"ref111","first-page":"4502","article-title":"Interaction networks for learning about objects, relations and physics","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Battaglia"},{"key":"ref112","article-title":"Proximal policy optimization algorithms","volume-title":"arXiv:1707.06347","author":"Schulman","year":"2017"},{"key":"ref113","first-page":"2","article-title":"Algorithms for inverse reinforcement learning","volume-title":"Proc. ICML","volume":"1","author":"Ng"},{"key":"ref114","first-page":"49","article-title":"Guided cost learning: Deep inverse optimal control via policy optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Finn"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90088-3"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1039\/C8SC05372C"},{"key":"ref117","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Arjovsky"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3363462"},{"key":"ref120","first-page":"1","article-title":"Conditional generative adversarial nets","volume-title":"Proc. NIPS Workshop Deep Learn. Represent.","author":"Mirza"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref122","first-page":"1","article-title":"Continuous control with deep reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Lillicrap"},{"key":"ref123","article-title":"Conditional labeled graph generation with GANs","volume-title":"Proc. ICLR Workshop Represent. Learn. Graphs Manifolds","author":"Fan"},{"key":"ref124","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref125","first-page":"2642","article-title":"Conditional image synthesis with auxiliary classifier GANs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Odena"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.244"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1477"},{"key":"ref128","first-page":"926","article-title":"Reasoning with neural tensor networks for knowledge base completion","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Socher"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.304"},{"key":"ref130","first-page":"1","article-title":"Density estimation using real NVP","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Dinh"},{"key":"ref131","first-page":"10215","article-title":"Glow: Generative flow with invertible 1\u00d71 convolutions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kingma"},{"key":"ref132","first-page":"2338","article-title":"Masked autoregressive flow for density estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Papamakarios"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-017-0235-x"},{"key":"ref134","first-page":"1","article-title":"Syntax-directed variational autoencoder for structured data","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Dai"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1021\/acscentsci.7b00572"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.aap7885"},{"key":"ref137","first-page":"366","article-title":"Atransition-based algorithm forAMR parsing","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics, Hum. Lang. Technol.","author":"Wang"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1037"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1009"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1071"},{"key":"ref141","first-page":"1","article-title":"Deep biaffine attention for neural dependency parsing","volume-title":"Proc. 5th Int. Conf. Learn. Represent. (ICLR)","author":"Dozat"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11968"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-2077"},{"key":"ref144","first-page":"1","article-title":"Learning graphical state transitions","volume-title":"Proc. 5th Int. Conf. Learn. Represent. (ICLR)","author":"Johnson"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00207"},{"key":"ref146","first-page":"91","article-title":"Faster R-CNN: Towards real-time object detection with region proposal networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ren"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.142"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.330"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01246-5_41"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00408"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00632"},{"key":"ref152","first-page":"2171","article-title":"Pixels to graphs by associative embedding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Newell"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6783"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01246-5_21"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12321"},{"key":"ref156","first-page":"1","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.8b00839"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.3389\/fphar.2020.565644"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1186\/1758-2946-1-8"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1038\/nchem.1243"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00934-2_52"},{"key":"ref162","article-title":"RPGAN: GANs interpretability via random routing","volume-title":"arXiv:1912.10920","author":"Voynov","year":"2019"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2020.2964499"},{"key":"ref164","first-page":"3732","article-title":"Latent intention dialogue models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wen"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1101"},{"key":"ref166","first-page":"8840","article-title":"Dispersed exponential family mixture VAEs for interpretable text generation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Shi"},{"key":"ref167","first-page":"4790","article-title":"Conditional image generation with PixelCNN decoders","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Van den Oord"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00917"},{"key":"ref169","first-page":"1587","article-title":"Toward controlled generation of text","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hu"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11325"},{"key":"ref171","article-title":"CTRL: A conditional transformer language model for controllable generation","volume-title":"arXiv:1909.05858","author":"Keskar","year":"2019"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09490655.pdf?arnumber=9490655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:17:14Z","timestamp":1776748634000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9490655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":171,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3098417","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}