首页> 外文会议>Pacific-Asia conference on knowledge discovery and data mining >A Coupled Clustering Approach for Items Recommendation
【24h】

A Coupled Clustering Approach for Items Recommendation

机译:推荐项目的耦合聚类方法

获取原文

摘要

Recommender systems are very useful due to the huge volume of information available on the Web. It helps users alleviate the information overload problem by recommending users with the personalized information, products or services (called items). Collaborative filtering and content-based recommendation algorithms have been widely deployed in e-commerce web sites. However, they both suffer from the scalability problem. In addition, there are few suitable similarity measures for the content-based recommendation methods to compute the similarity between items. In this paper, we propose a hybrid recommendation algorithm by combing the content-based and collaborative filtering techniques as well as incorporating the coupled similarity. Our method firstly partitions items into several item groups by using a coupled version of k-modes clustering algorithm, where the similarity between items is measured by the Coupled Object Similarity considering coupling between items. The collaborative filtering technique is then used to produce the recommendations for active users. Experimental results show that our proposed hybrid recommendation algorithm effectively solves the scalability issue of recommender systems and provides a comparable recommendation quality when lacking most of the item features.
机译:由于Web上可用的信息量很大,因此推荐系统非常有用。它通过向用户推荐个性化的信息,产品或服务(称为项目)来帮助用户减轻信息过载的问题。协作过滤和基于内容的推荐算法已广泛部署在电子商务网站中。但是,它们都遭受可伸缩性问题。另外,对于基于内容的推荐方法来计算项目之间的相似度,几乎没有合适的相似度度量。在本文中,我们结合了基于内容的协作过滤技术以及结合的相似性,提出了一种混合推荐算法。我们的方法首先使用k模式聚类算法的耦合版本将项目划分为几个项目组,其中项目之间的相似性是通过考虑项目之间的耦合的耦合对象相似度来衡量的。然后使用协作过滤技术为活跃用户生成推荐。实验结果表明,本文提出的混合推荐算法有效地解决了推荐系统的可扩展性问题,并且在缺少大多数项目特征时提供了可比的推荐质量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号