{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:41:30Z","timestamp":1773160890689,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Natural Science Basic Research Program of Shaanxi","award":["2023-JC-YB-568"],"award-info":[{"award-number":["2023-JC-YB-568"]}]},{"name":"Scientific Research Program Funded by Shaanxi Provincial Education Department","award":["22JP028"],"award-info":[{"award-number":["22JP028"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the field of recommendation algorithms, the representation learning for users and items has evolved from using single IDs or historical interactions to utilizing higher-order neighbors. This can be achieved by modeling the user\u2013item interaction graph to capture user preferences for items. Despite the promising results achieved by these algorithms, they still suffer from the issue of data sparsity. In order to mitigate the impact of data sparsity, contrastive learning has been adopted in graph collaborative filtering to enhance performance. However, current recommendation algorithms using contrastive learning yield uneven representations after data augmentation and do not consider the potential relationships among users (or items). To address these challenges, we propose a graph neural network-based recommendation model that integrates contrastive learning (GNNCL). This model combines data augmentation with added noise and the exploration of semantic neighbors for nodes. For the structural neighbors on the interaction graph, we introduce a novel and straightforward contrastive learning approach, abandoning previous graph augmentation methods, and introducing uniform noise into the embedding space to create contrastive views. To unearth potential semantic neighbor relationships in the semantic space, we assume that users with similar representations possess semantic neighbor relationships and merge these semantic neighbors into the prototype contrastive learning. We utilize a clustering algorithm to obtain prototypes for users and items and employ the EM algorithm for prototype contrastive learning. Experimental results validate the effectiveness of our approach. Particularly, on the Yelp2018 and Amazon-book datasets, our method exhibits significant performance improvements compared to basic graph collaborative filtering models.<\/jats:p>","DOI":"10.1007\/s11063-024-11545-9","type":"journal-article","created":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T12:02:21Z","timestamp":1708084941000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["GNNCL: A Graph Neural Network Recommendation Model Based on Contrastive Learning"],"prefix":"10.1007","volume":"56","author":[{"given":"Jinguang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jiahe","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Lili","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,16]]},"reference":[{"issue":"1","key":"11545_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3390\/technologies9010002","volume":"9","author":"A Jaiswal","year":"2020","unstructured":"Jaiswal A, Babu AR, Zadeh MZ, Banerjee D, Makedon F (2020) A survey on contrastive self-supervised learning. Technologies 9(1):2. https:\/\/doi.org\/10.3390\/technologies9010002","journal-title":"Technologies"},{"key":"11545_CR2","first-page":"18661","volume":"33","author":"P Khosla","year":"2020","unstructured":"Khosla P, Teterwak P, Wang C, Sarna A, Tian Y, Isola P, Maschinot A, Liu C, Krishnan D (2020) Supervised contrastive learning. Adv Neural Inf Process Syst 33:18661\u201318673","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"11545_CR3","first-page":"857","volume":"35","author":"X Liu","year":"2023","unstructured":"Liu X, Zhang F, Hou Z, Mian L, Wang Z, Zhang J, Tang J (2023) Self-supervised learning: generative or contrastive. IEEE Trans Knowl Data Eng 35(1):857\u2013876","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"11545_CR4","unstructured":"Chen T, Kornblith S, Norouzi M, Hinton G (2020) A simple framework for contrastive learning of visual representations. In: International conference on machine learning. PMLR, pp 1597\u20131607"},{"key":"11545_CR5","doi-asserted-by":"publisher","first-page":"56952","DOI":"10.1109\/ACCESS.2022.3177272","volume":"10","author":"T Gao","year":"2022","unstructured":"Gao T, Yao X, Chen D (2022) Simcse: simple contrastive learning of sentence embeddings. IEEE Access 10:56952\u201356960. https:\/\/doi.org\/10.1109\/ACCESS.2022.3177272","journal-title":"IEEE Access"},{"key":"11545_CR6","doi-asserted-by":"crossref","unstructured":"Wu J, Wang X, Feng F, He X, Chen L, Lian J, Xie X (2021) Selfsupervised graph learning for recommendation. In: Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, pp 726\u2013735","DOI":"10.1145\/3404835.3462862"},{"key":"11545_CR7","first-page":"5812","volume":"33","author":"Y You","year":"2020","unstructured":"You Y, Chen T, Sui Y, Chen T, Wang Z, Shen Y (2020) Graph contrastive learning with augmentations. Adv Neural Inf Process Syst 33:5812\u20135823","journal-title":"Adv Neural Inf Process Syst"},{"key":"11545_CR8","doi-asserted-by":"crossref","unstructured":"Yu J, Yin H, Xia X, Chen T, Cui L, Nguyen QVH (2022) Are graph augmentations necessary? Simple graph contrastive learning for recommendation. In: Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, pp 1294\u20131303","DOI":"10.1145\/3477495.3531937"},{"key":"11545_CR9","unstructured":"Oord A, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. arXiv preprint https:\/\/arxiv.org\/abs\/1807.03748"},{"key":"11545_CR10","unstructured":"Chen J, Dong H, Wang X, Feng F, Wang M, He X (2020) Bias and debias in recommender system: a survey and future directions. arXiv preprint https:\/\/arxiv.org\/abs\/2010.03240"},{"key":"11545_CR11","doi-asserted-by":"crossref","unstructured":"Sarwar B, Karypis G, Konstan J, Riedl J (2001) Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th international conference on World Wide Web, pp 285\u2013295","DOI":"10.1145\/371920.372071"},{"key":"11545_CR12","doi-asserted-by":"crossref","unstructured":"Sun J, Zhang Y, Ma C, Coates M, Guo H, Tang R, He X (2019) Multigraph convolution collaborative filtering. In: IEEE international conference on data mining (ICDM), pp 1306\u20131311","DOI":"10.1109\/ICDM.2019.00165"},{"key":"11545_CR13","doi-asserted-by":"crossref","unstructured":"Wu L, Sun P, Fu Y, Hong R, Wang X, Wang M (2019) A neural influence diffusion model for social recommendation. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval, pp 235\u2013244","DOI":"10.1145\/3331184.3331214"},{"key":"11545_CR14","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. In: International conference on machine learning, pp 1263\u20131272"},{"key":"11545_CR15","volume-title":"Advances in neural information processing systems","author":"W Hamilton","year":"2017","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Guyon I, Von Luxburg U, Bengio S, Wallach H, Fergus R, Vishwanathan S, Garnett R (eds) Advances in neural information processing systems, vol 30. Curran Associates Inc, New York"},{"key":"11545_CR16","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint https:\/\/arxiv.org\/abs\/1710.10903"},{"key":"11545_CR17","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018) How powerful are graph neural networks? arXiv preprint https:\/\/arxiv.org\/abs\/1810.00826"},{"key":"11545_CR18","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) Lightgcn: simplifying and powering graph convolution network for recommendation. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval, pp 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"key":"11545_CR19","unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme LB (2014) Bayesian personalized ranking from implicit feedback. In: Proceeding of uncertainty in artificial intelligence, pp 452\u2013461"},{"key":"11545_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3191086","author":"S Lin","year":"2022","unstructured":"Lin S, Zhou P, Hu Z-Y, Wang S, Zhao R, Zheng Y, Lin L, Xing E, Liang X (2022) Prototypical graph contrastive learning. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2022.3191086","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"11545_CR21","doi-asserted-by":"crossref","unstructured":"Zhao WX, Mu S, Hou Y, Lin Z, Chen Y, Pan X, Li K, Lu Y, Wang H, Tian C et al (2021) Recbole: towards a unified, comprehensive and efficient framework for recommendation algorithms. In: Proceedings of the 30th ACM international conference on information and knowledge management, pp 4653\u20134664","DOI":"10.1145\/3459637.3482016"},{"key":"11545_CR22","unstructured":"Glorot X, Bengio Y (2010) Understanding the difficulty of training deep feedforward neural networks. In: Proceedings of the 13th international conference on artificial intelligence and statistics. JMLR workshop and conference proceedings, pp 249\u2013256"},{"key":"11545_CR23","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Wang M, Feng F, Chua T-S (2019) Neural graph collaborative filtering. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval, pp 165\u2013174","DOI":"10.1145\/3331184.3331267"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11545-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-024-11545-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11545-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T20:20:09Z","timestamp":1715890809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-024-11545-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,16]]},"references-count":23,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["11545"],"URL":"https:\/\/doi.org\/10.1007\/s11063-024-11545-9","relation":{},"ISSN":["1573-773X"],"issn-type":[{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,16]]},"assertion":[{"value":"19 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"45"}}