Distribution-aware hybrid noise augmentation in graph contrastive learning for recommendation

被引:4
作者
Zhu, Kuiyu [1 ]
Qin, Tao [1 ]
Wang, Xin [1 ]
Liu, Zhaoli [2 ]
Wang, Chenxu [1 ,3 ]
机构
[1] Jiaotong Univ, MOE Key Lab Intelligent & Networks Secur, Xian 710049, Peoples R China
[2] Xian Univ Technol, Sch Comp Sci & Engn, Xian 710048, Peoples R China
[3] Xi An Jiao Tong Univ, Sch Software Engn, Xian 710049, Peoples R China
关键词
Recommender systems; Graph contrastive learning; Data distribution; Noise augmentation;
D O I
10.1016/j.eswa.2024.125118
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The recommender systems are one of the most effective big data tools for solving the information overload problem, but data sparsity greatly affects its performance. However, most of the existing graph-based contrastive learning methods perturb the original graph structure for data augmentation, which may lead to semantic loss and subsequently degrade the recommendation performance. Meanwhile, studies have shown that improving the uniformity of data distribution is more effective than data augmentation using graph perturbation. In this paper, to enhance the uniformity of data distribution, we propose D istribution-Aware A ware H ybrid N oise augmentation in graph contrastive learning for Rec ommendation (DAHNRec). Specifically, we design distribution-aware hybrid noise augmentation (DAHN) method to generate noise suitable for the users and items, instead of simply utilizing random noise following uniform distributions. By applying DAHN, the model can learn the appropriate noise distribution during the training process to enhance the uniformity of the embedding space. Additionally, we propose Balanced Bayesian Personalized Ranking (BBPR) as the loss function for recommendation tasks to improve difference characterizing between positive and negative samples. This improves the ranking tasks' performance. Furthermore, we conduct extensive experiments based on public benchmark datasets. The results indicate that DAHNRec outperforms several existing methods. Furthermore, DAHNRec is a general recommendation model based on user-item interactions, which can be used to improve the recommendation performance in various real-world scenarios, such as e-commerce platforms and social media.
引用
收藏
页数:15
相关论文
共 55 条
[1]  
Chen T, 2020, PR MACH LEARN RES, V119
[2]   AIR: Attentional Intention-Aware Recommender Systems [J].
Chen, Tong ;
Yin, Hongzhi ;
Chen, Hongxu ;
Yan, Rui ;
Quoc Viet Hung Nguyen ;
Li, Xue .
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, :304-315
[3]   Deep feature learning with relative distance comparison for person re-identification [J].
Ding, Shengyong ;
Lin, Liang ;
Wang, Guangrun ;
Chao, Hongyang .
PATTERN RECOGNITION, 2015, 48 (10) :2993-3003
[4]  
Dong X, 2017, AAAI CONF ARTIF INTE, P1309
[5]   Graph attention-based collaborative filtering for user-specific recommender system using knowledge graph and deep neural networks [J].
Elahi, Ehsan ;
Halim, Zahid .
KNOWLEDGE AND INFORMATION SYSTEMS, 2022, 64 (09) :2457-2480
[6]   ClusterEA: Scalable Entity Alignment with Stochastic Training and Normalized Mini-batch Similarities [J].
Gao, Yunjun ;
Liu, Xiaoze ;
Wu, Junyang ;
Li, Tianyi ;
Wang, Pengfei ;
Chen, Lu .
PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, :421-431
[7]  
Hamilton WL, 2017, ADV NEUR IN, V30
[8]  
Hassani K, 2020, PR MACH LEARN RES, V119
[9]   LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation [J].
He, Xiangnan ;
Deng, Kuan ;
Wang, Xiang ;
Li, Yan ;
Zhang, Yongdong ;
Wang, Meng .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :639-648
[10]   Collaborative Metric Learning [J].
Hsieh, Cheng-Kang ;
Yang, Longqi ;
Cui, Yin ;
Lin, Tsung-Yi ;
Belongie, Serge ;
Estrin, Deborah .
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, :193-201