首页> 外文会议>Twentieth International Joint Conference on Artificial Intelligence(IJCAI-07) >ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines
【24h】

ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines

机译:ItemRank:推荐引擎的基于随机游走的评分算法

获取原文

摘要

Recommender systems are an emerging technology that helps consumers to find interesting products. A recommender system makes personalized product suggestions by extracting knowledge from the previous users interactions. In this paper, we present "ItemRank", a random-walk based scoring algorithm, which can be used to rank products according to expected user preferences, in order to recommend top-rank items to potentially interested users. We tested our algorithm on a standard database, the MovieLens data set, which contains data collected from a popular recommender system on movies, that has been widely exploited as a benchmark for evaluating recently proposed approaches to recommender system (e.g. [Fouss et al., 2005; Sarwar et al, 2002]). We compared ItemRank with other state-of-the-art ranking techniques (in particular the algorithms described in [Fouss et al., 2005]). Our experiments show that ItemRank performs better than the other algorithms we compared to and, at the same time, it is less complex than other proposed algorithms with respect to memory usage and computational cost too.
机译:推荐系统是一种新兴技术,可以帮助消费者找到有趣的产品。推荐系统通过从以前的用户交互中提取知识来提出个性化的产品建议。在本文中,我们提出“ ItemRank”,这是一种基于随机游走的评分算法,可用于根据预期的用户偏好对产品进行排名,以便向潜在感兴趣的用户推荐排名最高的商品。我们在标准数据库MovieLens数据集上测试了我们的算法,该数据集包含从流行的电影推荐系统中收集的数据,该数据已被广泛用作评估最近提出的推荐系统方法的基准(例如[Fouss等, 2005; Sarwar等,2002]。我们将ItemRank与其他最新的排名技术(尤其是[Fouss等,2005]中描述的算法)进行了比较。我们的实验表明,ItemRank的性能优于我们与之相比的其他算法,同时,就内存使用和计算成本而言,它也比其他拟议算法复杂。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号