首页> 中文期刊> 《国际计算机前沿大会会议论文集》 >Interest-Forgetting Markov Model for Next-Basket Recommendation

Interest-Forgetting Markov Model for Next-Basket Recommendation

         

摘要

cqvip:Recommendation systems provide users with ranked items based on individual’s preferences. Two types of preferences are commonly used to generate ranking lists: long-term preferences which are relatively stable and short-term preferences which are constantly changeable. But short-term preferences have an important real-time impact on individual’s current preferences. In order to predict personalized sequential patterns, the long-term user preferences and the short-term variations in preference need to be jointly considered for both personalization and sequential transitions. In this paper, a IFNR model is proposed to leverage long-term and short-term preferences for Next-Basket recommendation. In IFNR, similarity was used to represent long-term preferences. Personalized Markov model was exploited to mine short-term preferences based on individual’s behavior sequences. Personalized Markov transition matrix is generally very sparse, and thus it integrated Interest-Forgetting attribute, social trust relation and item similarity into personalized Markov model. Experimental results are on two real data sets, and show that this approach can improve the quality of recommendations compared with the existed methods.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号