arXiv:2603.03782cs.IRcs.AI2026-03

通过解耦行为与潜在推理,提升共享账号推荐准确性

DisenReason: Behavior Disentanglement and Latent Reasoning for Shared-Account Sequential Recommendation

  • 从频域解耦行为,构建统一账号表示作为推理起点
  • 在4个数据集上相对基线最高提升12.56% MRR@5
  • 适合处理多用户共享账号的复杂推荐场景

共享账号在流媒体和电商平台上普遍存在,现有共享账号序列推荐(SSR)方法通常假设每个账号有固定数量的潜在用户,难以适应多样化的共享模式,降低推荐精度。受序列推荐中潜在推理技术启发,我们提出将推断潜在用户数量转化为生成一系列中间嵌入的过程,从“推断用户背后的偏好”转向“推断账号背后的用户”。然而,传统方法依赖最后一个物品嵌入进行推理,在SSR中不适用,因其仅反映最近潜在用户的单个行为,而非账号整体行为。为此,我们提出DisenReason,一种针对SSR设计的两阶段推理方法:第一阶段从频域视角进行行为解耦,生成统一的账号行为表示;第二阶段以该表示为锚点,推断账号背后的潜在用户数量。在四个基准数据集上的实验表明,DisenReason在所有基线上均表现更优,相对提升达12.56%(MRR@5)和6.06%(Recall@20)。

原文摘要 · Abstract (English)

Shared-account usage is common on streaming and e-commerce platforms, where multiple users share one account. Existing shared-account sequential recommendation (SSR) methods often assume a fixed number of latent users per account, limiting their ability to adapt to diverse sharing patterns and reducing recommendation accuracy. Recent latent reasoning technique applied in sequential recommendation (SR) generate intermediate embeddings from the user embedding (e.g, last item embedding) to uncover users' potential interests, which inspires us to treat the problem of inferring the number of latent users as generating a series of intermediate embeddings, shifting from inferring preferences behind user to inferring the users behind account. However, the last item cannot be directly used for reasoning in SSR, as it can only represent the behavior of the most recent latent user, rather than the collective behavior of the entire account. To address this, we propose DisenReason, a two-stage reasoning method tailored to SSR. DisenReason combines behavior disentanglement stage from frequency-domain perspective to create a collective and unified account behavior representation, which serves as a pivot for latent user reasoning stage to infer the number of users behind the account. Experiments on four benchmark datasets show that DisenReason consistently outperforms all state-of-the-art baselines across four benchmark datasets, achieving relative improvements of up to 12.56\% in MRR@5 and 6.06\% in Recall@20.

序列推荐共享账号潜在推理行为解耦

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