期刊文献+

基于矩阵分解与用户近邻模型的协同过滤推荐算法 被引量:51

Collaborative filtering and recommendation algorithm based on matrix factorization and user nearest neighbor model
下载PDF
导出
摘要 针对个性化推荐系统中协同过滤算法面对的矩阵稀疏和新使用者问题,提出基于矩阵分解与用户近邻模型的推荐算法。通过对用户档案信息构建近邻模型以保证新使用者预测的准确性;同时考虑到数据量大和矩阵稀疏会引起时间和空间复杂度过高等问题,引入奇异值矩阵分解的方式,从而减小矩阵稀疏和数据量大的影响,提高推荐系统的准确性。实验结果表明,该算法能有效解决大数据量的矩阵稀疏问题以及新使用者问题。 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
  • 相关文献

参考文献18

  • 1LINDEN G,SMITH B,YORK J.Amazon.corn recommendations:Item-to-item collaborative filtering[J].IEEE Internet Computing.2003,7(1):76-80.
  • 2ALI K,WIJNAND V S.TiVo:Making show recommendations using a distributed collaborative filtering architecture[C]//KDD'04:Proceedings of the 10th ACM SIGKDD Intemational Conference on Knowledge Discovery and Data Mining.New York:ACM,2004:394-401.
  • 3GOLDBERG K Y,ROEDER T,GUPTA D,et al.Eigentaste:A constant time collaborative filtering algorithm[J].Information Retrival,2001,4(2):133-151.
  • 4SALAKHUTDINOV R,MNIH A,HINTON G.Restricted Boltzmann machines for collaborative filtering[C]//Proceedings of the 24th International Conference on Machine Learning.New York:ACM,2007:791-798.
  • 5MARLIN B.Collaborative filtering:a machine learning perspective[D].Toronto:University of Toronto,2004.
  • 6SU X,KHOSHGOFTAAR T M.A survey of collaborative filtering techniques[J]. Advances in Artificial Intelligenee,2009,2009(4):421-445.
  • 7KOREN Y.Factorization meets the neighborhood:a multifaeeted collaborative filtering model[C]// Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM,2008:426-434.
  • 8HOFMANN T.Latent semantic models for collaborative filtering[J].ACM Transactions on Information Systems,2004,22(1):89-115.
  • 9BLEI D,NGA,JORDANM.Latent diriehlet allocation[J].Journal of Machine Learning Research,2003,3:993-1022.
  • 10DEERWESTER,DUMAIS S,FURNAS G W,et al.Indexing by latent semantic analysis[J].Journal of the Society for Information Science,1990,4(1):391-407.

二级参考文献65

  • 1秦国,杜小勇.基于用户层次信息的协同推荐算法[J].计算机科学,2004,31(10):138-140. 被引量:15
  • 2Brccsc J, Hcchcrman D, Kadic C. Empirical analysis of predictive algorithms for collaborative filtering. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI'98). 1998.43~52.
  • 3Goldberg D, Nichols D, Oki BM, Terry D. Using collaborative filtering to weave an information tapestry. Communications of the ACM, 1992,35(12):61~70.
  • 4Resnick P, lacovou N, Suchak M, Bergstrom P, Riedl J. Grouplens: An open architecture for collaborative filtering of netnews. In:Proceedings of the ACM CSCW'94 Conference on Computer-Supported Cooperative Work. 1994. 175~186.
  • 5Shardanand U, Mats P. Social information filtering: Algorithms for automating "Word of Mouth". In: Proceedings of the ACM CHI'95 Conference on Human Factors in Computing Systems. 1995. 210~217.
  • 6Hill W, Stead L, Rosenstein M, Furnas G. Recommending and evaluating choices in a virtual community of use. In: Proceedings of the CHI'95. 1995. 194~201.
  • 7Sarwar B, Karypis G, Konstan J, Riedl J. Item-Based collaborative filtering recommendation algorithms. In: Proceedings of the 10th International World Wide Web Conference. 2001. 285~295.
  • 8Chickering D, Hecherman D. Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables.Machine Learning, 1997,29(2/3): 181~212.
  • 9Dempster A, Laird N, Rubin D. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 1977,B39:1~38.
  • 10Thiesson B, Meek C, Chickering D, Heckerman D. Learning mixture of DAG models. Technical Report, MSR-TR-97-30, Redmond:Microsoft Research, 1997.

共引文献968

同被引文献414

引证文献51

二级引证文献297

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部