{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T14:33:54Z","timestamp":1775226834101,"version":"3.50.1"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T00:00:00Z","timestamp":1687910400000},"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":["61702264, 62076130"],"award-info":[{"award-number":["61702264, 62076130"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Open Research Project of State Key Laboratory of Novel Software Technology","award":["KFKT2022B28"],"award-info":[{"award-number":["KFKT2022B28"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2023,9,30]]},"abstract":"<jats:p>Exploiting social networks is expected to enhance the performance of recommender systems when interaction information is sparse. Existing social recommendation models focus on modeling multi-graph structures and then aggregating the information from these multiple graphs to learn potential user preferences. However, these methods often employ complex models and redundant parameters to get a slight performance improvement. Contrastive learning has been widely researched as an effective paradigm in the area of recommendation. Most existing contrastive learning-based models usually focus on constructing multi-graph structures to perform graph augmentation for contrastive learning. However, the effect of graph augmentation on contrastive learning is inconclusive. In view of these challenges, in this work, we propose a contrastive learning based graph convolution network for social recommendation (CLSR), which integrates information from both the social graph and the interaction graph. First, we propose a fusion-simplified method to combine the social graph and the interaction graph. Technically, on the basis of exploring users\u2019 interests by interaction graph, we further exploit social connections to alleviate data sparsity. By combining the user embeddings learned through two graphs in a certain proportion, we can obtain user representation at a finer granularity. Meanwhile, we introduce a contrastive learning framework for multi-graph network modeling, where we explore the feasibility of constructing positive and negative samples of contrastive learning by conducting data augmentation on embedding representations. Extensive experiments verify the superiority of CLSR\u2019s contrastive learning framework and fusion-simplified method of integrating social relations.<\/jats:p>","DOI":"10.1145\/3587268","type":"journal-article","created":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T11:49:45Z","timestamp":1678535385000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Contrastive Learning Based Graph Convolution Network for Social Recommendation"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5735-617X","authenticated-orcid":false,"given":"Jiabo","family":"Zhuang","sequence":"first","affiliation":[{"name":"School of Cyber Science and Engineering, Nanjing University of Science and Technology"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6173-9787","authenticated-orcid":false,"given":"Shunmei","family":"Meng","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Nanjing University of Science and Technology, State Key Lab. for Novel Software Technology, Nanjing University"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2541-4923","authenticated-orcid":false,"given":"Jing","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4960-174X","authenticated-orcid":false,"given":"Victor S.","family":"Sheng","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Texas Tech University"}]}],"member":"320","published-online":{"date-parts":[[2023,6,28]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00156"},{"key":"e_1_3_1_3_2","unstructured":"Lars Buitinck Gilles Louppe Mathieu Blondel Fabian Pedregosa Andreas Mueller Olivier Grisel Vlad Niculae Peter Prettenhofer Alexandre Gramfort Jaques Grobler Robert Layton Jake VanderPlas Arnaud Joly Brian Holt and Ga\u00ebl Varoquaux. 2013. API design for machine learning software: Experiences from the scikit-learn project. arXiv:1309.0238. Retrieved from https:\/\/arxiv.org\/abs\/1309.0238."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462968"},{"key":"e_1_3_1_5_2","series-title":"Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event","first-page":"1597","volume":"119","author":"Chen Ting","year":"2020","unstructured":"Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey E. Hinton. 2020. A simple framework for contrastive learning of visual representations. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event (Proceedings of Machine Learning Research, Vol. 119). PMLR, 1597\u20131607. Retrieved from http:\/\/proceedings.mlr.press\/v119\/chen20j.html"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963776"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403253"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2300487"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01437"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.733"},{"key":"e_1_3_1_13_2","unstructured":"Dongsheng Luo Yuchen Bian Xiang Zhang and Jun Huan. 2020. Attentive social recommendation: Towards user and item diversities. arXiv:2011.04797. Retrieved from https:\/\/arxiv.org\/abs\/2011.04797."},{"key":"e_1_3_1_14_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. Jeff A. Bilmes and Andrew Y. Ng (Eds.), AUAI Press, 452\u2013461. Retrieved from https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1630&proceeding_id=25."},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0141-9"},{"key":"e_1_3_1_16_2","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."},{"key":"e_1_3_1_17_2","unstructured":"A\u00e4ron van den Oord Yazhe Li and Oriol Vinyals. 2018. Representation learning with contrastive predictive coding. arXiv:1807.03748. Retrieved from https:\/\/arxiv.org\/abs\/1807.03748."},{"key":"e_1_3_1_18_2","volume-title":"Proceedings of the 6th International Conference on Learning Representations, ICLR 2018","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In Proceedings of the 6th International Conference on Learning Representations, ICLR 2018. OpenReview.net. Retrieved from https:\/\/openreview.net\/forum?id=rJXMpikCZ."},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148257"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.21105\/joss.03021"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557583"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.TKDE.2020.3048414"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481952"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467340"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449844"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531937"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557680"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW51313.2020.00041"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3587268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3587268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:36:38Z","timestamp":1750282598000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3587268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,28]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,9,30]]}},"alternative-id":["10.1145\/3587268"],"URL":"https:\/\/doi.org\/10.1145\/3587268","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,28]]},"assertion":[{"value":"2022-08-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-06","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}