Negative Samples Selection Can Improve Graph Contrastive Learning in Collaborative Filtering
Authors: 
Yifan Shao, Xu Cai, Fangming Gu, Ximing LiAuthors Info & Claims
Pages 456 - 467
Abstract
Nowadays, graph collaborative filtering is widely used in recommender system as an important technique. In order to alleviate the common data sparsity problem in collaborative filtering, contrastive learning techniques have been utilized to assist the modeling of user-item interaction graphs. However, the existing graph contrastive learning methods in collaborative filtering mainly focus on the construction of the augmented view and the loss function, which ignores the negative samples selection. They treat all other nodes as negative samples in learning process, which may be unreasonable. In fact, if two users have extremely similar preferences, they should not be treated as negative samples of each other.
To address the aforementioned issue, we investigate various techniques for negative samples selection and introduce a graph contrastive learning framework called NSSGCL (Negative Samples Selection Graph Contrast Learning), which consists of two parts. First, we measure the similarity of nodes in terms of both their structure and semantics, and consider nodes that are highly similar in both structure and semantics aspects to be potential positive samples of each other. Second, we propose a debiasing algorithm that utilizes the probability distribution of positive and negative samples to further estimate the actual contribution of the potential positive samples obtained above.
A substantial number of experiments on real datasets demonstrate the effectiveness of our strategy, with our approach achieving a 12% and 14% improvement compared to baseline methods on the ML-1M and Yelp datasets, respectively.
References
[1]
Ricci F, Rokach L, and Shapira B Ricci F, Rokach L, Shapira B, and Kantor PB Introduction to recommender systems handbook Recommender Systems Handbook 2011 Boston Springer 1-35
[2]
Sarwar, B., et al.: Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th International Conference on World Wide Web, pp. 285–295 (2001)
[3]
Wu, J., et al.: Self-supervised graph learning for recommendation. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 726–735 (2021)
[4]
Yao, T., et al.: Self-supervised learning for deep models in recommendations. arXiv preprint arXiv:2007.12865 (2020)
[5]
Cai, X., et al.: LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation. arXiv preprint arXiv:2302.08191 (2023)
[6]
Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1082–1090 (2011)
[7]
Harper FM and Konstan JA The movielens datasets: History and context ACM Trans. Interact. Intell. Syst. (TIIS) 2015 5 4 1-19
[8]
He, X., et al.: 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–648 (2020)
[9]
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., Chua, T.-S.: Neural collaborative filtering. In: Proceedings of the 26th International Conference on World Wide Web, pp. 173–182 (2017)
[10]
Lin, Z., Tian, C., Hou, Y., Zhao, W.X.: Improving graph collaborative filtering with neighborhood-enriched contrastive learning. In: Proceedings of the ACM Web Conference 2022, pp. 2320–2329 (2022)
[11]
van den Oord, A., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)
[12]
Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618 (2012)
[13]
Wang, X., He, X., Wang, M., Feng, F., Chua, T.-S.: Neural graph collaborative filtering. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 165–174 (2019)
[14]
Yang, C., Wu, Q., Jin, J., Gao, X., Pan, J., Chen, G.: Trading hard negatives and true negatives: a debiased contrastive collaborative filtering approach. arXiv preprint arXiv:2204.11752 (2022)
[15]
Yu, J., Yin, H., Xia, X., Chen, T., Cui, L., Nguyen, Q.V.H.: 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–1303 (2022)
[16]
Zhao, W.-X., Chen, J., Wang, P., Gu, Q., Wen, J.-R.: Revisiting alternative experimental settings for evaluating top-n item recommendation algorithms. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 2329–2332 (2020)
[17]
Wang, X., et al.: Disentangled graph collaborative filtering. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval (2020)
[18]
Yu J et al. XSimGCL: towards extremely simple graph contrastive learning for recommendation IEEE Trans. Knowl. Data Eng. 2023 36 2 913-926
[19]
Jiang, Y., Huang, C., Huang, L.: Adaptive graph contrastive learning for recommendation. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 4252–4261 (2023)
[20]
Xia, L., Huang, C., Xu, Y., Zhao, J., Yin, D., Huang, J.: Hypergraph contrastive collaborative filtering. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 70–79 (2022)
Index Terms
- Negative Samples Selection Can Improve Graph Contrastive Learning in Collaborative Filtering
Index terms have been assigned to the content through auto-classification.
Recommendations
Negative samples selecting strategy for graph contrastive learning
AbstractGraph neural networks (GNNs) have emerged as a successful method on graph structured data. Limited by expensive labeled data, contrastive learning has been adopted to the graph domain. In most existing node-level graph contrastive ...
Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
WWW '22: Proceedings of the ACM Web Conference 2022Recently, graph collaborative filtering methods have been proposed as an effective recommendation approach, which can capture users’ preference over items by modeling the user-item interaction graphs. Despite the effectiveness, these methods suffer from ...
AdaMCL: Adaptive Fusion Multi-View Contrastive Learning for Collaborative Filtering
SIGIR '23: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information RetrievalGraph collaborative filtering has achieved great success in capturing users' preferences over items. Despite effectiveness, graph neural network (GNN)-based methods suffer from data sparsity in real scenarios. Recently, contrastive learning (CL) has been ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Aug 2024
535 pages
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 05 August 2024
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in