{"title":"Social-aware graph contrastive learning for recommender systems","authors":"Yuanyuan Zhang, Junwu Zhu, Yonglong Zhang, Yi Zhu, Jialuo Zhou, Yaling Xie","doi":"10.1016/j.asoc.2024.111558","DOIUrl":null,"url":null,"abstract":"<div><p>Recommender systems usually encounter the issue of sparse interaction data, which is commonly alleviated by social recommendation models based on graph neural networks. However, these models overlook the collaborative similarity relationship among items and fail to effectively integrate and process various graph structures. To address these issues, we propose a novel <strong>S</strong>ocial-aware <strong>G</strong>raph <strong>C</strong>ontrastive <strong>L</strong>earning <strong>R</strong>ecommendation model (SG-CLR). Specifically, we initially utilize data augmentation techniques to obtain different augmented views of user–item interaction. Secondly, a social-aware encoder is put forward to effectively capture both the influence diffusing within the social network and the attractiveness of items among the item collaborative similarity graph. Finally, we employ graph contrastive learning to maximize the consistency of node representation across different augmented views, and further focus on domain-shared information through joint training. Experimental results conducted on two real-world datasets demonstrate that the proposed SG-CLR outperforms the state-of-the-art baselines. Compared to the best baseline, SG-CLR improves the performance on the two datasets by 3.069% and 2.972%, respectively.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"158 ","pages":"Article 111558"},"PeriodicalIF":6.6000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624003326","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Recommender systems usually encounter the issue of sparse interaction data, which is commonly alleviated by social recommendation models based on graph neural networks. However, these models overlook the collaborative similarity relationship among items and fail to effectively integrate and process various graph structures. To address these issues, we propose a novel Social-aware Graph Contrastive Learning Recommendation model (SG-CLR). Specifically, we initially utilize data augmentation techniques to obtain different augmented views of user–item interaction. Secondly, a social-aware encoder is put forward to effectively capture both the influence diffusing within the social network and the attractiveness of items among the item collaborative similarity graph. Finally, we employ graph contrastive learning to maximize the consistency of node representation across different augmented views, and further focus on domain-shared information through joint training. Experimental results conducted on two real-world datasets demonstrate that the proposed SG-CLR outperforms the state-of-the-art baselines. Compared to the best baseline, SG-CLR improves the performance on the two datasets by 3.069% and 2.972%, respectively.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.