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

基于Bregman联合聚类与加权矩阵分解的 融合推荐算法
引用本文:郭蕊,孙福振,王绍卿,张进,王帅,方春.基于Bregman联合聚类与加权矩阵分解的 融合推荐算法[J].科学技术与工程,2019,19(8).
作者姓名:郭蕊  孙福振  王绍卿  张进  王帅  方春
作者单位:山东理工大学计算机科学与技术学院,淄博,255049;山东理工大学计算机科学与技术学院,淄博,255049;山东理工大学计算机科学与技术学院,淄博,255049;山东理工大学计算机科学与技术学院,淄博,255049;山东理工大学计算机科学与技术学院,淄博,255049;山东理工大学计算机科学与技术学院,淄博,255049
基金项目:国家自然科学基金(No.61841602)、山东省自然科学基金(No.ZR2018PF005)、山东省高等学校优秀骨干教师国际合作培养项目
摘    要:针对当前大数据背景下推荐系统中所存在推荐效率低下、扩展性差、推荐质量不高等问题,本文提出一种基于Bregman联合聚类与加权矩阵分解的融合推荐算法(CO-CWMA)。首先,通过Bregman联合聚类挖掘出多样、不同层次的低秩评分子矩阵,组合不同约束与距离的聚类结果训练得到子模型,进而在各个模型的子矩阵上并发地进行矩阵分解,最后将各个子模型进行均值融合,提高推荐质量、效率与扩展性。在矩阵分解阶段采用SVD++算法,基于每个子矩阵中的评分分布计算加权策略,给予高频评分较大权值,在梯度下降阶段利用学习率函数控制学习率的更新。实验结果表明,该算法与三种基线算法相比在均方根误差(RMSE)与平均绝对误差(MAE)上均有明显降低,即推荐质量有较大提升。

关 键 词:联合聚类  矩阵分解  学习率函数  SVD++  加权策略  均值融合
收稿时间:2018/9/26 0:00:00
修稿时间:2019/1/8 0:00:00

A Fusion Recommendation Algorithm based on Bregman Co-clustering and weighted Matrix Approximation
GUO RUI and.A Fusion Recommendation Algorithm based on Bregman Co-clustering and weighted Matrix Approximation[J].Science Technology and Engineering,2019,19(8).
Authors:GUO RUI and
Institution:School of Computer Science and Technology, Shandong University of Technology,
Abstract:Aiming at the problems of low recommendation efficiency, recommendation quality and poor expansibility in the recommendation system, a fusion recommendation algorithm based on Bregman co-clustering and weighted matrix approximation (CO-CWMA) was proposed. Firstly, the Bregman co-clustering was used to mine the low-rank sub-matrices of different levels, clustering results of different constraints and distances were combined to train the sub-models, then the matrix approximation was performed concurrently on the sub-matrices of each model. Finally, each sub-model performed mean fusion to improve recommendation quality, efficiency and scalability. SVD++ algorithm was used in the matrix approximation stage, weighting strategy was calculated based on the score distribution, and high-frequency score got a larger weight. Learning rate function was used to control the learning rate during the gradient descent phase. Experimental results show that the proposed algorithm has a significant reduction in root mean square error (RMSE) and mean absolute error (MAE) compared with the three baseline algorithms, that is, recommended quality is greatly improved.
Keywords:co-clustering    matrix approximation    learning rate function    SVD++    weighting strategy    fusion average
本文献已被 万方数据 等数据库收录!
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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