首页> 中文期刊> 《计算机工程》 >基于用户近邻的N维张量分解推荐算法

基于用户近邻的N维张量分解推荐算法

         

摘要

Recommendation algorithm based on tensor factorization has low accuracy and data sparseness problem.Therefore,on the basic of the traditional tensor decomposition model,this paper introduces the user nearest neighbor information,and proposes N dimensional tensor decomposition model.Using context aware information,it uses implicit feedback information as the third dimension to establish N dimensional tensor decomposition model.To further improve the the quality of recommendation,it adds the user nearest neighbor information to optimize the N dimensional tensor decomposition model to improve the accuracy of the tensor decomposition recommendation algorithm.Experimental results show that the tensor decomposition recommendation algorithm combined with user nearest neighbor has better accuracy than the traditional tensor decomposition algorithm,can effectively solve the sparsity and accuracy problems.%基于张量分解的推荐算法存在推荐精度较低和数据稀疏的问题.为此,在传统的张量分解模型基础上,引入用户近邻信息,提出一种新的N维张量分解算法.利用上下文感知信息,把隐式反馈信息作为张量的第3维度,以建立N维张量分解模型,为进一步提高推荐质量,加入用户近邻信息来优化N维张量分解模型,以提高张量分解推荐算法的准确率.实验结果表明,融合用户近邻的张量分解推荐算法比传统的张量分解算法具有更好的准确性,能有效解决稀疏性和准确性问题.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号