首页 | 本学科首页   官方微博 | 高级检索  
     

基于二阶段相似度学习的协同过滤推荐算法
引用本文:沈 键,杨煜普.基于二阶段相似度学习的协同过滤推荐算法[J].计算机应用研究,2013,30(3):715-719.
作者姓名:沈 键  杨煜普
作者单位:上海交通大学 自动化系 系统控制与信息处理教育部重点实验室,上海,200240
基金项目:国家“863”计划资助项目(2011AA040605)
摘    要:针对传统的基于最近邻协同过滤推荐算法中计算相似度存在的缺陷,提出了一种基于二阶段相似度学习的协同过滤推荐算法,该算法旨在通过较少的迭代计算改善推荐算法性能。它以既约梯度法迭代寻优为主、最近邻算法为辅,通过邻居的海选和精选,最终提高了相似度的计算精度,改善了误差性能。实验表明,在一定条件下该算法不仅在误差性能上优于传统的推荐算法,而且其算法收敛速度快,可实现相似度参数动态调整和分布式计算。

关 键 词:二阶段  相似度学习  协同过滤  既约梯度法  K-最近邻算法

Collaborative filtering recommendation algorithmbased on two stages of similarity learning
SHEN Jian,YANG Yu-pu.Collaborative filtering recommendation algorithmbased on two stages of similarity learning[J].Application Research of Computers,2013,30(3):715-719.
Authors:SHEN Jian  YANG Yu-pu
Affiliation:Key Laboratory of System Control & Information Processing, Ministry of Education of China, Dept. of Automation, Shanghai Jiaotong University, Shanghai 200240, China
Abstract:In order to improve the accuracy of similarity calculation and recommendation performance in the traditional collaborative filtering recommender system, this paper proposed a collaborative filtering recommendation algorithm based on two stages of similarity learning. The algorithm took advantage of the nearest neighbor algorithm on the first stage to get candidate neighbors and used the reduced gradient method on the second stage to learn similarity. Eventually, the algorithm achieved a higher accuracy of similarity. The experimental results show that the proposed algorithm, on some conditions, not only outperforms the traditional method in terms of the error performance, but also has a fast convergence speed, which can make dynamic similarity adjustment and distributed calculation possible.
Keywords:two stages  similarity learning  collaborative filtering  reduced gradient method  K-nearest neighbor(K-NN)
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号