arXiv:2606.01948cs.IRcs.AI2026-06

用低秩约束和注意力机制,提升群组推荐的准确性和效率。

Rank-Constrained Deep Matrix Completion for Group Recommendation

  • 结合低秩矩阵补全与注意力模型,统一建模群组偏好。
  • 在MovieLens和Goodbooks上实现更低的群体均方误差。
  • 适合处理稀疏数据,尤其适用于小中大不同规模群组。

随着群体活动日益流行,如何根据个体偏好为群组提供推荐成为重要问题。现有方法多依赖用户偏好聚合,但在真实场景中面对高维稀疏评分数据时表现不佳。本文提出群组低秩约束深度矩阵补全(Group RC-DMC),通过Set-Transformer聚合器引入群组级表示学习,统一低秩正则化、线性编码解码架构与基于注意力的非线性建模。该模型仅利用观测评分计算用户潜在表示,并通过核范数近似步骤施加潜空间秩约束,解码器采用低秩因子分解,实现高效推理。在MovieLens和Goodbooks数据集上的实验表明,Group RC-DMC在重建精度上优于加权前/后因子化基线,群体RMSE更低,同时在精确率、召回率和F1分数上保持竞争力,展现出对用户-项目交互底层低秩结构的恢复能力,适用于各类规模群组的鲁棒推荐。

原文摘要 · Abstract (English)

The growing popularity of group activities has increased the need for methods that provide recommendations to groups of users given their individual preferences. Many existing group recommender systems rely on aggregating individual user preferences, but they often struggle with high-dimensional and highly sparse rating data commonly found in real-world scenarios. We propose Group Rank-Constrained Deep Matrix Completion (Group RC-DMC), a novel framework that extends RC-DMC by integrating group-level representation learning via a Set-Transformer aggregator, jointly leveraging low-rank structure and attention-based nonlinear modeling. Unlike most existing group recommender systems, Group RC-DMC unifies explicit low-rank regularization, linear encoder-decoder architectures, and attention-based nonlinear group modeling within a single framework, yielding accurate predictions at both the individual and group levels. Group RC-DMC addresses data sparsity through low-rank matrix completion, computing per-user latent representations from observed ratings only, and enforcing a rank constraint on the latent space using a nuclear-norm proximal step based on periodic singular value thresholding. The decoder is parametrized as a low-rank factorization, enabling efficient inference. Experimental results on the MovieLens and Goodbooks datasets demonstrate that Group RC-DMC achieves superior reconstruction accuracy, measured by lower group RMSE, while remaining computationally efficient and competitive in group-level performance in terms of precision, recall, and F1 score compared with weighted-before-factorization (WBF) and after-factorization (AF) baselines. The results highlight the model's ability to recover the underlying low-rank structure of user-item interactions and provide robust group recommendations across small, medium, and large user groups.

群组推荐矩阵补全低秩建模

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