首页> 外文期刊>Indian Journal of Science and Technology >Collaborative Filtering using Euclidean Distance in Recommendation Engine
【24h】

Collaborative Filtering using Euclidean Distance in Recommendation Engine

机译:推荐引擎中使用欧式距离的协同过滤

获取原文
       

摘要

Objectives: Recommendation engine is a part of information filtering system that tries to predict the ‘preference’ or ‘rating’ of an item in the E-commerce. Recommendation engines have become extremely common in recent days to make an appropriate recommendation rapidly and effectively about any products on which the user is interested. Methods/ Statistical Analysis: One of popular information filtering systems in the recommendation engine is collaborative filtering where the predictions are made based on the usage patterns of the users who are similar to another user. The accuracy of a recommendation engine using collaborative filtering depends on the techniques used to measure the similarity between the user’s preferences. Therefore, in this paper we use two metrics to measure the similarity between the user’s preferences namely KL Divergences and Euclidean distance. The proposed algorithm works by first clustering the users using k means clustering by utilising the similarity metrics and then computing the global Markov matrix for that cluster. Next, the PageRank value for each user is computed and those values are combined with the global Markov matrix to find the recommendations. Findings: We consider the problem of collaborative filtering to recommend potential items of interest to a user already engaged in a session, using past session of the user and other users. Our algorithm leads to the personalized PageRank, where context is captured by the personalization vector. The results show that the collaborative filtering using Euclidean distance metrics for similarity measure performs well than the KL divergence. Application/ Improvements: The proposed recommendation engine can be used in a wide variety of applications such music, movies, books, news, research articles, social media, search queries, and products in general in order to provide a effective recommendation.
机译:目标:推荐引擎是信息过滤系统的一部分,该系统试图预测电子商务中某项商品的“偏好”或“评级”。推荐引擎在最近几天变得极为普遍,以快速有效地针对用户感兴趣的任何产品提出适当的推荐。方法/统计分析:推荐引擎中一种流行的信息过滤系统是协作过滤,其中基于与另一用户相似的用户的使用模式进行预测。使用协作过滤的推荐引擎的准确性取决于用来衡量用户偏好之间相似度的技术。因此,在本文中,我们使用两个指标来衡量用户偏好之间的相似度,即KL散度和欧几里得距离。所提出的算法的工作原理是首先利用k均值聚类通过利用相似性度量对用户进行聚类,然后为该聚类计算全局Markov矩阵。接下来,计算每个用户的PageRank值,并将这些值与全局Markov矩阵组合以找到建议。调查结果:我们考虑使用协作过滤的问题,以使用该用户和其他用户的过去会话向已经参与该会话的用户推荐潜在的感兴趣项目。我们的算法导致个性化PageRank,其中上下文由个性化矢量捕获。结果表明,使用欧几里德距离度量进行相似性度量的协同过滤比KL散度更好。应用程序/改进:推荐的推荐引擎可广泛用于音乐,电影,书籍,新闻,研究文章,社交媒体,搜索查询和产品等各种应用中,以提供有效的推荐。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号