首页> 外文会议>International Conference on Research Challenges in Information Science >An item/user representation for recommender systems based on bloom filters
【24h】

An item/user representation for recommender systems based on bloom filters

机译:基于布隆过滤器的推荐系统的项目/用户表示

获取原文

摘要

This paper focuses on the items/users representation in the domain of recommender systems. These systems compute similarities between items (and/or users) to recommend new items to users based on their previous preferences. It is often useful to consider the characteristics (a.k.a features or attributes) of the items and/or users. This represents items/users by vectors that can be very large, sparse and space-consuming. In this paper, we propose a new accurate method for representing items/users with low size data structures that relies on two concepts: (1) item/user representation is based on bloom filter vectors, and (2) the usage of these filters to compute bitwise AND similarities and bitwise XNOR similarities. This work is motivated by three ideas: (1) detailed vector representations are large and sparse, (2) comparing more features of items/users may achieve better accuracy for items similarities, and (3) similarities are not only in common existing aspects, but also in common missing aspects. We have experimented this approach on the publicly available MovieLens dataset. The results show a good performance in comparison with existing approaches such as standard vector representation and Singular Value Decomposition (SVD).
机译:本文重点介绍推荐系统中的项/用户表示形式。这些系统计算项目(和/或用户)之间的相似度,以根据用户先前的偏好向用户推荐新项目。考虑项目和/或用户的特征(又称特征或属性)通常很有用。这通过向量来表示项目/用户,向量可能非常大,稀疏且占用空间。在本文中,我们提出了一种新的精确方法来表示具有小尺寸数据结构的项目/用户,该方法依赖于两个概念:(1)项目/用户表示基于布隆过滤器矢量,以及(2)使用这些过滤器来计算按位与相似度和按位XNOR相似度。这项工作的灵感来自三个想法:(1)详细的矢量表示形式大而稀疏;(2)比较商品/用户的更多功能可能会在商品相似性上获得更好的准确性;(3)相似性不仅存在于现有的共同方面,而且在常见的缺失方面。我们已经在可公开获得的MovieLens数据集上试验了这种方法。与现有方法(例如标准矢量表示和奇异值分解(SVD))相比,结果显示出良好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号