Fan Ye , Hongwei Li , Zhangling Duan , Zhaolong Ling
{"title":"Quaternary converter based balanced graph contrastive learning for recommendation","authors":"Fan Ye , Hongwei Li , Zhangling Duan , Zhaolong Ling","doi":"10.1016/j.asoc.2025.113096","DOIUrl":null,"url":null,"abstract":"<div><div>Graph contrastive learning (GCL) has emerged as a highly effective collaborative filtering method for recommender systems in recent years. However, existing collaborative filtering methods based on GCL often excessively prioritize user-side information, leading to inadequate exploration of user–item information. Furthermore, these methods generate contrastive views through data augmentation, which is prone to noise interference. To address these issues, we propose a balanced graph contrastive learning framework (BGCL). Specifically, BGCL incorporates a quaternary converter that introduces negative user based on triples (user, positive item, negative item), to provide the GCL module with embeddings that treat users and items balancedly. Subsequently, BGCL includes a noiseless GCL module that conducts contrastive learning on the embeddings after approximately infinite layers of convolution and the embeddings after k-layer graph convolutional networks to mitigate noise interference. We conducted experiments comparing our algorithm with 15 alternative approaches using real-world datasets, and the results demonstrate that our algorithm outperforms state-of-the-art methods in terms of recommendation accuracy and convergence speed.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"175 ","pages":"Article 113096"},"PeriodicalIF":7.2000,"publicationDate":"2025-04-06","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/S1568494625004077","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
Graph contrastive learning (GCL) has emerged as a highly effective collaborative filtering method for recommender systems in recent years. However, existing collaborative filtering methods based on GCL often excessively prioritize user-side information, leading to inadequate exploration of user–item information. Furthermore, these methods generate contrastive views through data augmentation, which is prone to noise interference. To address these issues, we propose a balanced graph contrastive learning framework (BGCL). Specifically, BGCL incorporates a quaternary converter that introduces negative user based on triples (user, positive item, negative item), to provide the GCL module with embeddings that treat users and items balancedly. Subsequently, BGCL includes a noiseless GCL module that conducts contrastive learning on the embeddings after approximately infinite layers of convolution and the embeddings after k-layer graph convolutional networks to mitigate noise interference. We conducted experiments comparing our algorithm with 15 alternative approaches using real-world datasets, and the results demonstrate that our algorithm outperforms state-of-the-art methods in terms of recommendation accuracy and convergence speed.
期刊介绍:
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.