首页> 外文期刊>Computational Social Systems, IEEE Transactions on >A Two-Stage Rating Prediction Approach Based on Matrix Clustering on Implicit Information
【24h】

A Two-Stage Rating Prediction Approach Based on Matrix Clustering on Implicit Information

机译:基于矩阵聚类对隐式信息的两级评级预测方法

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

摘要

Traditional matrix factorization (MF) methods take a global view on the user-item rating matrix to conduct matrix decomposition for rating approximation. However, there is an inherent structure in the user-item rating matrix and a local correspondence between user clusters and item clusters as the users induce the items and the items imply the users in a recommendation system. This article proposes a novel approach called two-stage rating prediction (TS-RP) to matrix clustering with implicit information. In the first stage, implicit feedback is used to discover the inherent structure of the user-item rating matrix by spectral clustering. In the second stage, we conduct rating prediction on the dense blocks of explicit information of user-item clusters discovered in the first stage. The proposed TS-RP approach can not only alleviate the data sparsity problem in recommendation but also increase the computation scalability. Experiments on the MovieLens-100K data set demonstrate that the proposed TS-RP approach performs better than most state-of-the-art methods of rating prediction based on MF in terms of recommendation accuracy and computation complexity.
机译:传统的矩阵分解(MF)方法在用户项评级矩阵上占据全局视图,以传导矩阵分解以进行评级近似。然而,在用户 - 项目额定值矩阵中存在固有结构,以及用户群集和项目群集之间的本地对应关系,因为用户诱导项目,并且项目意味着在推荐系统中的用户。本文提出了一种称为两阶段评级预测(TS-RP)的新方法,与隐式信息进行矩阵聚类。在第一阶段,隐式反馈用于通过光谱聚类发现用户项评级矩阵的固有结构。在第二阶段,我们对第一阶段发现的用户项集群的密集块进行评级预测。所提出的TS-RP方法不仅可以缓解建议中的数据稀疏问题,而且还增加了计算可扩展性。 MOVIELENS-100K数据集的实验表明,基于推荐准确性和计算复杂性的MF,所提出的TS-RP方法比基于MF的最先进的评级预测方法更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号