解决推荐系统过度推荐热门商品的问题,提升个性化精度。
Towards Popularity-Aware Recommendation: A Multi-Behavior Enhanced Framework with Orthogonality Constraint
- 融合用户多种行为数据构建三维张量,更精准捕捉偏好
- 引入正交约束使物品特征不受流行度影响,降低偏差
- 在真实电商数据上效果优于现有方法,适合工业应用
Top-K 推荐需推断用户隐含偏好并生成个性化推荐,但现有系统普遍存在流行度偏差,导致热门商品被过度推荐,偏离真实偏好,损害用户满意度与商家收益。现有去偏方法存在准确率-去偏权衡大、参数敏感且对正向交互稀疏性敏感等问题。本文提出 PopSI 框架,通过融合多行为侧信息,将用户行为建模为三维张量,有效利用所有切片捕捉用户偏好;同时引入新颖的正交性约束,使物品特征空间对流行度特征不变,缓解模型对流行度偏差的敏感性。在真实电商数据集上的实验表明,PopSI 在保持微小准确率-去偏权衡的同时,显著优于当前最优去偏方法,具备实际应用可扩展性。代码已开源。
原文摘要 · Abstract (English)
Top-$K$ recommendation involves inferring latent user preferences and generating personalized recommendations accordingly, which is now ubiquitous in various decision systems. Nonetheless, recommender systems usually suffer from severe \textit{popularity bias}, leading to the over-recommendation of popular items. Such a bias deviates from the central aim of reflecting user preference faithfully, compromising both customer satisfaction and retailer profits. Despite the prevalence, existing methods tackling popularity bias still have limitations due to the considerable accuracy-debias tradeoff and the sensitivity to extensive parameter selection, further exacerbated by the extreme sparsity in positive user-item interactions. In this paper, we present a \textbf{Pop}ularity-aware top-$K$ recommendation algorithm integrating multi-behavior \textbf{S}ide \textbf{I}nformation (PopSI), aiming to enhance recommendation accuracy and debias performance simultaneously. Specifically, by leveraging multiple user feedback that mirrors similar user preferences and formulating it as a three-dimensional tensor, PopSI can utilize all slices to capture the desiring user preferences effectively. Subsequently, we introduced a novel orthogonality constraint to refine the estimated item feature space, enforcing it to be invariant to item popularity features thereby addressing our model's sensitivity to popularity bias. Comprehensive experiments on real-world e-commerce datasets demonstrate the general improvements of PopSI over state-of-the-art debias methods with a marginal accuracy-debias tradeoff and scalability to practical applications. The source code for our algorithm and experiments is available at \url{https://github.com/Eason-sys/PopSI}.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。