{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:06:08Z","timestamp":1775912768288,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1109\/ijcnn52387.2021.9533743","type":"proceedings-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T17:27:41Z","timestamp":1632158861000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Graphgen-redux: a Fast and Lightweight Recurrent Model for labeled Graph Generation"],"prefix":"10.1109","author":[{"given":"Davide","family":"Bacciu","sequence":"first","affiliation":[{"name":"University of Pisa,Dept. of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Podda","sequence":"additional","affiliation":[{"name":"University of Pisa,Dept. of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1021\/ci00057a005"},{"key":"ref32","first-page":"723","article-title":"A kernel two-sample test","volume":"13","author":"gretton","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref31","first-page":"255","author":"costa","year":"2010","journal-title":"Fast neighborhood subgraph pairwise distance kernel"},{"key":"ref30","article-title":"A fair comparison of graph neural networks for graph classification","author":"errica","year":"2020","journal-title":"Proceedings of the 8th International Conference on Learning Representations (ICLR)"},{"key":"ref37","first-page":"1929","article-title":"Dropout: a simple way to prevent neural networks from overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref36","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proceedings of the 3rd International Conference on Learning Representations ICLR"},{"key":"ref35","article-title":"Troubling trends in machine learning scholarship","author":"lipton","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref34","author":"landrum","year":"0","journal-title":"RDKit Open-source cheminformatics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808746"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"ref12","first-page":"721","article-title":"gspan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002)"},{"key":"ref13","article-title":"MoIGAN: An implicit generative model for small molecular graphs","author":"de cao","year":"2018","journal-title":"Workshop on Theoretical Foundations and Applications of Deep Generative Models International Conference on Machine Learninv (ICML)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_41"},{"key":"ref15","article-title":"Learning graphical state transitions","author":"johnson","year":"2017","journal-title":"International Conference on Learning Representations (ICLR)"},{"key":"ref16","article-title":"Learning deep generative models of graphs","volume":"abs 1803 3324","author":"li","year":"2018","journal-title":"CoRR"},{"key":"ref17","article-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","author":"you","year":"2018","journal-title":"Proc of the International Conference on Machine Learning (ICML)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2010350"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/276675.276685"},{"key":"ref4","first-page":"2434","article-title":"Graphite: Iterative generative modeling of graphs","volume":"97","author":"grover","year":"2019","journal-title":"Machine Learning Research"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh081"},{"key":"ref3","first-page":"2240","article-title":"A deep generative model for fragment-based molecule generation","volume":"108","author":"podda","year":"2020","journal-title":"Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref6","author":"guo","year":"2020","journal-title":"A systematic survey on deep generative models for graph generation"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref5","first-page":"2508","article-title":"GraphGAN: Graph representation learning with generative adversarial nets","author":"wang","year":"2018","journal-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380201"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.06.006"},{"key":"ref2","first-page":"7935","article-title":"A model to search for synthesizable molecules","author":"bradshaw","year":"2019","journal-title":"Proceedings of the 33rd Conference on Neural Information Processing Systems (NeurIPS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref1","article-title":"Learning multimodal graph-to-graph translation for molecule optimization","author":"jin","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"ref20","first-page":"294","article-title":"Contextual graph Markov model: A deep and generative approach to graph processing","volume":"80","author":"bacciu","year":"2018","journal-title":"Proceedings of the International Conference on Machine Learning (ICML)"},{"key":"ref22","article-title":"Edge-based sequential graph generation with recurrent neural networks","author":"bacciu","year":"2019","journal-title":"Neurocomputing"},{"key":"ref21","article-title":"MolecularRNN: Generating realistic molecular graphs with optimized properties","author":"popova","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref24","author":"kawai","year":"2019","journal-title":"Scalable generative models for graphs with graph attention mechanism"},{"key":"ref23","article-title":"Graph generation by sequential edge prediction","author":"bacciu","year":"2019","journal-title":"Proceedings of the European Symposium on Artificial Neural Networks Computational Intelligence and Machine Learning (ESANN)"},{"key":"ref26","first-page":"955d","article-title":"PubChem BioAssay: 2017 update","volume":"45","author":"gindulyte","year":"2016","journal-title":"Nucleic Acids Research"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1989.1.2.270"}],"event":{"name":"2021 International Joint Conference on Neural Networks (IJCNN)","location":"Shenzhen, China","start":{"date-parts":[[2021,7,18]]},"end":{"date-parts":[[2021,7,22]]}},"container-title":["2021 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9533266\/9533267\/09533743.pdf?arnumber=9533743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T19:32:10Z","timestamp":1659468730000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9533743\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/ijcnn52387.2021.9533743","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]}}}