针对新用户冷启动问题的改进Epsilon-greedy算法  

Improved Epsilon-greedy Algorithm for Cold-start Problem of New Users

作　　者：王素琴[1] 张洋[1] 蒋浩[2] 朱登明[2] WANG Suqin;ZHANG Yang;JIANG Hao;ZHU Dengming(School of Control and Computer Engineering,North China Electric Power University,Beijing 102206,China;Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100080,China)

机构地区：[1]华北电力大学控制与计算机工程学院,北京102206 [2]中国科学院计算技术研究所,北京100080

出　　处：《计算机工程》2018年第11期172-177,共6页Computer Engineering

基　　金：国家自然科学基金"逼真稳定的服装动画方法研究"(61300131);北京市共建项目(2014JG48)

摘　　要：在解决新用户冷启动问题时,固定不变的Epsilon参数会使传统Epsilon-greedy算法收敛缓慢。为此,提出一种改进的Epsilon-greedy算法。利用免疫反馈模型动态调整Epsilon参数,从而使算法快速收敛。使用蒙特卡罗模拟方法对算法进行实验验证,结果表明,该算法能够在用户与推荐系统交互较少的情况下为用户进行有效推荐,且推荐效果优于传统的Epsilon-greedy、Softmax和UCB算法。When solving the cold-start problem of new users,fixed and invariant Epsilon parameters will slow the convergence of traditional Epsilon-greedy algorithm.Therefore,an improved Epsilon-greedy algorithm is proposed.Immune feedback model is used to dynamically adjust the Epsilon parameters so that the algorithm converges quickly.Monte Carlo simulation is used to validate the proposed algorithm.Results show that this algorithm can effectively recommend to users when they have little interaction with the recommendation system,and the recommendation effect is better than the traditional Epsilon-greedy algorithm,Softmax algorithm and UCB algorithm.

关 键 词：推荐系统 冷启动 Epsilon-greedy算法 免疫反馈模型 bandit算法 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]