首页> 外文期刊>Information Processing & Management >Cluster searching strategies for collaborative recommendation systems
【24h】

Cluster searching strategies for collaborative recommendation systems

机译:协作推荐系统的聚类搜索策略

获取原文
获取原文并翻译 | 示例
           

摘要

In-memory nearest neighbor computation is a typical collaborative filtering approach for high recommendation accuracy. However, this approach is not scalable given the huge number of customers and items in typical commercial applications. Cluster-based collaborative filtering techniques can be a remedy for the efficiency problem, but they usually provide relatively lower accuracy figures, since they may become over-generalized and produce less-personalized recommendations. Our research explores an individualistic strategy which initially clusters the users and then exploits the members within clusters, but not just the cluster representatives, during the recommendation generation stage. We provide an efficient implementation of this strategy by adapting a specifically tailored duster-skipping inverted index structure. Experimental results reveal that the individualistic strategy with the cluster-skipping index is a good compromise that yields high accuracy and reasonable scalability figures.
机译:内存中最近邻居计算是一种典型的协作过滤方法,具有很高的推荐精度。但是,鉴于典型商业应用中的大量客户和物品,这种方法无法扩展。基于群集的协作过滤技术可以解决效率问题,但是由于它们可能变得过于笼统并且产生的个性化建议较低,因此它们通常提供相对较低的准确度数据。我们的研究探索了一种个人主义策略,该策略最初会聚集用户,然后在推荐生成阶段利用集群中的成员,而不仅仅是集群代表。我们通过调整专门定制的除尘器跳过倒排索引结构来提供此策略的有效实施。实验结果表明,具有聚类跳过指数的个人主义策略是一个很好的折衷方案,可以产生高精度和合理的可伸缩性数字。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号