摘要
针对个性化推荐系统中协同过滤算法面对的矩阵稀疏和新使用者问题,提出基于矩阵分解与用户近邻模型的推荐算法。通过对用户档案信息构建近邻模型以保证新使用者预测的准确性;同时考虑到数据量大和矩阵稀疏会引起时间和空间复杂度过高等问题,引入奇异值矩阵分解的方式,从而减小矩阵稀疏和数据量大的影响,提高推荐系统的准确性。实验结果表明,该算法能有效解决大数据量的矩阵稀疏问题以及新使用者问题。
Concerning the difficulty of data sparsity and new user problems in many collaborative recommendation algorithms, a new collaborative recommendation algorithm based on matrix factorization and user nearest neighbor was proposed. To guarantee the prediction accuracy of the new users, the user nearest neighbor model based on user data and profile information was used. Meanwhile, large data sets and the problem of matrix sparsity would significantly increase the time and space complexity. Therefore, matrix factorization was introduced to alleviate the effect of data problems and improve the prediction accuracy. The experimental results show that the new algorithm can improve the recommendation accuracy effectivelv, and solve the Droblems of data sparsity and new user.
出处
《计算机应用》
CSCD
北大核心
2012年第2期395-398,共4页
journal of Computer Applications
基金
国家自然科学基金资助项目(61103069
71171148
70771077)
上海市信息化发展专项资金项目(200901015)
关键词
协同过滤
矩阵分解
用户近邻模型
电子商务
推荐算法
collaborative filtering
matrix factorization
user nearest neighbor model
E-commerce
recommendationalgorithm