通过多粒度偏好建模,提升多行为序列推荐的准确性
Multi-Grained Preference Enhanced Transformer for Multi-Behavior Sequential Recommendation
- 构建交互级图结构,捕捉跨行为的细粒度依赖关系
- 多尺度变换器编码时序模式,显著优于现有方法
- 适合需要精细行为分析的电商推荐场景
序列推荐旨在根据用户历史行为动态预测下一个购买项目。为提升推荐性能,学习异构多行为间的动态依赖关系至关重要。然而,多行为序列推荐仍面临挑战:现有方法仅在行为或物品层面建模依赖,交互级依赖建模仍不充分;同时,交互序列中动态的多粒度行为感知偏好难以捕捉,影响对交互感知时序模式的建模。为此,我们提出多粒度偏好增强变压器框架(M-GPT)。首先,在序列中构建历史跨类型交互的交互级图,并通过图卷积反复学习特定顺序下历史跨类型交互间的复杂相关性。其次,提出一种新型多尺度变换器架构,结合多粒度用户偏好提取机制,编码由行为感知多粒度偏好增强的交互感知时序模式。在真实数据集上的实验表明,M-GPT持续优于多种先进推荐方法。
原文摘要 · Abstract (English)
Sequential recommendation (SR) aims to predict the next purchasing item according to users' dynamic preference learned from their historical user-item interactions. To improve the performance of recommendation, learning dynamic heterogeneous cross-type behavior dependencies is indispensable for recommender system. However, there still exists some challenges in Multi-Behavior Sequential Recommendation (MBSR). On the one hand, existing methods only model heterogeneous multi-behavior dependencies at behavior-level or item-level, and modelling interaction-level dependencies is still a challenge. On the other hand, the dynamic multi-grained behavior-aware preference is hard to capture in interaction sequences, which reflects interaction-aware sequential pattern. To tackle these challenges, we propose a Multi-Grained Preference enhanced Transformer framework (M-GPT). First, M-GPT constructs a interaction-level graph of historical cross-typed interactions in a sequence. Then graph convolution is performed to derive interaction-level multi-behavior dependency representation repeatedly, in which the complex correlation between historical cross-typed interactions at specific orders can be well learned. Secondly, a novel multi-scale transformer architecture equipped with multi-grained user preference extraction is proposed to encode the interaction-aware sequential pattern enhanced by capturing temporal behavior-aware multi-grained preference . Experiments on the real-world datasets indicate that our method M-GPT consistently outperforms various state-of-the-art recommendation methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。