计算机工程与应用 ›› 2025, Vol. 61 ›› Issue (12): 154-165.DOI: 10.3778/j.issn.1002-8331.2403-0149

• 模式识别与人工智能 • 上一篇    下一篇

面向捆绑推荐的解耦图对比学习

张尧,王绍卿,吴瑕,孙福振   

  1. 山东理工大学 计算机科学与技术学院,山东 淄博 255000
  • 出版日期:2025-06-15 发布日期:2025-06-13

Disentangled Graph Contrastive Learning for Bundle Recommendation

ZHANG Yao, WANG Shaoqing, WU Xia, SUN Fuzhen   

  1. School of Computer Science and Technology, Shandong University of Technology, Zibo, Shandong 255000, China
  • Online:2025-06-15 Published:2025-06-13

摘要: 捆绑推荐的目的是将多个相关的项目作为一个整体推荐给用户。在捆绑推荐中,用户可能会因为捆绑包中的一个特定项目去选择该捆绑包,而用户选择项目往往包含多种意图。现有的方法主要是对用户和捆绑包的意图解耦表示进行整体建模,而忽略了不同意图之间的细微差别。设计了一个面向捆绑推荐的解耦图对比学习模型(disentangled graph contrastive learning for bundle recommendation,DCBR),解耦用户的潜在意图,并通过对比学习在宏观视图和微观视图之间构建合作关联。具体来说,分别从宏观视图和微观视图学习用户意图,并生成意图解耦表示。根据捆绑包-项目隶属关系图分别映射出用户对捆绑包的偏好。设计了一种意图级对比学习在每个意图子空间中构建两个视图的合作关联。在三个公共数据集上的大量实验表明,所提出的模型要优于基线模型,该模型在Recall和NDCG指标上分别比最佳基线提高了3.26%~6.14%、3.99%~6.78%和4.79%~7.97%。

关键词: 捆绑推荐, 解耦表示学习, 对比学习, 图神经网络

Abstract: The goal of bundle recommendation is to recommend multiple related items to users as a whole. In bundle recommendation, a user may select a bundle because of a specific item in the bundle, and users choose items often with multiple intents. Existing methods mainly model the intent disentangled representations of user and bundle as a whole, while ignoring the subtle differences among different intents. To address this problem, a disentangled graph contrastive learning model for bundle recommendation (DCBR) is proposed, which disentangles the potential intents of the user and constructs a cooperative association between macro view and micro view through contrastive learning. More specifically, this paper begins with learning user intents from macro view and micro view, respectively, and generates the intent disentangled representations. Then, the preferences of user for bundles are mapped according to the bundle-item affiliation graph. Finally, intent-level contrastive learning is designed to build cooperative associations created by two views in each intent subspace. Extensive experiments on three public datasets show that the proposed model outperforms the state-of-the-art baselines, the model improves over the best baseline by 3.26% to 6.14%, 3.99% to 6.78%, and 4.79% to 7.97% on Recall and NDCG metrics, respectively.

Key words: bundle recommendation, disentangled representation learning, contrastive learning, graph neural networks