Bilateral Unsymmetrical Graph Contrastive Learning for Recommendation (2403.15075v1)
Abstract: Recent methods utilize graph contrastive Learning within graph-structured user-item interaction data for collaborative filtering and have demonstrated their efficacy in recommendation tasks. However, they ignore that the difference relation density of nodes between the user- and item-side causes the adaptability of graphs on bilateral nodes to be different after multi-hop graph interaction calculation, which limits existing models to achieve ideal results. To solve this issue, we propose a novel framework for recommendation tasks called Bilateral Unsymmetrical Graph Contrastive Learning (BusGCL) that consider the bilateral unsymmetry on user-item node relation density for sliced user and item graph reasoning better with bilateral slicing contrastive training. Especially, taking into account the aggregation ability of hypergraph-based graph convolutional network (GCN) in digging implicit similarities is more suitable for user nodes, embeddings generated from three different modules: hypergraph-based GCN, GCN and perturbed GCN, are sliced into two subviews by the user- and item-side respectively, and selectively combined into subview pairs bilaterally based on the characteristics of inter-node relation structure. Furthermore, to align the distribution of user and item embeddings after aggregation, a dispersing loss is leveraged to adjust the mutual distance between all embeddings for maintaining learning ability. Comprehensive experiments on two public datasets have proved the superiority of BusGCL in comparison to various recommendation methods. Other models can simply utilize our bilateral slicing contrastive learning to enhance recommending performance without incurring extra expenses.
- “A hybrid collaborative filtering model with deep structure for recommender systems” In Proceedings of the AAAI Conference on artificial intelligence 31.1, 2017
- “A survey on knowledge graph-based recommender systems” In IEEE Transactions on Knowledge and Data Engineering 34.8 IEEE, 2020, pp. 3549–3568
- “Deep residual learning for image recognition” In Proceedings of the IEEE conference on computer vision and pattern recognition, 2016, pp. 770–778
- “Fast matrix factorization for online recommendation with implicit feedback” In Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016, pp. 549–558
- “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, 2020, pp. 639–648
- “Online purchase prediction via multi-scale modeling of behavior dynamics” In Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, 2019, pp. 2613–2622
- “Grouplens: Applying collaborative filtering to usenet news” In Communications of the ACM 40.3 ACM New York, NY, USA, 1997, pp. 77–87
- Andriy Mnih and Russ R Salakhutdinov “Probabilistic matrix factorization” In Advances in neural information processing systems 20, 2007
- Aaron van den Oord, Yazhe Li and Oriol Vinyals “Representation learning with contrastive predictive coding” In arXiv preprint arXiv:1807.03748, 2018
- “SSLRec: A Self-Supervised Learning Library for Recommendation” In arXiv preprint arXiv:2308.05697, 2023
- “Grouplens: An open architecture for collaborative filtering of netnews” In Proceedings of the 1994 ACM conference on Computer supported cooperative work, 1994, pp. 175–186
- “Item-based collaborative filtering recommendation algorithms” In Proceedings of the 10th international conference on World Wide Web, 2001, pp. 285–295
- “Neural graph collaborative filtering” In Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval, 2019, pp. 165–174
- “Self-supervised graph learning for recommendation” In Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, 2021, pp. 726–735
- Lianghao Xia, Chao Huang and Chuxu Zhang “Self-supervised hypergraph transformer for recommender systems” In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2022, pp. 2100–2109
- “Hypergraph contrastive collaborative filtering” In Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval, 2022, pp. 70–79
- “Contrastive learning for sequential recommendation” In 2022 IEEE 38th international conference on data engineering (ICDE), 2022, pp. 1259–1273 IEEE
- “Self-supervised learning for deep models in recommendations” In arXiv preprint arXiv:2007.12865, 2020
- “Self-supervised learning for large-scale item recommendations” In Proceedings of the 30th ACM International Conference on Information & Knowledge Management, 2021, pp. 4321–4330
- “Social influence-based group representation learning for group recommendation” In 2019 IEEE 35th International Conference on Data Engineering (ICDE), 2019, pp. 566–577 IEEE
- “Adaptive implicit friends identification over heterogeneous network for social recommendation” In Proceedings of the 27th ACM international conference on information and knowledge management, 2018, pp. 357–366
- “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, 2022, pp. 1294–1303
- “Generating reliable friends via adversarial training to improve social recommendation” In 2019 IEEE international conference on data mining (ICDM), 2019, pp. 768–777 IEEE
- “Self-supervised learning for recommender systems: A survey” In IEEE Transactions on Knowledge and Data Engineering IEEE, 2023
- “Self-supervised multi-channel hypergraph convolutional network for social recommendation” In Proceedings of the web conference 2021, 2021, pp. 413–424
- “Contrastive learning for debiased candidate generation in large-scale recommender systems” In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, 2021, pp. 3985–3995
- “S3-rec: Self-supervised learning for sequential recommendation with mutual information maximization” In Proceedings of the 29th ACM international conference on information & knowledge management, 2020, pp. 1893–1902