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

基于双重阈值近邻查找的协同过滤算法
引用本文:李颖,李永丽,蔡观洋.基于双重阈值近邻查找的协同过滤算法[J].吉林大学学报(信息科学版),2013,31(6):647-653.
作者姓名:李颖  李永丽  蔡观洋
作者单位:吉林师范大学计算机学院,吉林四平,136000;东北师范大学计算机科学与信息技术学院,长春,130117;吉林大学计算机科学与技术学院,长春,130012
摘    要:为了提高协同过滤算法的推荐精度, 从协同过滤算法中近邻用户/项目组的选择入手, 提出基于双重阈值近邻查找的协同过滤算法。该算法能充分利用现有的稀疏用户项目评分矩阵, 找出与目标用户相关性较强, 且能参与到评分预测过程中的候选用户。实验结果表明, 该算法相比传统的协同过滤算法及部分改进算法, 其推荐精度有一定提高, 对实际应用具有一定的参考价值。

关 键 词:协同过滤  稀疏矩阵  个性化推荐  双重阈值

Dual-Threshold Neighbors Finding Method for Neighborhood-Based Collaborative Filtering
LI Ying,LI Yong-li,CAI Guan-yang.Dual-Threshold Neighbors Finding Method for Neighborhood-Based Collaborative Filtering[J].Journal of Jilin University:Information Sci Ed,2013,31(6):647-653.
Authors:LI Ying  LI Yong-li  CAI Guan-yang
Abstract:In order to improve the accuracy of collaborative filtering, the paper proposes a new collaborative filtering based on thedual-threshold neighbors finding method in the perspective of how to find the truly relevant user/item group. This method can take full advantage of existing sparse user-rate matrix to find some users or items which are strong relative to the active user/item, and they can participate in the progress of calculating predicate rate. The experimental results show that the recommendation accuracyof the new algorithm is better than traditional collaborative filtering and some improved algorithms.
Keywords:collaborative filtering  sparse matrix  personalized recommendation  dual-threshold  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《吉林大学学报(信息科学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(信息科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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