arXiv:2507.07251cs.IRcs.CL2025-07被引 1

用大模型理解用户文字偏好,让推荐更像懂你的朋友。

A Language-Driven Framework for Improving Personalized Recommendations: Merging LLMs with Traditional Algorithms

  • 用大模型解析用户文本偏好,优化传统推荐算法输出
  • 自动提取偏好后,累积命中率最高提升约6倍,NDCG提升3.7倍
  • 适合想做个性化推荐的开发者或研究者,尤其关注语言理解

传统推荐算法无法直接处理用户通过文本表达的偏好(如“我喜欢轻松幽默的喜剧”)。本文提出一种语言驱动框架,利用大语言模型(LLMs)增强电影推荐系统,通过融合语言输入与传统算法(如SVD、SVD++)的初始推荐结果。实验基于MovieLens-Latest-Small数据集,使用Surprise库训练,采用留一法验证命中率与累积命中率,并在0.75:0.25分层划分下对比评分与排序指标。该框架可自动构建用户偏好画像或支持手动指定,显著优于基线模型:在所有评估指标上均表现更优,累积命中率最高提升约6倍,NDCG提升约3.7倍,仅伴随轻微计算开销增加。

原文摘要 · Abstract (English)

Traditional recommendation algorithms are not designed to provide personalized recommendations based on user preferences provided through text, e.g., "I enjoy light-hearted comedies with a lot of humor". Large Language Models (LLMs) have emerged as one of the most promising tools for natural language processing in recent years. This research proposes a novel framework that mimics how a close friend would recommend items based on their knowledge of an individual's tastes. We leverage LLMs to enhance movie recommendation systems by refining traditional algorithm outputs and integrating them with language-based user preference inputs. We employ Singular Value Decomposition (SVD) or SVD++ algorithms to generate initial movie recommendations, implemented using the Surprise Python library and trained on the MovieLens-Latest-Small dataset. We compare the performance of the base algorithms with our LLM-enhanced versions using leave-one-out validation hit rates and cumulative hit rates. Additionally, to compare the performance of our framework against the current state-of-the-art recommendation systems, we use rating and ranking metrics with an item-based stratified 0.75 train, 0.25 test split. Our framework can generate preference profiles automatically based on users' favorite movies or allow manual preference specification for more personalized results. Using an automated approach, our framework overwhelmingly surpassed SVD and SVD++ on every evaluation metric used (e.g., improvements of up to ~6x in cumulative hit rate, ~3.7x in NDCG, etc.), albeit at the cost of a slight increase in computational overhead.

个性化推荐大模型语言理解协同过滤

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