<p>Graph Neural Networks (GNNs) have been utilized in social recommendation, leveraging social relations to enhance the representation of learning for recommendation. Most social recommendation models unify the user-item interactions and social relations in the user representation. Although existing recommender systems have made great progress, most methods struggle to effectively capture the diverse behavioral patterns of users across the two domains, and this limitation hampers the ability to represent users and their preferences accurately. To overcome this limitation, we introduce a novel social recommendation disentangled learning framework (LDGSR). Our model not only highlights the significance of incorporating heterogeneous relationships and latent factor decomposition in social network recommendation models but also explores the rich relationships between items. We conducted comprehensive experiments on four widely used benchmark datasets to validate the effectiveness of the proposed method.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Light disentangled graph learning for social recommendation

  • Yangding Li,
  • Hao Feng,
  • Yangyang Zeng,
  • Xiangchao Zhao,
  • Jiawei Chai,
  • Shaobin Fu,
  • Cui Ye,
  • Shichao Zhang

摘要

Graph Neural Networks (GNNs) have been utilized in social recommendation, leveraging social relations to enhance the representation of learning for recommendation. Most social recommendation models unify the user-item interactions and social relations in the user representation. Although existing recommender systems have made great progress, most methods struggle to effectively capture the diverse behavioral patterns of users across the two domains, and this limitation hampers the ability to represent users and their preferences accurately. To overcome this limitation, we introduce a novel social recommendation disentangled learning framework (LDGSR). Our model not only highlights the significance of incorporating heterogeneous relationships and latent factor decomposition in social network recommendation models but also explores the rich relationships between items. We conducted comprehensive experiments on four widely used benchmark datasets to validate the effectiveness of the proposed method.