arXiv:2504.01863cs.IR2025-04被引 4

扩展MovieLens-32M数据集,用用户真实观看兴趣评估推荐系统。

Extending MovieLens-32M to Provide New Evaluation Objectives

  • 通过用户打分推荐池构建新评测目标,预测用户想看的影片。
  • 传统方法中热门算法排第11,而新评测下其排名跌至末位。
  • 新方法能有效缓解推荐系统中的流行度偏差问题。

离线推荐系统评估长期将问题视为机器学习任务:在经典电影推荐场景中,用户已提供显式评分,数据被划分为训练与测试集,目标是基于训练数据预测测试集评分。这种评估方式聚焦于预测用户已观看并评分的影片,而非帮助用户发现他们可能感兴趣的影片。这一目标与实际任务存在偏差,源于避免让用户逐个观看影片评估推荐的成本。本文扩展MovieLens-32M数据集,引入新评估目标——预测用户真正想观看的影片(即观看列表)。为此,我们招募用户,收集其资料,使用22种不同算法生成推荐池,聚合后由用户评估。结果表明,传统评估中表现中等的热门算法(按总评分数推荐),在用户对观看兴趣的评估中成为最差之一。该研究验证了通过推荐池构建测试集的可行性,并显示用户主动评估可有效缓解推荐系统中的流行度偏差。

原文摘要 · Abstract (English)

Offline evaluation of recommender systems has traditionally treated the problem as a machine learning problem. In the classic case of recommending movies, where the user has provided explicit ratings of which movies they like and don't like, each user's ratings are split into test and train sets, and the evaluation task becomes to predict the held out test data using the training data. This machine learning style of evaluation makes the objective to recommend the movies that a user has watched and rated highly, which is not the same task as helping the user find movies that they would enjoy if they watched them. This mismatch in objective between evaluation and task is a compromise to avoid the cost of asking a user to evaluate recommendations by watching each movie. We offer an extension to the MovieLens-32M dataset that provides for new evaluation objectives. Our primary objective is to predict the movies that a user would be interested in watching, i.e. predict their watchlist. To construct this extension, we recruited MovieLens users, collected their profiles, made recommendations with a diverse set of algorithms, pooled the recommendations, and had the users assess the pools. This paper demonstrates the feasibility of using pooling to construct a test collection for recommender systems. Notably, we found that the traditional machine learning style of evaluation ranks the Popular algorithm, which recommends movies based on total number of ratings in the system, in the middle of the twenty-two recommendation runs we used to build the pools. In contrast, when we rank the runs by users' interest in watching movies, we find that recommending popular movies as a recommendation algorithm becomes one of the worst performing runs. It appears that by asking users to assess their personal recommendations, we can alleviate the issue of popularity bias in the evaluation of top-n recommendation.

推荐系统评测方法流行度偏差

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