arXiv:2601.10933cs.IR2026-01中稿 · WWW 2026被引 3

提升长尾项目推荐效果,同时不损害热门项目表现

Tail-Aware Data Augmentation for Long-Tail Sequential Recommendation

  • 通过共现关系构建低频项目关联,设计替换与插入增强操作
  • 在不降低头部项目性能前提下,显著提升长尾用户推荐准确率
  • 适合需要兼顾长尾与热门内容推荐的场景,如电商、内容平台

序列推荐(SR)基于用户历史交互序列学习偏好并提供个性化建议。现实中,多数用户仅交互少量项目,而大部分项目极少被消费,这种长尾现象限制了模型对用户偏好的学习能力。尽管已有方法尝试通过头部知识迁移或引入上下文信息来改善长尾学习,但仍存在两大问题:1)难以缓解长尾用户/项目交互稀疏,导致其偏好学习不完整;2)提升长尾表现时常以牺牲整体或头部性能为代价,影响用户体验。为此,本文提出面向长尾的自适应数据增强方法(TADA),在不损害头部性能的前提下增强长尾项目/用户的交互频率,从而提升模型对长尾部分的学习能力。具体而言,首先利用线性模型捕捉低频项目的共现与相关性,进而设计两种长尾感知增强算子:T-Substitute(用相关项替换头部项)和T-Insert(基于共现关系扩展序列,融入头尾项目)。将原始序列与增强序列在表示层混合,以保留偏好知识。进一步在不同长尾用户序列间及增强序列间进行混合,生成更丰富的增强样本,提升长尾性能。大量实验验证了该方法的优越性。代码已开源。

原文摘要 · Abstract (English)

Sequential recommendation (SR) learns user preferences based on their historical interaction sequences and provides personalized suggestions. In real-world scenarios, most users can only interact with a handful of items, while the majority of items are seldom consumed. This pervasive long-tail challenge limits the model's ability to learn user preferences. Despite previous efforts to enrich tail items/users with knowledge from head parts or improve tail learning through additional contextual information, they still face the following issues: 1) They struggle to improve the situation where interactions of tail users/items are scarce, leading to incomplete preferences learning for the tail parts. 2) Existing methods often degrade overall or head parts performance when improving accuracy for tail users/items, thereby harming the user experience. We propose Tail-Aware Data Augmentation (TADA) for long-tail sequential recommendation, which enhances the interaction frequency for tail items/users while maintaining head performance, thereby promoting the model's learning capabilities for the tail. Specifically, we first capture the co-occurrence and correlation among low-popularity items by a linear model. Building upon this, we design two tail-aware augmentation operators, T-Substitute and T-Insert. The former replaces the head item with a relevant item, while the latter utilizes co-occurrence relationships to extend the original sequence by incorporating both head and tail items. The augmented and original sequences are mixed at the representation level to preserve preference knowledge. We further extend the mix operation across different tail-user sequences and augmented sequences to generate richer augmented samples, thereby improving tail performance. Comprehensive experiments demonstrate the superiority of our method. The codes are provided at https://github.com/KingGugu/TADA.

序列推荐长尾问题数据增强

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。