基于联合聚类和矩阵分解的协同过滤算法研究  

Collaborative filtering algorithm based on co-clustering and matrix decomposition

作　　者：赵广艳[1] 李禹生[1] 韩昊[1] 

机构地区：[1]武汉轻工大学数学与计算机学院,湖北武汉430023

出　　处：《武汉轻工大学学报》2014年第2期60-63,共4页Journal of Wuhan Polytechnic University

摘　　要：提出了基于联合聚类和带正则化的迭代最小二乘法的协同过滤算法。该算法对原始矩阵进行用户—项目两个维度的联合聚类生成若干子矩阵,子矩阵的规模远小于原始评分矩阵,可有效降低预测阶段计算量,而且也缓解了数据稀疏性问题。在子矩阵中通过对传统的矩阵分解进行正则化约束来防止模型过拟合现象,并采用迭代最小二乘法进行训练分解模型,可有效缓解可扩展性。实验表明,该方法具有高效性。This paper proposes a collaborative filtering algorithm based on co-clustering and alternating-least-squares with weighted-regularization .The algorithm divides the original matrix into several sub-matrix,and the sub-matrix is much smaller than the size of the original scoring matrix , which not only reduces the amount of computation , but also alleviates the problem of data sparsity .In the sub-matrix by using regularization constraint to prevent model from over fitting and by using least-squares method to train decomposition model ,the scalability can be effectively alleviated .The experiments show that this method is efficient .

关 键 词：协同过滤 联合聚类 稀疏性 最小二乘法 评分预测 

分 类 号：TP391.4[自动化与计算机技术—计算机应用技术]