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

基于遗忘函数和领域最近邻的混合推荐研究
引用本文:朱国玮,周利.基于遗忘函数和领域最近邻的混合推荐研究[J].管理科学学报,2012,15(5):55-64.
作者姓名:朱国玮  周利
作者单位:湖南大学工商管理学院,长沙,410082
基金项目:国家自然科学基金资助项目,教育部人文社会科学基金资助项目,教育部博士点基金新教师资助项目
摘    要:基于内容过滤和协同过滤是两大最为经典的推荐算法,但基于内容过滤存在新用户问题,没有考虑用户兴趣变化对推荐质量的影响,协同过滤则面临严峻的数据稀疏性和冷启动的挑战.针对这些,提出混合推荐算法:基于非线性逐步遗忘函数建立用户兴趣模型,预测用户未评价商品评分;引入"领域最近邻"处理方法查找目标用户的最近邻,预测未评价商品评分,以此为基础做出推荐.实验结果表明,本文方法能有效提高推荐质量.

关 键 词:混合推荐  非线性逐步遗忘  领域最近邻

Hybrid recommendation based on forgetting curve and domain nearest neighbor
ZHU Guo-wei , ZHOU Li.Hybrid recommendation based on forgetting curve and domain nearest neighbor[J].Journal of Management Sciences in China,2012,15(5):55-64.
Authors:ZHU Guo-wei  ZHOU Li
Institution:School of Business Administration,Hunan University,Changsha 410082,China
Abstract:Content-based filtering and collaborative filtering are the two most classical algorithms in recommendation system.However,there is the new customer problem in content filtering which does not consider the influences of users’ interests drifting on recommendation quality.And collaborative filtering faces severe challenges of data sparisity and cold start.To solve these problems,a hybrid recommendation algorithm is proposed in this paper.First,the paper builds a Customer Interests Model(CIM) based on the Forgetting Curve to predict the unevaluated rating;then introduces the processing method of "domain nearest neighbor" to find the nearest neighbors for target users to predict the unevaluated rating;and finally,makes the recommendation.The experimental results show that the proposed method can improve the recommendation quality effectively.
Keywords:hybrid recommendation  non-lineal gradual forgetting  domain nearest neighbor
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《管理科学学报》浏览原始摘要信息
点击此处可从《管理科学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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