一种基于和声搜索的协同过滤算法研究  

Research of a Collaborative Filtering Algorithm Based on Harmony Search

作　　者：王华秋[1] 

机构地区：[1]重庆理工大学计算机学院,重庆400054

出　　处：《现代图书情报技术》2012年第12期79-84,共6页New Technology of Library and Information Service

基　　金：教育部人文社会科学研究青年基金项目"虚拟专用网环境下图书馆服务多引擎专家系统的研制"(项目编号:10YJC870037)的研究成果之一

摘　　要：改进传统的相似度计算方法,为寻找最优的相似度函数,采用参数优化的和声搜索算法来寻找相似度函数的最优权值向量。为提高推荐速度,得到最优的相似度函数后,对于用户的推荐计算不再采用和声搜索算法。实验表明,和传统算法相比,该算法能提高预测精度和覆盖率,有更好的推荐效果,并能够更快地获得目标用户的最邻近用户,加快推荐的速度。The traditional similarity algorithm of collaborative filtering is modified in this paper. In order to find an opti- mal similarity function, the paper presents harmony search algorithm with parameters optimization to find the optimal weights vector of similarity function. To improve the speed of recommendation, harmony search algorithm is no longer used for the calculation of the recommendation after finding the optimal similarity function. The validation experiments show that the proposed algorithm improves prediction accuracy and coverage so as to provide better recommendation. And the pro- posed algorithm can more quickly obtain the nearest neighbor users of the target user, which can accelerate the recommen- ded speed.

关 键 词：协同过滤相似度函数权值向量和声搜索算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]