首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于低秩矩阵填充的推荐算法
引用本文:潘伟,胡春安.基于低秩矩阵填充的推荐算法[J].科学技术与工程,2021,21(11):4519-4523.
作者姓名:潘伟  胡春安
作者单位:江西理工大学信息工程学院,赣州341000
基金项目:国家自然科学基金(61562038)
摘    要:针对已有协同过滤推荐技术中评分矩阵极度稀疏问题,提出了一种基于低秩矩阵填充技术的推荐算法.该算法从贝叶斯框架出发,提出了能够解决低秩矩阵问题的分层高斯先验模型,并将广义近似消息传递算法嵌入到贝叶斯框架,规避了贝叶斯学习过程中烦琐的矩阵逆运算,提升了算法运算速度,同时在广义近似消息传递算法中施加阻尼运算以促进收敛.在开放数据集上的实验结果表明,所提出的算法与相关的矩阵填充推荐算法相比,有效地提高了推荐准确度.

关 键 词:协同过滤  矩阵填充  广义近似消息传递  低秩
收稿时间:2020/8/13 0:00:00
修稿时间:2020/11/19 0:00:00

Recommendation Algorithm Based on Low-Rank Matrix Completion
Pan Wei,Hu Chunan.Recommendation Algorithm Based on Low-Rank Matrix Completion[J].Science Technology and Engineering,2021,21(11):4519-4523.
Authors:Pan Wei  Hu Chunan
Institution:Institute of Information Engineering, Jiangxi University of Science and Technology
Abstract:The existing collaborative filtering recommendation algorithm has the defect of sparse score matrix. To solve this problem, a recommendation algorithm based on low-rank matrix completion is proposed. By applying the variational Bayesian framework, a hierarchical Gaussian prior model was adopted to encourage a low-rank solution. To avoid cumbersome matrix inverse operations and improve computing speed, the generalized approximate message passing technique was used and embedded in the variational Bayesian framework. Meanwhile, the damping is introduced into the algorithm to promote convergence. The experiments of open datasets show that the proposed method can achieve better prediction accuracy compared with the related matrix completion algorithm.
Keywords:collaborative filtering      matrix completion      generalized approximate massage passing      low-rank
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号