Suppr超能文献

用于捆绑推荐的自适应多图对比学习

Adaptive multi-graph contrastive learning for bundle recommendation.

作者信息

Tao Qian, Liu Chenghao, Xia Yuhan, Xu Yong, Li Lusi

机构信息

School of Software, South China University of Technology, Higher Education Mega Centre, Panyu District, Guangzhou, 510006, Guangdong, China.

School of Computer Science & Engineering, South China University of Technology, Higher Education Mega Centre, Panyu District, Guangzhou, 510006, Guangdong, China.

出版信息

Neural Netw. 2025 Jan;181:106832. doi: 10.1016/j.neunet.2024.106832. Epub 2024 Oct 24.

Abstract

Recently, recommending bundles - sets of items that complement each other - instead of individual items to users has drawn much attention in both academia and industry. Models based on Graph Neural Networks (GNNs) for bundle recommendation have achieved great success in capturing users' preferences by modeling pairwise correlations among users, bundles, and items via information propagation on graphs. However, a notable limitation lies in their insufficient focus on explicitly modeling intricate ternary relationships. Additionally, the loose combination of node embeddings from different graphs tends to introduce noise, as it fails to consider disparities among the graphs. To this end, we propose a novel approach called Adaptive Multi-Graph Contrastive Learning for Bundle Recommendation (AMCBR). Specifically, AMCBR models ternary interactions by constructing multiple graphs, including a bundle preference graph based on direct user-bundle interactions, a collaborative neighborhoods graph featuring user-level and bundle-level subgraphs, and an item-level preference hypergraph capturing indirect user-bundle relationships through items. Then, (hyper)graph convolution is applied to each (hyper)graph to encode diverse potential preferences into node embeddings. To enhance the model's robustness, an adaptive aggregation module is employed to assign varying weights to node embeddings from different graphs during the fusion process, which enriches the semantic and comprehensive information in the embeddings while mitigating potential noise. Finally, a contrastive learning strategy is proposed to jointly optimize the model, strengthening collaborative links between individual graphs. Extensive experiments on three real datasets demonstrate that AMCBR can outperform the state-of-the-art baselines on the Top-K recommendations.

摘要

最近,向用户推荐捆绑包(相互补充的一组物品)而非单个物品在学术界和工业界都引起了广泛关注。基于图神经网络(GNN)的捆绑包推荐模型通过在图上进行信息传播,对用户、捆绑包和物品之间的成对相关性进行建模,从而在捕捉用户偏好方面取得了巨大成功。然而,一个显著的局限性在于它们对复杂三元关系的显式建模关注不足。此外,来自不同图的节点嵌入的松散组合往往会引入噪声,因为它没有考虑图之间的差异。为此,我们提出了一种名为“用于捆绑包推荐的自适应多图对比学习”(AMCBR)的新方法。具体而言,AMCBR通过构建多个图来对三元交互进行建模,包括基于用户与捆绑包直接交互的捆绑包偏好图、具有用户级和捆绑包级子图的协作邻域图,以及通过物品捕捉用户与捆绑包间接关系的物品级偏好超图。然后,对每个(超)图应用(超)图卷积,将各种潜在偏好编码到节点嵌入中。为了增强模型的鲁棒性,采用了一个自适应聚合模块,在融合过程中为来自不同图的节点嵌入分配不同的权重,这在丰富嵌入中的语义和综合信息的同时减轻了潜在噪声。最后,提出了一种对比学习策略来联合优化模型,加强各个图之间的协作联系。在三个真实数据集上进行的广泛实验表明,AMCBR在Top-K推荐方面可以优于当前的基线模型。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验