期刊文献+

基于Hash的Top-N推荐方法

Top-N recommender method based on Hash strategy
下载PDF
导出
摘要 针对电子商务数据量大、用户寻找有用信息困难的现状,提出了基于Hash的Top-N推荐方法.通过两步骤Hash策略,并利用主成分分析(PCA)法,将数据降维后再通过k-means聚类量化;然后运用协同过滤,以二进制码对应实值的Manhattan距离度量用户相似性;最后计算推荐项的预测评分,将推荐列表中的前N项作为最终的推荐项目呈现给用户.结果表明:命中率(HR)与平均命中等级倒数(ARHR)的结果较好,该方法能够有效地进行个性化推荐. For today' s large volume e-commerce data,and difficulties from the users while finding useful information,it was proposed Top-N recommended method based on Hash strategy. By adopting the two stepHash strategy,using the principal component analysis(PCA) to reduce the dimension of dataset,quantifying the dataset,using collaborative filtering to calculate the user and item similarity and prediction score,the top N items were selected and presented to the recommended list as final recommendations for the users. The result showed that the effect of HR and ARHR was better,the proposed method was effective for personalized recommendation.
出处 《浙江师范大学学报(自然科学版)》 CAS 2018年第1期56-63,共8页 Journal of Zhejiang Normal University:Natural Sciences
基金 国家自然科学基金资助项目(61672467 61272007) 浙江省自然科学基金资助项目(LY14F030008 2015C31095)
关键词 Hash学习 主成分分析 推荐系统 协同过滤 K-MEANS聚类 Manhattan距离 Hash learning principal component analysis recommendation system collaborative filtering k-means clustering Manhattan distance
  • 相关文献

参考文献3

二级参考文献57

  • 1Mayer-Sch?nberger V, Cukier K. Big Data: A Revolution That Will Transform How We Live, Work, and Think. Boston: Eamon Dolan/Houghton Mifflin Harcourt, 2013.
  • 2Hey T, Tansley S, Tolle K. The Fourth Paradigm: Data-Intensive Scientific Discovery. Redmond: Microsoft Research, 2009.
  • 3Bryant R E. Data-intensive scalable computing for scientific applications. Comput Sci Engin, 2011, 13: 25-33.
  • 4周志华. 机器学习与数据挖掘. 中国计算机学会通讯, 2007, 3: 35-44.
  • 5Zhou Z H, Chawla N V, Jin Y, et al. Big data opportunities and challenges: Discussions from data analytics perspectives. IEEE Comput Intell Mag, 2014, 9: 62-74.
  • 6Jordan M. Message from the president: The era of big data. ISBA Bull, 2011, 18: 1-3.
  • 7Kleiner A, Talwalkar A, Sarkar P, et al. The big data bootstrap. In: Proceedings of the 29th International Conference on Machine Learning (ICML), Edinburgh, 2012, 1759-1766.
  • 8Shalev-Shwartz S, Zhang T. Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. In: Proceedings of the 31st International Conference on Machine Learning (ICML), Beijing, 2014, 64-72.
  • 9Gonzalez J E, Low Y, Gu H, et al. PowerGraph: Distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI), Hollywood, 2012, 17-30.
  • 10Gao W, Jin R, Zhu S, et al. One-pass AUC optimization. In: Proceedings of the 30th International Conference on Machine Learning (ICML), Atlanta, 2013, 906-914.

共引文献61

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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