{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T07:01:28Z","timestamp":1769151688153,"version":"3.49.0"},"reference-count":64,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T00:00:00Z","timestamp":1746748800000},"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":["62032013 and 62102074"],"award-info":[{"award-number":["62032013 and 62102074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science and Technology projects in Liaoning Province","award":["2023JH3\/10200005"],"award-info":[{"award-number":["2023JH3\/10200005"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2025,5,31]]},"abstract":"<jats:p>\n            Graph Contrastive Learning (GCL) leverages data augmentation techniques to produce contrasting views, enhancing the accuracy of recommendation systems through learning the consistency between contrastive views. However, existing augmentation methods, such as directly perturbing interaction graph (e.g., node\/edge dropout), may interfere with the original connections and generate poor contrasting views, resulting in sub-optimal performance. In this article, we define the views that share only a small amount of information with the original graph due to poor data augmentation as noisy views (i.e., the last 20% of the views with a cosine similarity value less than 0.1 to the original view). We demonstrate through detailed experiments that noisy views will significantly degrade recommendation performance. Further, we propose a model-agnostic Symmetric Graph Contrastive Learning (SGCL) method with theoretical guarantees to address this issue. Specifically, we introduce symmetry theory into graph contrastive learning, based on which we propose a symmetric form and contrast loss resistant to noisy interference. We provide theoretical proof that our proposed SGCL method has a high tolerance to noisy views. Further demonstration is given by conducting extensive experiments on three real-world datasets. The experimental results demonstrate that our approach substantially increases recommendation accuracy, with relative improvements reaching as high as 12.25% over nine other competing models. These results highlight the efficacy of our method. The code is available at\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/user683\/SGCL\">https:\/\/github.com\/user683\/SGCL<\/jats:ext-link>\n            .\n          <\/jats:p>","DOI":"10.1145\/3722103","type":"journal-article","created":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T16:52:26Z","timestamp":1741711946000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Symmetric Graph Contrastive Learning against Noisy Views for Recommendation"],"prefix":"10.1145","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5649-1545","authenticated-orcid":false,"given":"Chu","family":"Zhao","sequence":"first","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5419-5286","authenticated-orcid":false,"given":"Enneng","family":"Yang","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2946-7910","authenticated-orcid":false,"given":"Yuliang","family":"Liang","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4492-5075","authenticated-orcid":false,"given":"Jianzhe","family":"Zhao","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1709-5056","authenticated-orcid":false,"given":"Guibing","family":"Guo","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8668-3524","authenticated-orcid":false,"given":"Xingwei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, China"}]}],"member":"320","published-online":{"date-parts":[[2025,5,9]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477141"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_4_2","unstructured":"Shaked Brody Uri Alon and Eran Yahav. 2021. How attentive are graph attention networks? arXiv:2105.14491. Retrieved from https:\/\/arxiv.org\/pdf\/2105.14491"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/3586589.3586890"},{"key":"e_1_3_2_6_2","unstructured":"Xuheng Cai Chao Huang Lianghao Xia and Xubin Ren. 2023. LightGCL: Simple yet effective graph contrastive learning for recommendation. arXiv:2302.08191. Retrieved from https:\/\/doi.org\/10.48550\/arXiv.2302.08191"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1609\/aaai.v34i01.5330","article-title":"Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach","volume":"34","author":"Chen Lei","year":"2020","unstructured":"Lei Chen, Le Wu, Richang Hong, Kun Zhang, and Meng Wang. 2020. Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach. In AAAI, Vol. 34, 27\u201334.","journal-title":"In AAAI"},{"key":"e_1_3_2_8_2","first-page":"16670","article-title":"Robust contrastive learning against noisy views","author":"Chuang Ching-Yao","year":"2022","unstructured":"Ching-Yao Chuang, R. Devon Hjelm, Xin Wang, Vibhav Vineet, Neel Joshi, Antonio Torralba, Stefanie Jegelka, and Yale Song. 2022. Robust contrastive learning against noisy views. In CVPR, 16670\u201316681.","journal-title":"CVPR"},{"issue":"1","key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3426723","article-title":"Deep learning for sequential recommendation: Algorithms, influential factors, and evaluations","volume":"39","author":"Fang Hui","year":"2020","unstructured":"Hui Fang, Danning Zhang, Yiheng Shu, and Guibing Guo. 2020. Deep learning for sequential recommendation: Algorithms, influential factors, and evaluations. Transactions on Information Systems 39, 1 (2020), 1\u201342.","journal-title":"Transactions on Information Systems"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3568022"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10894"},{"key":"e_1_3_2_13_2","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS, Vol. 30.","journal-title":"NIPS"},{"key":"e_1_3_2_14_2","first-page":"1670","article-title":"Candidate-aware graph contrastive learning for recommendation","author":"He Wei","year":"2023","unstructured":"Wei He, Guohao Sun, Jinhu Lu, and Xiu Susie Fang. 2023. Candidate-aware graph contrastive learning for recommendation. In SIGIR, 1670\u20131679.","journal-title":"SIGIR"},{"key":"e_1_3_2_15_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_16_2","doi-asserted-by":"publisher","DOI":"10.3390\/technologies9010002"},{"key":"e_1_3_2_17_2","first-page":"4252","volume-title":"SIGKDD","author":"Jiang Yangqin","year":"2023","unstructured":"Yangqin Jiang, Chao Huang, and Lianghao Huang. 2023. Adaptive graph contrastive learning for recommendation. In SIGKDD. ACM, 4252\u20134261."},{"issue":"2","key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3627158","article-title":"Contrastive self-supervised learning in recommender systems: A survey","volume":"42","author":"Jing Mengyuan","year":"2023","unstructured":"Mengyuan Jing, Yanmin Zhu, Tianzi Zang, and Ke Wang. 2023. Contrastive self-supervised learning in recommender systems: A survey. Transactions on Information Systems 42, 2 (2023), 1\u201339.","journal-title":"Transactions on Information Systems"},{"issue":"9","key":"e_1_3_2_19_2","first-page":"9114","article-title":"Hyperbolic neural collaborative recommender","volume":"35","author":"Li Anchen","year":"2022","unstructured":"Anchen Li, Bo Yang, Huan Huo, Hongxu Chen, Guandong Xu, and Zhen Wang. 2022. Hyperbolic neural collaborative recommender. IEEE Transactions on Knowledge and Data Engineering 35, 9 (2022), 9114\u20139127.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_20_2","first-page":"1680","article-title":"Graph transformer for recommendation","author":"Li Chaoliu","year":"2023","unstructured":"Chaoliu Li, Lianghao Xia, Xubin Ren, Yaowen Ye, Yong Xu, and Chao Huang. 2023. Graph transformer for recommendation. In SIGIR, 1680\u20131689.","journal-title":"SIGIR"},{"issue":"1","key":"e_1_3_2_21_2","first-page":"560","article-title":"Higher-order attribute-enhancing heterogeneous graph neural networks","volume":"35","author":"Li Jianxin","year":"2021","unstructured":"Jianxin Li, Hao Peng, Yuwei Cao, Yingtong Dou, Hekai Zhang, S. Yu Philip, and Lifang He. 2021. Higher-order attribute-enhancing heterogeneous graph neural networks. IEEE Transactions on Knowledge and Data Engineering 35, 1 (2021), 560\u2013574.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_22_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_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3026025"},{"issue":"1","key":"e_1_3_2_24_2","first-page":"857","article-title":"Self-supervised learning: Generative or contrastive","volume":"35","author":"Liu Xiao","year":"2021","unstructured":"Xiao Liu, Fanjin Zhang, Zhenyu Hou, Li Mian, Zhaoyu Wang, Jing Zhang, and Jie Tang. 2021. Self-supervised learning: Generative or contrastive. IEEE Transactions on Knowledge and Data Engineering 35, 1 (2021), 857\u2013876.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"e_1_3_2_25_2","first-page":"5879","article-title":"Graph self-supervised learning: A survey","volume":"35","author":"Liu Yixin","year":"2022","unstructured":"Yixin Liu, Ming Jin, Shirui Pan, Chuan Zhou, Yu Zheng, Feng Xia, and S. Yu Philip. 2022. Graph self-supervised learning: A survey. IEEE Transactions on Knowledge and Data Engineering 35, 6 (2022), 5879\u20135900.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_26_2","unstructured":"Aaron van den Oord Yazhe Li and Oriol Vinyals. 2018. Representation learning with contrastive predictive coding. arXiv:1807.03748. Retrieved from https:\/\/arxiv.org\/pdf\/1807.03748"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-030718-104938"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-023-10465-9"},{"key":"e_1_3_2_29_2","first-page":"813","article-title":"Contrastive learning for representation degeneration problem in sequential recommendation","author":"Qiu Ruihong","year":"2022","unstructured":"Ruihong Qiu, Zi Huang, Hongzhi Yin, and Zijian Wang. 2022. Contrastive learning for representation degeneration problem in sequential recommendation. In WSDM, 813\u2013823.","journal-title":"WSDM"},{"key":"e_1_3_2_30_2","first-page":"1097","article-title":"Robust preference-guided denoising for graph based social recommendation","author":"Quan Yuhan","year":"2023","unstructured":"Yuhan Quan, Jingtao Ding, Chen Gao, Lingling Yi, Depeng Jin, and Yong Li. 2023. Robust preference-guided denoising for graph based social recommendation. In WWW, 1097\u20131108.","journal-title":"WWW"},{"key":"e_1_3_2_31_2","article-title":"Semidefinite relaxations for certifying robustness to adversarial examples","volume":"31","author":"Raghunathan Aditi","year":"2018","unstructured":"Aditi Raghunathan, Jacob Steinhardt, and Percy S. Liang. 2018. Semidefinite relaxations for certifying robustness to adversarial examples. In NIPS, Vol. 31.","journal-title":"NIPS, Vol"},{"key":"e_1_3_2_32_2","unstructured":"Xubin Ren Lianghao Xia Yuhao Yang Wei Wei Tianle Wang Xuheng Cai and Chao Huang. 2023. SSLRec: A self-supervised learning library for recommendation. arXiv:2308.05697. Retrieved from https:\/\/arxiv.org\/pdf\/2308.05697v3"},{"key":"e_1_3_2_33_2","first-page":"1137","article-title":"Disentangled contrastive collaborative filtering","author":"Ren Xubin","year":"2023","unstructured":"Xubin Ren, Lianghao Xia, Jiashu Zhao, Dawei Yin, and Chao Huang. 2023. Disentangled contrastive collaborative filtering. In SIGIR, 1137\u20131146.","journal-title":"SIGIR"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3577925"},{"issue":"20","key":"e_1_3_2_35_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, Yoshua Bengio. 2017. Graph attention networks. Stat 1050, 20 (2017), 10\u201348550.","journal-title":"Stat"},{"key":"e_1_3_2_36_2","first-page":"3307","article-title":"Knowledge graph convolutional networks for recommender systems","author":"Wang Hongwei","year":"2019","unstructured":"Hongwei Wang, Miao Zhao, Xing Xie, Wenjie Li, and Minyi Guo. 2019. Knowledge graph convolutional networks for recommender systems. In WWW, 3307\u20133313.","journal-title":"WWW"},{"key":"e_1_3_2_37_2","first-page":"2017","article-title":"Explanation guided contrastive learning for sequential recommendation","author":"Wang Lei","year":"2022","unstructured":"Lei Wang, Ee-Peng Lim, Zhiwei Liu, and Tianxiang Zhao. 2022. Explanation guided contrastive learning for sequential recommendation. In CIKM, 2017\u20132027.","journal-title":"CIKM"},{"key":"e_1_3_2_38_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 SIGKDD, 950\u2013958.","journal-title":"SIGKDD"},{"key":"e_1_3_2_39_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_40_2","first-page":"1001","article-title":"Disentangled graph collaborative filtering","author":"Wang Xiang","year":"2020","unstructured":"Xiang Wang, Hongye Jin, An Zhang, Xiangnan He, Tong Xu, and Tat-Seng Chua. 2020. Disentangled graph collaborative filtering. In SIGIR, 1001\u20131010.","journal-title":"SIGIR"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015329"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.51"},{"key":"e_1_3_2_43_2","first-page":"2502","article-title":"Efficient bi-level optimization for recommendation denoising","author":"Wang Zongwei","year":"2023","unstructured":"Zongwei Wang, Min Gao, Wentao Li, Junliang Yu, Linxin Guo, and Hongzhi Yin. 2023. Efficient bi-level optimization for recommendation denoising. In KDD, 2502\u20132511.","journal-title":"KDD"},{"key":"e_1_3_2_44_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_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"e_1_3_2_46_2","first-page":"3425","article-title":"Unifying graph convolution and contrastive learning in collaborative filtering","author":"Wu Yihong","year":"2024","unstructured":"Yihong Wu, Le Zhang, Fengran Mo, Tianyu Zhu, Weizhi Ma, and Jian-Yun Nie. 2024. Unifying graph convolution and contrastive learning in collaborative filtering. In KDD, 3425\u20133436.","journal-title":"KDD"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_48_2","first-page":"992","article-title":"Automated self-supervised learning for recommendation","author":"Xia Lianghao","year":"2023","unstructured":"Lianghao Xia, Chao Huang, Chunzhen Huang, Kangyi Lin, Tao Yu, and Ben Kao. 2023. Automated self-supervised learning for recommendation. In WWW, 992\u20131002.","journal-title":"WWW"},{"key":"e_1_3_2_49_2","first-page":"70","article-title":"Hypergraph contrastive collaborative filtering","author":"Xia Lianghao","year":"2022","unstructured":"Lianghao Xia, Chao Huang, Yong Xu, Jiashu Zhao, Dawei Yin, and Jimmy Huang. 2022. Hypergraph contrastive collaborative filtering. In SIGIR, 70\u201379.","journal-title":"SIGIR"},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"4503","DOI":"10.1609\/aaai.v35i5.16578","article-title":"Self-supervised hypergraph convolutional networks for session-based recommendation","volume":"35","author":"Xia Xin","year":"2021","unstructured":"Xin Xia, Hongzhi Yin, Junliang Yu, Qinyong Wang, Lizhen Cui, and Xiangliang Zhang. 2021. Self-supervised hypergraph convolutional networks for session-based recommendation. In AAAI, Vol. 35, 4503\u20134511.","journal-title":"In AAAI"},{"key":"e_1_3_2_51_2","doi-asserted-by":"crossref","first-page":"10745","DOI":"10.1609\/aaai.v37i9.26275","article-title":"Adatask: A task-aware adaptive learning rate approach to multi-task learning","volume":"37","author":"Yang Enneng","year":"2023","unstructured":"Enneng Yang, Junwei Pan, Ximei Wang, Haibin Yu, Li Shen, Xihua Chen, Lei Xiao, Jie Jiang, and Guibing Guo. 2023. Adatask: A task-aware adaptive learning rate approach to multi-task learning. In AAAI, Vol. 37, 10745\u201310753.","journal-title":"In AAAI"},{"key":"e_1_3_2_52_2","first-page":"1434","article-title":"Knowledge graph contrastive learning for recommendation","author":"Yang Yuhao","year":"2022","unstructured":"Yuhao Yang, Chao Huang, Lianghao Xia, and Chenliang Li. 2022. Knowledge graph contrastive learning for recommendation. In SIGIR, 1434\u20131443.","journal-title":"SIGIR"},{"key":"e_1_3_2_53_2","first-page":"1117","article-title":"Generative-contrastive graph learning for recommendation","author":"Yang Yonghui","year":"2023","unstructured":"Yonghui Yang, Zhengwei Wu, Le Wu, Kun Zhang, Richang Hong, Zhiqiang Zhang, Jun Zhou, and Meng Wang. 2023. Generative-contrastive graph learning for recommendation. In SIGIR, 1117\u20131126.","journal-title":"SIGIR"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3288135"},{"key":"e_1_3_2_55_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_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3282907"},{"key":"e_1_3_2_57_2","first-page":"1355","article-title":"Denoising and prompt-tuning for multi-behavior recommendation","author":"Zhang Chi","year":"2023","unstructured":"Chi Zhang, Rui Chen, Xiangyu Zhao, Qilong Han, and Li Li. 2023. Denoising and prompt-tuning for multi-behavior recommendation. In WWW, 1355\u20131363.","journal-title":"WWW"},{"key":"e_1_3_2_58_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_59_2","first-page":"3655","article-title":"RecDCL: Dual contrastive learning for recommendation","author":"Zhang Dan","year":"2024","unstructured":"Dan Zhang, Yangliao Geng, Wenwen Gong, Zhongang Qi, Zhiyu Chen, Xing Tang, Ying Shan, Yuxiao Dong, and Jie Tang. 2024. RecDCL: Dual contrastive learning for recommendation. In WWW, 3655\u20133666.","journal-title":"WWW"},{"key":"e_1_3_2_60_2","doi-asserted-by":"crossref","first-page":"9359","DOI":"10.1609\/aaai.v38i8.28789","article-title":"Temporal graph contrastive learning for sequential recommendation","volume":"38","author":"Zhang Shengzhe","year":"2024","unstructured":"Shengzhe Zhang, Liyi Chen, Chao Wang, Shuangli Li, and Hui Xiong. 2024. Temporal graph contrastive learning for sequential recommendation. In AAAI, Vol. 38, 9359\u20139367.","journal-title":"In AAAI"},{"key":"e_1_3_2_61_2","first-page":"80","article-title":"Geometric disentangled collaborative filtering","author":"Zhang Yiding","year":"2022","unstructured":"Yiding Zhang, Chaozhuo Li, Xing Xie, Xiao Wang, Chuan Shi, Yuming Liu, Hao Sun, Liangjie Zhang, Weiwei Deng, and Qi Zhang. 2022. Geometric disentangled collaborative filtering. In SIGIR, 80\u201390.","journal-title":"SIGIR"},{"key":"e_1_3_2_62_2","doi-asserted-by":"crossref","unstructured":"Yixin Zhang Yong Liu Yonghui Xu Hao Xiong Chenyi Lei Wei He Lizhen Cui and Chunyan Miao. 2022. Enhancing sequential recommendation with graph contrastive learning. arXiv:2205.14837. Retrieved from https:\/\/arxiv.org\/pdf\/2205.14837","DOI":"10.24963\/ijcai.2022\/333"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3070203"},{"key":"e_1_3_2_64_2","first-page":"3854","article-title":"Is contrastive learning necessary? A study of data augmentation vs contrastive learning in sequential recommendation","author":"Zhou Peilin","year":"2024","unstructured":"Peilin Zhou, You-Liang Huang, Yueqi Xie, Jingqi Gao, Shoujin Wang, Jae Boum Kim, and Sunghun Kim. 2024. Is contrastive learning necessary? A study of data augmentation vs contrastive learning in sequential recommendation. In WWW, 3854\u20133863.","journal-title":"WWW"},{"key":"e_1_3_2_65_2","first-page":"1076","article-title":"AdaMCL: Adaptive fusion multi-view contrastive learning for collaborative filtering","author":"Zhu Guanghui","year":"2023","unstructured":"Guanghui Zhu, Wang Lu, Chunfeng Yuan, and Yihua Huang. 2023. AdaMCL: Adaptive fusion multi-view contrastive learning for collaborative filtering. In SIGIR, 1076\u20131085.","journal-title":"SIGIR"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3722103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3722103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:50Z","timestamp":1750272230000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3722103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,9]]},"references-count":64,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5,31]]}},"alternative-id":["10.1145\/3722103"],"URL":"https:\/\/doi.org\/10.1145\/3722103","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,9]]},"assertion":[{"value":"2024-04-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}