{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:04:26Z","timestamp":1777705466042,"version":"3.51.4"},"reference-count":43,"publisher":"SAGE Publications","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2024,4,3]]},"abstract":"<jats:p>Recently, Graph Neural Networks (GNNs) using aggregating neighborhood collaborative information have shown effectiveness in recommendation. However, GNNs-based models suffer from over-smoothing and data sparsity problems. Due to its self-supervised nature, contrastive learning has gained considerable attention in the field of recommendation, aiming at alleviating highly sparse data. Graph contrastive learning models are widely used to learn the consistency of representations by constructing different graph augmentation views. Most current graph augmentation with random perturbation destroy the original graph structure information, which mislead embeddings learning. In this paper, an effective graph contrastive learning paradigm CollaGCL is proposed, which constructs graph augmentation by using singular value decomposition to preserve crucial structure information. CollaGCL enables perturbed views to effectively capture global collaborative information, mitigating the negative impact of graph structural perturbations. To optimize the contrastive learning task, the extracted meta-knowledge was propagate throughout the original graph to learn reliable embedding representations. The self-information learning between views enhances the semantic information of nodes, thus alleviating the problem of over-smoothing. Experimental results on three real-world datasets demonstrate the significant improvement of CollaGCL over state-of-the-art methods.<\/jats:p>","DOI":"10.3233\/jifs-236497","type":"journal-article","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T11:47:26Z","timestamp":1712317646000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative graph contrastive learning for recommendation"],"prefix":"10.1177","author":[{"given":"Tao","family":"Wei","sequence":"first","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Aliyun School of Big Data, School of Software, Changzhou University, Changzhou, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changchun","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Microelectronics and Control Engineering, Changzhou University, Changzhou, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanqi","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Aliyun School of Big Data, School of Software, Changzhou University, Changzhou, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingxue","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Aliyun School of Big Data, School of Software, Changzhou University, Changzhou, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"2","key":"10.3233\/JIFS-236497_ref1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/090771806","article-title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","volume":"53","author":"Halko","year":"2011","journal-title":"SIAM Review"},{"key":"10.3233\/JIFS-236497_ref2","first-page":"1","article-title":"Auto-encoding variational Bayes","volume":"1050","author":"Kingma","year":"2014","journal-title":"Stat"},{"key":"10.3233\/JIFS-236497_ref3","first-page":"21","article-title":"Variational graph auto-encoders","volume":"1050","author":"Kipf","year":"2016","journal-title":"Stat"},{"key":"10.3233\/JIFS-236497_ref4","first-page":"2017","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","journal-title":"International Conference on Learning Representations (ICLR)"},{"key":"10.3233\/JIFS-236497_ref5","first-page":"1309","article-title":"A hybrid collaborative filtering model with deep structure for recommender systems","author":"Dong","year":"2017","journal-title":"Proceedings of the AAAI Conference on artificial intelligence"},{"key":"10.3233\/JIFS-236497_ref6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/3038912.3052569","article-title":"Neural collaborative filtering","author":"He","year":"2017","journal-title":"Proceedings of the 26th international conference on world wide web"},{"key":"10.3233\/JIFS-236497_ref7","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1145\/3178876.3186150","article-title":"Variational autoencoders for collaborative filtering","author":"Liang","year":"2018","journal-title":"Proceedings of the 2018 world wide web conference"},{"key":"10.3233\/JIFS-236497_ref8","first-page":"3538","article-title":"Deeper insights into graph convolutional networks for semi-supervised learning","author":"Li","year":"2018","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"10.3233\/JIFS-236497_ref9","doi-asserted-by":"crossref","first-page":"2613","DOI":"10.1145\/3292500.3330790","article-title":"Online purchase prediction via multi-scale modeling of behavior dynamics","author":"Huang","year":"2019","journal-title":"Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining"},{"key":"10.3233\/JIFS-236497_ref10","first-page":"165","article-title":"Neural graph collaborative filtering","author":"Wang","year":"2019","journal-title":"Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval"},{"key":"10.3233\/JIFS-236497_ref11","first-page":"9267","article-title":"Deepgcns: Can gcns go as deep as cnns?","author":"Li","year":"2019","journal-title":"Proceedings of the IEEE\/CVF international conference on computer vision"},{"issue":"1","key":"10.3233\/JIFS-236497_ref12","doi-asserted-by":"crossref","first-page":"2","DOI":"10.3390\/technologies9010002","article-title":"A survey on contrastive self-supervised learning","volume":"9","author":"Jaiswal","year":"2020","journal-title":"Technologies"},{"key":"10.3233\/JIFS-236497_ref13","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","author":"Chen","year":"2020","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"10.3233\/JIFS-236497_ref14","first-page":"4917","article-title":"Towards deeper graph neural networks with differentiable group normalization","volume":"33","author":"Zhou","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.3233\/JIFS-236497_ref15","first-page":"1893","article-title":"S3-rec: Self-supervised learning for sequential recommendation with mutual information maximization","author":"Zhou","year":"2020","journal-title":"Proceedings of the 29th ACM international conference on information & knowledge management"},{"key":"10.3233\/JIFS-236497_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-018-1254-2","article-title":"Scalability and sparsity issues in recommender datasets: a survey","volume":"62","author":"Singh","year":"2020","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/JIFS-236497_ref17","first-page":"89","article-title":"Sequential recommendation with self-attentive multi-adversarial network","author":"Ren","year":"2020","journal-title":"Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval"},{"key":"10.3233\/JIFS-236497_ref18","first-page":"639","article-title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","author":"He","year":"2020","journal-title":"Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval"},{"key":"10.3233\/JIFS-236497_ref19","first-page":"1001","article-title":"Disentangled graph collaborative filtering","author":"Wang","year":"2020","journal-title":"Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval"},{"key":"10.3233\/JIFS-236497_ref20","first-page":"14498","article-title":"Scattering gcn: Overcoming oversmoothness in graph convolutional networks","volume":"33","author":"Min","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.3233\/JIFS-236497_ref21","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.3233\/JIFS-236497_ref22","first-page":"726","article-title":"Self-supervised graph learning for recommendation","author":"Wu","year":"2021","journal-title":"Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval"},{"key":"10.3233\/JIFS-236497_ref23","doi-asserted-by":"crossref","first-page":"4486","DOI":"10.1609\/aaai.v35i5.16576","article-title":"Knowledge-enhanced hierarchical graph transformer network for multi-behavior recommendation","author":"Xia","year":"2021","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"10.3233\/JIFS-236497_ref24","doi-asserted-by":"crossref","first-page":"6894","DOI":"10.18653\/v1\/2021.emnlp-main.552","article-title":"SimCSE: Simple Contrastive Learning of Sentence Embeddings","author":"Gao","year":"2021","journal-title":"Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing"},{"key":"10.3233\/JIFS-236497_ref25","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/3437963.3441800","article-title":"Denoising implicit feedback for recommendation","author":"Wang","year":"2021","journal-title":"Proceedings of the 14th ACM international conference on web search and data mining"},{"key":"10.3233\/JIFS-236497_ref26","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1145\/3442381.3449908","article-title":"Task-adaptive neural process for user cold-start recommendation","author":"Lin","year":"2021","journal-title":"Proceedings of the Web Conference 2021"},{"issue":"1","key":"10.3233\/JIFS-236497_ref27","first-page":"857","article-title":"Self-supervised learning: Generative or contrastive","volume":"35","author":"Liu","year":"2021","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/JIFS-236497_ref28","doi-asserted-by":"crossref","first-page":"4503","DOI":"10.1609\/aaai.v35i5.16578","article-title":"Self-supervised hypergraph convolutional networks for session-based recommendation","author":"Xia","year":"2021","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"10.3233\/JIFS-236497_ref29","first-page":"70","article-title":"Hypergraph contrastive collaborative filtering","author":"Xia","year":"2022","journal-title":"Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval"},{"key":"10.3233\/JIFS-236497_ref30","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1145\/3485447.3512156","article-title":"Simgrace: A simple framework for graph contrastive learning without data augmentation","author":"Xia","year":"2022","journal-title":"Proceedings of the ACM Web Conference 2022"},{"key":"10.3233\/JIFS-236497_ref31","first-page":"1294","article-title":"Are graph augmentations necessary? simple graph contrastive learning for recommendation","author":"Yu","year":"2022","journal-title":"Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval"},{"key":"10.3233\/JIFS-236497_ref32","first-page":"1625","article-title":"SVD-GCN: A simplified graph convolution paradigm for recommendation","author":"Peng","year":"2022","journal-title":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management"},{"issue":"5","key":"10.3233\/JIFS-236497_ref33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3535101","article-title":"Graph neural networks in recommender systems: a survey","volume":"55","author":"Wu","year":"2022","journal-title":"ACM Computing Surveys"},{"key":"10.3233\/JIFS-236497_ref34","first-page":"2022","article-title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation","author":"Cai","journal-title":"The Eleventh International Conference on Learning Representations"},{"key":"10.3233\/JIFS-236497_ref35","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1109\/ICDE53745.2022.00099","article-title":"Contrastive learning for sequential recommendation","author":"Xie","year":"2022","journal-title":"2022 IEEE 38th international conference on data engineering (ICDE)"},{"key":"10.3233\/JIFS-236497_ref36","doi-asserted-by":"crossref","first-page":"8892","DOI":"10.1609\/aaai.v36i8.20871","article-title":"Autogcl: Automated graph contrastive learning via learnable view generators","author":"Yin","year":"2022","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"10.3233\/JIFS-236497_ref37","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1145\/3485447.3512104","article-title":"Improving graph collaborative filtering with neighborhood-enriched contrastive learning","author":"Lin","year":"2022","journal-title":"Proceedings of the ACM Web Conference 2022"},{"key":"10.3233\/JIFS-236497_ref38","first-page":"1680","article-title":"Graph Transformer for Recommendation","author":"Li","year":"2023","journal-title":"Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval"},{"key":"10.3233\/JIFS-236497_ref39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TKDE.2023.3288135","article-title":"XSimGCL: Towards extremely simple graph contrastive learning for recommendation","author":"Yu","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/JIFS-236497_ref40","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/3543507.3583196","article-title":"Graph-less collaborative filtering","author":"Xia","year":"2023","journal-title":"Proceedings of the ACM Web Conference 2023"},{"key":"10.3233\/JIFS-236497_ref41","first-page":"4252","article-title":"Adaptive graph contrastive learning for recommendation","author":"Jiang","year":"2023","journal-title":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"},{"key":"10.3233\/JIFS-236497_ref42","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1145\/3543507.3583361","article-title":"Debiased Contrastive Learning for Sequential Recommendation","author":"Yang","year":"2023","journal-title":"Proceedings of the ACM Web Conference 2023"},{"key":"10.3233\/JIFS-236497_ref43","first-page":"922","article-title":"Contrastive state augmentations for reinforcement learning-based recommender systems","author":"Ren","year":"2023","journal-title":"Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-236497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:53Z","timestamp":1777455833000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-236497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,3]]},"references-count":43,"URL":"https:\/\/doi.org\/10.3233\/jifs-236497","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,3]]}}}