基于内容和最近邻算法的多臂老虎机推荐算法

A Multi-Armed Bandit Recommender System Based on Context and KNN

  • 摘要: 本文提出一种基于内容和最近邻(k-近邻)的多臂老虎机推荐算法:把推荐问题转化成多臂老虎机问题,把冷启动问题转化成EE(explore exploit)问题;通过观察用户特征,以用户特征为内容,计算用户之间的相似度并得出用户的最近邻;最近邻用户基于内容对推荐池物品进行预期评价,根据用户最近邻的预期评价情况,选择综合最优的物品推荐给用户. 并通过采用来自Movielens和Jester的真实数据集进行实验,实验结果表明:结合内容和最近邻算法的推荐算法更优且更具实用性,尤其在解决冷启动问题上效果显著.

     

    Abstract: In this paper a multi-armed bandit Recommender System (RS) is proposed based on contextual content and knn (k-nearest neighbors) algorithm. The multi-armed bandit problem is considered as a recommending problem and it transfers the cold start problem into EE (explore exploit) problem. By using the users observed features as contextual content, the RS can compute the difference between users and get the k nearest neighbors of a giving user. The neighbors rate all the candidate items based on the contextual content. With the analysis of the neighbors ratings, the system can make some good recommendations to the user. The experiments on real datasets from movielens and jester are conducted. It shows that the contextual multi-armed bandit Recommender System based on knn performs better compared with other baseline approaches. And the proposed algorithm is particularly effective in solving the cold start problem.

     

/

返回文章
返回