{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:44:49Z","timestamp":1771958689117,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2022YFB4501704"],"award-info":[{"award-number":["2022YFB4501704"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472317"],"award-info":[{"award-number":["62472317"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Science and Technology Innovation Action Plan Project","award":["22YS1400600"],"award-info":[{"award-number":["22YS1400600"]}]},{"name":"Shanghai Science and Technology Innovation Action Plan Project","award":["22511100700"],"award-info":[{"award-number":["22511100700"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tbdata.2025.3533898","type":"journal-article","created":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T14:06:19Z","timestamp":1737986779000},"page":"2457-2470","source":"Crossref","is-referenced-by-count":3,"title":["Scalable Learning-Based Community-Preserving Graph Generation"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1454-8240","authenticated-orcid":false,"given":"Sheng","family":"Xiang","sequence":"first","affiliation":[{"name":"Australia Artificial Intelligence Institute, University of Technology Sydney, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5992-6615","authenticated-orcid":false,"given":"Chenhao","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5877-7387","authenticated-orcid":false,"given":"Dawei","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tongji University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"Australia Artificial Intelligence Institute, University of Technology Sydney, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"issue":"4","key":"ref2","article-title":"Rumor detection with self-supervised learning on texts and social graph","volume-title":"Front. Comput. Sci.","volume":"17","author":"Gao","year":"2023"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfineco.2006.05.012"},{"key":"ref4","first-page":"6412","article-title":"Graph convolutional policy network for goal-directed molecular graph generation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/836"},{"key":"ref6","first-page":"10553","article-title":"G2SAT: Learning to generate SAT formulas","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3379445"},{"issue":"1","key":"ref8","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erds","year":"1960","journal-title":"Pub. Math. Inst. Hung. Acad. Sci"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref11","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"Airoldi","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-009-0140-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918.ch9"},{"key":"ref14","first-page":"5694","article-title":"Graphrnn: Generating realistic graphs with deep auto-regressive models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref15","first-page":"610","article-title":"NetGAN: Generating graphs via random walks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bojchevski"},{"key":"ref16","first-page":"4466","article-title":"Stochastic blockmodels meet graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mehta"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3027346"},{"key":"ref18","first-page":"1338","article-title":"Conditional structure generation through graph variational generative adversarial nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55210-3_198"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/130914218"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2018.8545474"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/VAST50239.2020.00013"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3094549"},{"key":"ref29","first-page":"4255","article-title":"Efficient graph generation with graph recurrent attention networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liao"},{"key":"ref30","first-page":"2302","article-title":"Scalable deep generative modeling for sparse graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai"},{"key":"ref31","first-page":"1","article-title":"Variational graph auto-encoders","volume-title":"Proc. NIPS Workshop Bayesian Deep Learn.","author":"Kipf"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00701-5"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_41"},{"key":"ref34","first-page":"2434","article-title":"Graphite: Iterative generative modeling of graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Grover"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3371592"},{"key":"ref36","first-page":"20310","article-title":"How universal polynomial bases enhance spectral graph neural networks: Heterophily, over-smoothing, and over-squashing","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Huang"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294547"},{"key":"ref38","first-page":"3581","article-title":"Semi-supervised learning with deep generative models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kingma"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2021.3081010"},{"key":"ref40","first-page":"2508","article-title":"GraphGAN: Graph representation learning with generative adversarial nets","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Wang"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330866"},{"issue":"1","key":"ref42","article-title":"Adversarial network embedding using structural similarity","volume-title":"Front. Comput. Sci.","volume":"15","author":"Zhou","year":"2021"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271768"},{"issue":"3","key":"ref44","article-title":"A subgraph matching algorithm based on subgraph index for knowledge graph","volume-title":"Front. Comput. Sci.","volume":"16","author":"Sun","year":"2022"},{"key":"ref45","first-page":"4800","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1037\/1082-989X.9.3.386"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953024"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref49","first-page":"1","article-title":"PairNorm: Tackling oversmoothing in GNNs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhao"},{"key":"ref50","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref51","first-page":"1","article-title":"Enjoy your editing: Controllable GANs for image editing via latent space navigation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhuang"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg340"},{"key":"ref54","first-page":"1","article-title":"Graph kernels for object category prediction in task-dependent robot grasping","volume-title":"Proc. 11th Workshop Mining Learn. Graphs","author":"Neumann"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3341161.3342890"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/11149634\/10854817.pdf?arnumber=10854817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T04:37:40Z","timestamp":1756960660000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10854817\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":56,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2025.3533898","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}