首页> 外文期刊>Neural computing & applications >A collaborative filtering recommendation algorithm based on information theory and bi-clustering
【24h】

A collaborative filtering recommendation algorithm based on information theory and bi-clustering

机译:一种基于信息论和双聚类的协同过滤推荐算法

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

摘要

Collaborative filtering is the most popular and efficient recommendation algorithm to character the potential preference of the new users, by exploring the patterns of historical consuming records/ratings of the investigated users. There are two types of primary collaborative filtering algorithms: the user-based recommendation system, which recommends items to new users by ranking the similarity of the shared items between the history users and the new users, and the item-based collaborative filtering recommend items to new users by considering the rank of the similarity among all the history items of the training data. Although the collaborative filtering has been successfully applied to many commercial fields, several original drawbacks of collaborative filtering, especially the sparsity of the rating data raises a serious challenge to the accuracy and the universality of those algorithms. In particular, the most rating terms for each specific user are missing in many applications, and the performance of collaborative filtering will be degraded along with the increment of the number of items in training dataset. In this paper, we proposed a novel collaborative filtering method (CBE-CF) to extract the local dense rating modules to cope with the data sparsity and the computational efficiency of the traditional recommendation algorithms, by introducing the information entropy and bi-clustering into collaborative filtering. Here, both the rows and columns of the user-item-rating matrix are clustered together to identify the dense rating modules of the historical records (training) data, and then an information entropy metric is used to quantify the similarity between the new user and each dense modules, and the final prediction is optimized by the aggregative recommendations of the global generalization of item-based methods and the local similarity of the nearest modules. Experimental analysis presents the characters of the proposed CBE-CF, and the precision and the computational cost, etc., are better than state of the art on the benchmark dataset.
机译:协作过滤是最受欢迎和高效的推荐算法,以通过探索历史消耗记录/评级的历史记录/调查用户的级别的模式来开发新用户的潜在偏好。主要协同过滤算法有两种类型:基于用户的推荐系统,它通过排序历史用户和新用户之间的共享项目的相似性,以及基于项目的协作过滤推荐项目来推荐给新用户的项目通过考虑培训数据的所有历史记录中的相似性等级来实现新用户。虽然协作过滤已成功应用于许多商业领域,但是具有协作滤波的几个原始缺点,特别是评级数据的稀疏性对这些算法的准确性和普通性提出了严峻的挑战。特别是,许多应用程序中缺少每个特定用户的最多评级术语,并且协作滤波的性能将在训练数据集中的项目数量的增量之后劣化。在本文中,我们提出了一种新颖的协作滤波方法(CBE-CF),以提取局部密集的评级模块,以应对传统推荐算法的数据稀疏和计算效率,通过将信息熵和双聚类引入协作过滤。这里,用户项评级矩阵的行和列都集中在一起,以识别历史记录(训练)数据的密集额定模块,然后使用信息熵度量来量化新用户和的相似性每个密集模块和最终预测由基于项目的方法的全球概括的聚合建议和最近模块的局部相似性进行了优化。实验分析显示了所提出的CBE-CF的特征,以及精度和计算成本等优于基准数据集的最新状态。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号