Hierarchical Denoising for Robust Social Recommendation

被引:2
作者
Hu, Zheng [1 ]
Nakagawa, Satoshi [2 ]
Zhuang, Yan [1 ]
Deng, Jiawen [1 ]
Cai, Shimin [1 ]
Zhou, Tao [1 ]
Ren, Fuji [1 ,3 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 610056, Peoples R China
[2] Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo 1138654, Japan
[3] Univ Elect Sci & Technol China, Shenzhen Inst Adv Study, Shenzhen 518028, Peoples R China
基金
中国国家自然科学基金;
关键词
Noise reduction; Noise; Social networking (online); Robustness; Knowledge transfer; Noise measurement; Recommender systems; Market research; Logic gates; Graph neural networks; Cross-domain recommendation; graph neural network; recommender systems; social recommendation;
D O I
10.1109/TKDE.2024.3508778
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Social recommendations leverage social networks to augment the performance of recommender systems. However, the critical task of denoising social information has not been thoroughly investigated in prior research. In this study, we introduce a hierarchical denoising robust social recommendation model to tackle noise at two levels: 1) intra-domain noise, resulting from user multi-faceted social trust relationships, and 2) inter-domain noise, stemming from the entanglement of the latent factors over heterogeneous relations (e.g., user-item interactions, user-user trust relationships). Specifically, our model advances a preference and social psychology-aware methodology for the fine-grained and multi-perspective estimation of tie strength within social networks. This serves as a precursor to an edge weight-guided edge pruning strategy that refines the model's diversity and robustness by dynamically filtering social ties. Additionally, we propose a user interest-aware cross-domain denoising gate, which not only filters noise during the knowledge transfer process but also captures the high-dimensional, nonlinear information prevalent in social domains. We conduct extensive experiments on three real-world datasets to validate the effectiveness of our proposed model against state-of-the-art baselines. We perform empirical studies on synthetic datasets to validate the strong robustness of our proposed model.
引用
收藏
页码:739 / 753
页数:15
相关论文
共 61 条
[1]  
Bi YL, 2024, Arxiv, DOI arXiv:2402.08893
[2]   Item Similarity Mining for Multi-Market Recommendation [J].
Cao, Jiangxia ;
Cong, Xin ;
Liu, Tingwen ;
Wang, Bin .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :2249-2254
[3]   Structured Graph Convolutional Networks with Stochastic Masks for Recommender Systems [J].
Chen, Huiyuan ;
Wang, Lan ;
Lin, Yusan ;
Yeh, Chin-Chia Michael ;
Wang, Fei ;
Yang, Hao .
SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, :614-623
[4]  
Chen T, 2020, PR MACH LEARN RES, V119
[5]  
Cheng Z., 2022, P INT JOINT C NEUR N, P1
[6]  
Ester Martin, 2010, P 4 ACM C RECOMMENDE, P135
[7]   Metapath-guided Heterogeneous Graph Neural Network for Intent Recommendation [J].
Fan, Shaohua ;
Zhu, Junxiong ;
Han, Xiaotian ;
Shi, Chuan ;
Hu, Linmei ;
Ma, Biyu ;
Li, Yongliang .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :2478-2486
[8]   Graph Neural Networks for Social Recommendation [J].
Fan, Wenqi ;
Ma, Yao ;
Li, Qing ;
He, Yuan ;
Zhao, Eric ;
Tang, Jiliang ;
Yin, Dawei .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :417-426
[9]  
Glorot X., 2010, P 13 INT C ART INT S, P249
[10]   USING COLLABORATIVE FILTERING TO WEAVE AN INFORMATION TAPESTRY [J].
GOLDBERG, D ;
NICHOLS, D ;
OKI, BM ;
TERRY, D .
COMMUNICATIONS OF THE ACM, 1992, 35 (12) :61-70