{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:30:55Z","timestamp":1792787455930,"version":"4.5.0"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"5","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62206002, 62206004,and 62272001"],"award-info":[{"award-number":["62206002, 62206004,and 62272001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hefei Key Common Technology Project","award":["2023SGJ014"],"award-info":[{"award-number":["2023SGJ014"]}]},{"name":"Xunfei Zhiyuan Digital Transformation Innovation Research Special for Universities","award":["2023ZY001"],"award-info":[{"award-number":["2023ZY001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>\n                    <jats:bold>Heterogeneous graph neural networks (HGNN)<\/jats:bold>\n                    have exhibited significant performance gains by modeling the information propagation process in graph-structured data for recommender systems. However, existing HGNN-based Recommendation still face two challenges: (1) They overlook the rich semantics brought by the combination of different meta-paths, making it difficult to capture the importance of various meta-paths; (2) when HGNN use meta-paths to capture high-order information, they are susceptible to noise data, as noise from connected nodes can create cumulative effects on a target node in the graph. To tackle these issues, we propose a new model called the\n                    <jats:bold>Denoising Heterogeneous Graph Pre-training Framework (DHGPF)<\/jats:bold>\n                    to enhance recommendation tasks. This framework has two stages: pre-training and training. In the pre-training stage, we assign learnable weights to different meta-paths and use a simplified multi-layer graph convolution network to automatically aggregate semantic information from different meta-path combinations. This approach can capture the importance of these paths. The training stage focuses on reducing noise using gating mechanism and denoising structure learning methods. These methods accomplish the denoising process through information filtering. Our model was evaluated on three real-world datasets, demonstrating that DHGPF outperforms other state-of-the-art recommendation methods. We have further organized the source code of the article at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/wangyu0627\/DHGPF\">https:\/\/github.com\/wangyu0627\/DHGPF<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1145\/3706632","type":"journal-article","created":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T06:51:20Z","timestamp":1733381480000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Denoising Heterogeneous Graph Pre-training Framework for Recommendation"],"prefix":"10.1145","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1480-6522","authenticated-orcid":false,"given":"Lei","family":"Sang","sequence":"first","affiliation":[{"name":"Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6272-8714","authenticated-orcid":false,"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8709-1088","authenticated-orcid":false,"given":"Yiwen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-1704","authenticated-orcid":false,"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[{"name":"Hefei University of Technology, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,10]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"Thomas Bird Julius Kunze and David Barber. 2018. Stochastic variational optimization. arXiv:1809.04855. Retrieved from https:\/\/arxiv.org\/abs\/1809.04855"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2022.3151026"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16515"},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Huiyuan Chen Lan Wang Yusan Lin Chin-Chia Michael Yeh Fei Wang and Hao Yang. 2021b. Structured graph convolutional networks with stochastic masks for recommender systems. In SIGIR 614\u2013623.","DOI":"10.1145\/3404835.3462868"},{"key":"e_1_3_2_6_2","first-page":"1012","article-title":"Improving recommendation fairness via data augmentation","author":"Chen Lei","year":"2023","unstructured":"Lei Chen, Le Wu, Kun Zhang, Richang Hong, Defu Lian, Zhiqiang Zhang, Jun Zhou, and Meng Wang. 2023. Improving recommendation fairness via data augmentation. In WWW, 1012\u20131020.","journal-title":"WWW"},{"key":"e_1_3_2_7_2","first-page":"544","article-title":"Heterogeneous graph contrastive learning for recommendation","author":"Chen Mengru","year":"2023","unstructured":"Mengru Chen, Chao Huang, Lianghao Xia, Wei Wei, Yong Xu, and Ronghua Luo. 2023. Heterogeneous graph contrastive learning for recommendation. In WSDM, 544\u2013552.","journal-title":"WSDM"},{"key":"e_1_3_2_8_2","unstructured":"Jacob Devlin Ming-Wei Chang Kenton Lee and Kristina Toutanova. 2018. Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv:1810.04805. Retrieved from https:\/\/arxiv.org\/abs\/1810.04805"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07251-z"},{"key":"e_1_3_2_10_2","first-page":"135","article-title":"Metapath2vec: Scalable representation learning for heterogeneous networks","author":"Dong Yuxiao","year":"2017","unstructured":"Yuxiao Dong, Nitesh V. Chawla, and Ananthram Swami. 2017. Metapath2vec: Scalable representation learning for heterogeneous networks. In KDD, 135\u2013144.","journal-title":"KDD"},{"key":"e_1_3_2_11_2","first-page":"4861","article-title":"Heterogeneous network representation learning.","volume":"20","author":"Dong Yuxiao","year":"2020","unstructured":"Yuxiao Dong, Ziniu Hu, Kuansan Wang, Yizhou Sun, and Jie Tang. 2020. Heterogeneous network representation learning. In IJCAI, Vol. 20, 4861\u20134867.","journal-title":"IJCAI"},{"key":"e_1_3_2_12_2","first-page":"2478","article-title":"Metapath-guided heterogeneous graph neural network for intent recommendation","author":"Fan Shaohua","year":"2019","unstructured":"Shaohua Fan, Junxiong Zhu, Xiaotian Han, Chuan Shi, Linmei Hu, Biyu Ma, and Yongliang Li. 2019. Metapath-guided heterogeneous graph neural network for intent recommendation. In KDD, 2478\u20132486.","journal-title":"KDD"},{"key":"e_1_3_2_13_2","first-page":"3993","article-title":"OpenHGNN: An open source toolkit for heterogeneous graph neural network","author":"Han Hui","year":"2022","unstructured":"Hui Han, Tianyu Zhao, Cheng Yang, Hongyi Zhang, Yaoqi Liu, Xiao Wang, and Chuan Shi. 2022. OpenHGNN: An open source toolkit for heterogeneous graph neural network. In CIKM, 3993\u20133997.","journal-title":"CIKM"},{"key":"e_1_3_2_14_2","first-page":"639","article-title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","author":"He Xiangnan","year":"2020","unstructured":"Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, Yongdong Zhang, and Meng Wang. 2020. Lightgcn: Simplifying and powering graph convolution network for recommendation. In SIGIR, 639\u2013648.","journal-title":"SIGIR"},{"key":"e_1_3_2_15_2","first-page":"173","article-title":"Neural collaborative filtering","author":"He Xiangnan","year":"2017","unstructured":"Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. 2017. Neural collaborative filtering. In WWW, 173\u2013182.","journal-title":"WWW"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_17_2","first-page":"1857","article-title":"GPT-GNN: Generative pre-training of graph neural networks","author":"Hu Ziniu","year":"2020","unstructured":"Ziniu Hu, Yuxiao Dong, Kuansan Wang, Kai-Wei Chang, and Yizhou Sun. 2020b. GPT-GNN: Generative pre-training of graph neural networks. In KDD, 1857\u20131867.","journal-title":"KDD"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380027"},{"key":"e_1_3_2_19_2","first-page":"756","article-title":"Pre-training on large-scale heterogeneous graph","author":"Jiang Xunqiang","year":"2021","unstructured":"Xunqiang Jiang, Tianrui Jia, Yuan Fang, Chuan Shi, Zhe Lin, and Hui Wang. 2021. Pre-training on large-scale heterogeneous graph. In KDD, 756\u2013766.","journal-title":"KDD"},{"key":"e_1_3_2_20_2","first-page":"803","article-title":"Contrastive pre-training of GNNs on heterogeneous graphs","author":"Jiang Xunqiang","year":"2021","unstructured":"Xunqiang Jiang, Yuanfu Lu, Yuan Fang, and Chuan Shi. 2021. Contrastive pre-training of GNNs on heterogeneous graphs. In CIKM, 803\u2013812.","journal-title":"CIKM"},{"key":"e_1_3_2_21_2","first-page":"66","article-title":"Graph structure learning for robust graph neural networks","author":"Jin Wei","year":"2020","unstructured":"Wei Jin, Yao Ma, Xiaorui Liu, Xianfeng Tang, Suhang Wang, and Jiliang Tang. 2020. Graph structure learning for robust graph neural networks. In KDD, 66\u201374.","journal-title":"KDD"},{"key":"e_1_3_2_22_2","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. Retrieved from https:\/\/arxiv.org\/abs\/1609.02907"},{"key":"e_1_3_2_23_2","first-page":"2320","article-title":"Improving graph collaborative filtering with neighborhood-enriched contrastive learning","author":"Lin Zihan","year":"2022","unstructured":"Zihan Lin, Changxin Tian, Yupeng Hou, and Wayne Xin Zhao. 2022. Improving graph collaborative filtering with neighborhood-enriched contrastive learning. In WWW, 2320\u20132329.","journal-title":"WWW"},{"key":"e_1_3_2_24_2","first-page":"1160","article-title":"Social recommendation with Self-supervised metagraph informax network","author":"Long Xiaoling","year":"2021","unstructured":"Xiaoling Long, Chao Huang, Yong Xu, Huance Xu, Peng Dai, Lianghao Xia, and Liefeng Bo. 2021. Social recommendation with Self-supervised metagraph informax network. In CIKM, 1160\u20131169.","journal-title":"CIKM"},{"key":"e_1_3_2_25_2","unstructured":"Christos Louizos Max Welling and Diederik P Kingma. 2017. Learning sparse neural networks through \\(l\\_0\\) regularization. arXiv:1712.01312. Retrieved from https:\/\/arxiv.org\/abs\/1712.01312"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"e_1_3_2_27_2","first-page":"701","article-title":"Deepwalk: Online learning of social representations","author":"Perozzi Bryan","year":"2014","unstructured":"Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations. In KDD, 701\u2013710.","journal-title":"KDD"},{"key":"e_1_3_2_28_2","article-title":"Heterogeneous deep graph infomax","author":"Ren Yuxiang","year":"2019","unstructured":"Yuxiang Ren, Bo Liu, Chao Huang, Peng Dai, Liefeng Bo, and Jiawei Zhang. 2019. Heterogeneous deep graph infomax. In AAAI.","journal-title":"AAAI"},{"key":"e_1_3_2_29_2","unstructured":"Steffen Rendle Christoph Freudenthaler Zeno Gantner and Lars Schmidt-Thieme. 2012. BPR: Bayesian personalized ranking from implicit feedback. arXiv:1205.2618. Retrieved from https:\/\/arxiv.org\/abs\/1205.2618"},{"key":"e_1_3_2_30_2","unstructured":"Yu Rong Wenbing Huang Tingyang Xu and Junzhou Huang. 2019. Dropedge: Towards deep graph convolutional networks on node classification. arXiv:1907.10903. Retrieved from https:\/\/arxiv.org\/abs\/1907.10903"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"e_1_3_2_32_2","unstructured":"Lei Sang Yu Wang Yi Zhang Yiwen Zhang and Xindong Wu. 2024. Intent-guided heterogeneous graph contrastive learning for recommendation. arXiv:2407.17234. Retrieved from https:\/\/arxiv.org\/abs\/2407.17234"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2020.3007330"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833443"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3273255"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3618107"},{"issue":"8","key":"e_1_3_2_39_2","first-page":"7693","article-title":"Adversarial attack and defense on graph data: A survey","volume":"35","author":"Sun Lichao","year":"2022","unstructured":"Lichao Sun, Yingtong Dou, Carl Yang, Kai Zhang, Ji Wang, S. Yu Philip, Lifang He, and Bo Li. 2022. Adversarial attack and defense on graph data: A survey. IEEE Transactions on Knowledge and Data Engineering 35, 8 (2022), 7693\u20137711.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_40_2","unstructured":"Michael Tschannen Josip Djolonga Paul K. Rubenstein Sylvain Gelly and Mario Lucic. 2019. On mutual information maximization for representation learning. arXiv:1907.13625. Retrieved from https:\/\/arxiv.org\/abs\/1907.13625"},{"issue":"11","key":"e_1_3_2_41_2","article-title":"Visualizing data using t-SNE","volume":"9","author":"Maaten Laurens Van der","year":"2008","unstructured":"Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of Machine Learning Research 9, 11 (2008).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_42_2","first-page":"6000","article-title":"Attention is all you need","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In NeurIPS, 6000\u20136010.","journal-title":"NeurIPS"},{"issue":"20","key":"e_1_3_2_43_2","first-page":"10","article-title":"Graph attention networks","volume":"1050","author":"Velickovic Petar","year":"2017","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. STAT 1050, 20 (2017), 10\u201348550.","journal-title":"STAT"},{"key":"e_1_3_2_44_2","unstructured":"Petar Veli\u010dkovi\u0107 William Fedus William L. Hamilton Pietro Li\u00f2 Yoshua Bengio and R. Devon Hjelm. 2018. Deep graph infomax. arXiv:1809.10341. Retrieved from https:\/\/arxiv.org\/abs\/1809.10341"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3528667"},{"key":"e_1_3_2_46_2","first-page":"9929","volume-title":"ICML","author":"Wang Tongzhou","year":"2020","unstructured":"Tongzhou Wang and Phillip Isola. 2020. Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In ICML. PMLR, 9929\u20139939."},{"key":"e_1_3_2_47_2","first-page":"1717","article-title":"Deconfounded recommendation for alleviating Bias amplification","author":"Wang Wenjie","year":"2021","unstructured":"Wenjie Wang, Fuli Feng, Xiangnan He, Xiang Wang, and Tat-Seng Chua. 2021. Deconfounded recommendation for alleviating Bias amplification. In KDD, 1717\u20131725.","journal-title":"KDD"},{"key":"e_1_3_2_48_2","first-page":"3562","article-title":"Causal representation learning for out-of-distribution recommendation","author":"Wang Wenjie","year":"2022","unstructured":"Wenjie Wang, Xinyu Lin, Fuli Feng, Xiangnan He, Min Lin, and Tat-Seng Chua. 2022. Causal representation learning for out-of-distribution recommendation. In WWW, 3562\u20133571.","journal-title":"WWW"},{"key":"e_1_3_2_49_2","first-page":"950","article-title":"KGAT: Knowledge graph attention network for recommendation","author":"Wang Xiang","year":"2019","unstructured":"Xiang Wang, Xiangnan He, Yixin Cao, Meng Liu, and Tat-Seng Chua. 2019. KGAT: Knowledge graph attention network for recommendation. In KDD, 950\u2013958.","journal-title":"KDD"},{"key":"e_1_3_2_50_2","first-page":"165","article-title":"Neural graph collaborative filtering","author":"Wang Xiang","year":"2019","unstructured":"Xiang Wang, Xiangnan He, Meng Wang, Fuli Feng, and Tat-Seng Chua. 2019. Neural graph collaborative filtering. In SIGIR, 165\u2013174.","journal-title":"SIGIR"},{"key":"e_1_3_2_51_2","first-page":"2022","article-title":"Heterogeneous graph attention network","author":"Wang Xiao","year":"2019","unstructured":"Xiao Wang, Houye Ji, Chuan Shi, Bai Wang, Yanfang Ye, Peng Cui, and Philip S. Yu. 2019. Heterogeneous graph attention network. In WWW, 2022\u20132032.","journal-title":"WWW"},{"key":"e_1_3_2_52_2","first-page":"1726","article-title":"Self-supervised heterogeneous graph neural network with co-contrastive learning","author":"Wang Xiao","year":"2021","unstructured":"Xiao Wang, Nian Liu, Hui Han, and Chuan Shi. 2021. Self-supervised heterogeneous graph neural network with co-contrastive learning. In KDD, 1726\u20131736.","journal-title":"KDD"},{"key":"e_1_3_2_53_2","first-page":"1605","article-title":"Disenhan: Disentangled heterogeneous graph attention network for recommendation","author":"Wang Yifan","year":"2020","unstructured":"Yifan Wang, Suyao Tang, Yuntong Lei, Weiping Song, Sheng Wang, and Ming Zhang. 2020. Disenhan: Disentangled heterogeneous graph attention network for recommendation. In CIKM, 1605\u20131614.","journal-title":"CIKM"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3274759"},{"key":"e_1_3_2_55_2","first-page":"6861","article-title":"Simplifying graph convolutional networks","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 ICML. PMLR, 6861\u20136871.","journal-title":"ICML"},{"key":"e_1_3_2_56_2","first-page":"726","article-title":"Self-supervised graph learning for recommendation","author":"Wu Jiancan","year":"2021","unstructured":"Jiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He, Liang Chen, Jianxun Lian, and Xing Xie. 2021. Self-supervised graph learning for recommendation. In SIGIR, 726\u2013735.","journal-title":"SIGIR"},{"key":"e_1_3_2_57_2","first-page":"251","article-title":"A post-training framework for improving heterogeneous graph neural networks","author":"Yang Cheng","year":"2023","unstructured":"Cheng Yang, Xumeng Gong, Chuan Shi, and Philip Yu. 2023. A post-training framework for improving heterogeneous graph neural networks. In WWW, 251\u2013262.","journal-title":"WWW"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3568396"},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","unstructured":"Yang Ye and Shihao Ji. 2021. Sparse graph attention networks. IEEE Transactions on Knowledge and Data Engineering 35 1 (2021) 905\u2013916.","DOI":"10.1109\/TKDE.2021.3072345"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2893714"},{"key":"e_1_3_2_61_2","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. NeurIPS 33 (2020), 5812\u20135823.","journal-title":"NeurIPS"},{"key":"e_1_3_2_62_2","first-page":"1294","article-title":"Are graph augmentations necessary? Simple graph contrastive learning for recommendation","author":"Yu Junliang","year":"2022","unstructured":"Junliang Yu, Hongzhi Yin, Xin Xia, Tong Chen, Lizhen Cui, and Quoc Viet Hung Nguyen. 2022. Are graph augmentations necessary? Simple graph contrastive learning for recommendation. In SIGIR, 1294\u20131303.","journal-title":"SIGIR"},{"key":"e_1_3_2_63_2","first-page":"793","article-title":"Heterogeneous graph neural network","author":"Zhang Chuxu","year":"2019","unstructured":"Chuxu Zhang, Dongjin Song, Chao Huang, Ananthram Swami, and Nitesh V. Chawla. 2019. Heterogeneous graph neural network. In KDD, 793\u2013803.","journal-title":"KDD"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20357"},{"key":"e_1_3_2_65_2","first-page":"1877","article-title":"Hybrid inverted Index is a robust accelerator for dense retrieval","author":"Zhang Peitian","year":"2023","unstructured":"Peitian Zhang, Zheng Liu, Shitao Xiao, Zhicheng Dou, and Jing Yao. 2023. Hybrid inverted Index is a robust accelerator for dense retrieval. In EMNLP, 1877\u20131888.","journal-title":"EMNLP"},{"key":"e_1_3_2_66_2","unstructured":"Peitian Zhang Shitao Xiao Zheng Liu Zhicheng Dou and Jian-Yun Nie. 2023. Retrieve anything to augment large language models. arXiv:2310.07554. Retrieved from https:\/\/arxiv.org\/abs\/2310.07554"},{"issue":"1","key":"e_1_3_2_67_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3701230","article-title":"Simplify to the limit! Embedding-less graph collaborative filtering for recommender systems","volume":"43","author":"Zhang Yi","year":"2024","unstructured":"Yi Zhang, Yiwen Zhang, Lei Sang, and Victor S. Sheng. 2024. Simplify to the limit! Embedding-less graph collaborative filtering for recommender systems. ACM Transactions on Information Systems 43, 1 (2024), 1\u201330.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3573385"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25617"},{"key":"e_1_3_2_70_2","first-page":"2338","article-title":"Multi-view denoising graph auto-encoders on heterogeneous information networks for cold-start recommendation","author":"Zheng Jiawei","year":"2021","unstructured":"Jiawei Zheng, Qianli Ma, Hao Gu, and Zhenjing Zheng. 2021. Multi-view denoising graph auto-encoders on heterogeneous information networks for cold-start recommendation. In KDD, 2338\u20132348.","journal-title":"KDD"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3706632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T17:11:24Z","timestamp":1752599484000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3706632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,10]]},"references-count":69,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3706632"],"URL":"https:\/\/doi.org\/10.1145\/3706632","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,10]]},"assertion":[{"value":"2024-01-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}