期刊文献+

一种结合有效降维和K-means聚类的协同过滤推荐模型 被引量:15

Collaborative filtering recommendation model based on effective dimension reduction and K-means clustering
下载PDF
导出
摘要 为了克服"维灾"所带来的问题,提出一种基于主成分分析的维数约简方法,并在转换后的低维向量空间上进行K-means聚类算法,以减少目标用户的最近邻搜索范围,代替在超高维空间上逐一寻找最近邻的过程。实验结果证明了新算法的有效性,特别在目标用户的历史评价信息较少的情况下,也能有较好的预测精度。 To address the curse of dimensionality, this paper proposed a new hybrid recommendation model which imposed principal components analysis technique combined with K-means clustering. In the approach, the clusters generated from the relatively low dimension vector space transformed by PCA step, and then used for neighborhood selection in order to alternate the exiting K-nearest neighbor searching in high dimensions. The experiment results indicate that the proposed model can produce better prediction quality and higher efficiency. Especially, when the target visitor with few historic information comes, it performs more robust.
作者 郁雪 李敏强
出处 《计算机应用研究》 CSCD 北大核心 2009年第10期3718-3720,3762,共4页 Application Research of Computers
基金 高等学校博士学科点专项科研基金资助项目(20020056047)
关键词 协同过滤 主成分分析 维数约简 K-MEANS聚类 collaborative filtering principle components analysis(PCA) dimension reduction K-means clustering
  • 相关文献

参考文献11

  • 1BREESE J S, HECHERMAN D, KADIE C. Empirical analysis of predictive algorithms for collaborative filtering [ C]//Proc of the 14th Conference Uncertainty in Artificial Intelligence. San Francisco: Morgan Kaufmann, 1998:43-52.
  • 2XUE G, LIN C, YANG Q, et al. Scalable collaborative filtering using cluster-based smoothing[ C ]//Proc of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Brizil: ACM Press,2005 : 114-121.
  • 3KOHRS A, MERIALDO B. Clustering for collaborative filtering applications[ C ]//Proc of CIMCA'99. [ S. l. ] :IOS Press, 1999.
  • 4王辉,高利军,王听忠.个性化服务中基于用户聚类的协同过滤推荐[J].计算机应用,2007,27(5):1225-1227. 被引量:43
  • 5SARWAR B, KARYPIS G, KONSTAN J,et al. Application of dimensionality reduction in recommender system:a case study [ C ]//Proc of ACM WebKDD 2000 Web Mining for E-Commerce Workshop. Boston, MA : ACM Press ,2000:82- 90.
  • 6GOLDBERG K,ROEDER T, GUPTA D,et al. Eigentaste: a constant time collaborative filtering algorithm [ J ]. Information Retrieval Journal,2001,4(2) : 133-151.
  • 7SARWAR B, KARYPIS G, KONSTAN J,et al. Item-based collaborative filtering recommendation algorithms [ C ]//Proc of the 10th International Conference on World Wide Web. New York: ACM Press, 2001:285-295.
  • 8邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法[J].软件学报,2003,14(9):1621-1628. 被引量:554
  • 9约翰逊RA,威克恩DW.实用多元统计分析[M].陆璇,葛余博,赵衡秀,等译.北京:清华大学出版社,2005.
  • 10Han J W Kamber M 范明 孟小峰译.数据挖掘概念与技术[M].北京:机械工业出版杜,2001.147-158.

二级参考文献18

  • 1邓爱林,左子叶,朱扬勇.基于项目聚类的协同过滤推荐算法[J].小型微型计算机系统,2004,25(9):1665-1670. 被引量:146
  • 2周军锋,汤显,郭景峰.一种优化的协同过滤推荐算法[J].计算机研究与发展,2004,41(10):1842-1847. 被引量:102
  • 3Brccsc 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.
  • 4Goldberg D, Nichols D, Oki BM, Terry D. Using collaborative filtering to weave an information tapestry. Communications of the ACM, 1992,35(12):61~70.
  • 5Resnick 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.
  • 6Shardanand 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.
  • 7Hill 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.
  • 8Sarwar 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.
  • 9Chickering D, Hecherman D. Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables.Machine Learning, 1997,29(2/3): 181~212.
  • 10Dempster A, Laird N, Rubin D. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 1977,B39:1~38.

共引文献700

同被引文献135

引证文献15

二级引证文献92

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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