{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:38:01Z","timestamp":1775799481627,"version":"3.50.1"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T00:00:00Z","timestamp":1675728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272001, 61872002, and U1936220"],"award-info":[{"award-number":["62272001, 61872002, and U1936220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Research and Development Plan of Anhui Province","award":["202104a05020058"],"award-info":[{"award-number":["202104a05020058"]}]},{"name":"Scientific Research Project for Postgraduates of Anhui Higher Education Institutions","award":["YJS20210051"],"award-info":[{"award-number":["YJS20210051"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2023,7,31]]},"abstract":"<jats:p>Graph-based recommender system has attracted widespread attention and produced a series of research results. Because of the powerful high-order connection modeling capabilities of the Graph Neural Network, the performance of these graph-based recommender systems are far superior to those of traditional neural network-based collaborative filtering models. However, from both analytical and empirical perspectives, the apparent performance improvement is accompanied with a significant time overhead, which is noticeable in large-scale graph topologies. More importantly, the intrinsic data-sparsity problem substantially limits the performance of graph-based recommender systems, which compelled us to revisit graph-based recommendation from a novel perspective. In this article, we focus on analyzing the time complexity of graph-based recommender systems to make it more suitable for real large-scale application scenarios. We propose a novel end-to-end graph recommendation model called the Collaborative Variational Graph Auto-Encoder (CVGA), which uses the information propagation and aggregation paradigms to encode user\u2013item collaborative relationships on the user\u2013item interaction bipartite graph. These relationships are utilized to infer the probability distribution of user behavior for parameter estimation rather than learning user or item embeddings. By doing so, we reconstruct the whole user\u2013item interaction graph according to the known probability distribution in a feasible and elegant manner. From the perspective of the graph auto-encoder, we convert the graph recommendation task into a graph generation problem and are able to do it with approximately linear time complexity. Extensive experiments on four real-world benchmark datasets demonstrate that CVGA can be trained at a faster speed while maintaining comparable performance over state-of-the-art baselines for graph-based recommendation tasks. Further analysis shows that CVGA can effectively mitigate the data sparsity problem and performs equally well on large-scale datasets.<\/jats:p>","DOI":"10.1145\/3573385","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T12:37:53Z","timestamp":1669898273000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Revisiting Graph-based Recommender Systems from the Perspective of Variational Auto-Encoder"],"prefix":"10.1145","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8196-0668","authenticated-orcid":false,"given":"Yi","family":"Zhang","sequence":"first","affiliation":[{"name":"Anhui University, Hefei, Anhui Province, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8709-1088","authenticated-orcid":false,"given":"Yiwen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Anhui University, Hefei, Anhui Province, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1417-5269","authenticated-orcid":false,"given":"Dengcheng","family":"Yan","sequence":"additional","affiliation":[{"name":"Anhui University, Hefei, Anhui Province, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5015-6095","authenticated-orcid":false,"given":"Shuiguang","family":"Deng","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, Zhejiang Province, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7868-5471","authenticated-orcid":false,"given":"Yun","family":"Yang","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Hawthorn, Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2023,2,7]]},"reference":[{"key":"e_1_3_2_2_2","article-title":"Graph convolutional matrix completion","author":"Berg Rianne van den","year":"2017","unstructured":"Rianne van den Berg, Thomas N. Kipf, and Max Welling. 2017. Graph convolutional matrix completion. arXiv:1706.02263. Retrieved from https:\/\/arxiv.org\/abs\/1706.02263.","journal-title":"arXiv:1706.02263"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462968"},{"issue":"2","key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3373807","article-title":"Efficient neural matrix factorization without sampling for recommendation","volume":"38","author":"Chen Chong","year":"2020","unstructured":"Chong Chen, Min Zhang, Yongfeng Zhang, Yiqun Liu, and Shaoping Ma. 2020. Efficient neural matrix factorization without sampling for recommendation. ACM Trans. Inf. Syst. 38, 2 (2020), 1\u201328.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3343117"},{"key":"e_1_3_2_7_2","first-page":"249","volume-title":"Proceedings of the 13th International Conference on Artificial Intelligence and Statistics","author":"Glorot Xavier","year":"2010","unstructured":"Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 249\u2013256."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3309546"},{"key":"e_1_3_2_9_2","first-page":"297","volume-title":"Proceedings of the 13th International Conference on Artificial Intelligence and Statistics","author":"Gutmann Michael","year":"2010","unstructured":"Michael Gutmann and Aapo Hyv\u00e4rinen. 2010. Noise-contrastive estimation: A new estimation principle for unnormalized statistical models. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 297\u2013304."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502622"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16533"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467408"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487589"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347015"},{"key":"e_1_3_2_18_2","article-title":"Adam: A method for stochastic optimization","author":"Kingma Diederik P.","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv:1412.6980. Retrieved from https:\/\/arxiv.org\/abs\/1412.6980.","journal-title":"arXiv:1412.6980"},{"key":"e_1_3_2_19_2","article-title":"Auto-encoding variational bayes","author":"Kingma Diederik P.","year":"2013","unstructured":"Diederik P. Kingma and Max Welling. 2013. Auto-encoding variational bayes. arXiv:1312.6114. Retrieved from https:\/\/arxiv.org\/abs\/1312.6114.","journal-title":"arXiv:1312.6114"},{"key":"e_1_3_2_20_2","article-title":"Variational graph auto-encoders","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv:1611.07308. Retrieved from https:\/\/arxiv.org\/abs\/1611.07308.","journal-title":"arXiv:1611.07308"},{"key":"e_1_3_2_21_2","volume-title":"International Conference on Learning Representations","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186150"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449986"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3151822"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401252"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2168752.2168771"},{"key":"e_1_3_2_29_2","first-page":"452","volume-title":"Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence. 452\u2013461."},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412488"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3_1"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474265"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371831"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2556270"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_41"},{"key":"e_1_3_2_36_2","article-title":"NGAT4Rec: Neighbor-aware graph attention network for recommendation","author":"Song Jinbo","year":"2020","unstructured":"Jinbo Song, Chao Chang, Fei Sun, Xinbo Song, and Peng Jiang. 2020. NGAT4Rec: Neighbor-aware graph attention network for recommendation. arXiv:2010.12256. Retrieved from https:\/\/arxiv.org\/abs\/2010.012256.","journal-title":"arXiv:2010.12256"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450101"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403254"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401123"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015066"},{"key":"e_1_3_2_41_2","first-page":"1214","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Tomczak Jakub","year":"2018","unstructured":"Jakub Tomczak and Max Welling. 2018. VAE with a VampPrior. In International Conference on Artificial Intelligence and Statistics. PMLR, 1214\u20131223."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441759"},{"key":"e_1_3_2_43_2","volume-title":"International Conference on Learning Representations","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450133"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401137"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403177"},{"key":"e_1_3_2_48_2","first-page":"6861","volume-title":"International Conference on Machine Learning","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In International Conference on Machine Learning. PMLR, 6861\u20136871."},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.02.024"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449873"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403309"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314578"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403236"},{"key":"e_1_3_2_55_2","first-page":"3881","volume-title":"International Conference on Machine Learning","author":"Yang Zichao","year":"2017","unstructured":"Zichao Yang, Zhiting Hu, Ruslan Salakhutdinov, and Taylor Berg-Kirkpatrick. 2017. Improved variational autoencoders for text modeling using dilated convolutions. In International Conference on Machine Learning. PMLR, 3881\u20133890."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401165"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240343"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401181"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3573385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:37Z","timestamp":1750178257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,7]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7,31]]}},"alternative-id":["10.1145\/3573385"],"URL":"https:\/\/doi.org\/10.1145\/3573385","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,7]]},"assertion":[{"value":"2022-04-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}