TY - GEN
T1 - Towards Graph Contrastive Learning for Recommendation with Sampling Embedding Perturbation
AU - Chen, Gang
AU - Li, Jianmin
AU - Ma, Ying
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Nowadays, graph collaborative filtering is the most practical and classical method for recommender systems, which learns user preferences through historical interactions between users and items. The recent combination of contrastive learning and recommender systems has led to a continuous improvement in the performance of graph collaborative filtering. A variety of data augmentation methods have also emerged. However, some graph augmentation methods are proven to lose graph information, such as the way of dropout on the graph structure. Inspired by different adversarial samples and different data augmentation methods, we adopt the method of adding interference patterns to the embedding space, as opposed to other models, we take a partial sampling of the embedding and then add the partially sampled data into the embedding, thus forming different sub-views. The extensive experimental results show that our experiments can improve the performance of the model more compared to other contrastive learning methods with our data enhancement method.
AB - Nowadays, graph collaborative filtering is the most practical and classical method for recommender systems, which learns user preferences through historical interactions between users and items. The recent combination of contrastive learning and recommender systems has led to a continuous improvement in the performance of graph collaborative filtering. A variety of data augmentation methods have also emerged. However, some graph augmentation methods are proven to lose graph information, such as the way of dropout on the graph structure. Inspired by different adversarial samples and different data augmentation methods, we adopt the method of adding interference patterns to the embedding space, as opposed to other models, we take a partial sampling of the embedding and then add the partially sampled data into the embedding, thus forming different sub-views. The extensive experimental results show that our experiments can improve the performance of the model more compared to other contrastive learning methods with our data enhancement method.
KW - Contrastive Learning
KW - Data Augmentation
KW - Graph Embedding Learning
KW - Recommendation system
UR - https://www.scopus.com/pages/publications/85158946790
U2 - 10.1109/NNICE58320.2023.10105711
DO - 10.1109/NNICE58320.2023.10105711
M3 - 会议稿件
AN - SCOPUS:85158946790
T3 - 2023 3rd International Conference on Neural Networks, Information and Communication Engineering, NNICE 2023
SP - 57
EP - 60
BT - 2023 3rd International Conference on Neural Networks, Information and Communication Engineering, NNICE 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd International Conference on Neural Networks, Information and Communication Engineering, NNICE 2023
Y2 - 24 February 2023 through 26 February 2023
ER -