Modeling Idle Customers to Tackle the Sparsity Problem in Time-dependent Recommendation
文献类型:会议论文
作者 | Zhang, Haidong![]() ![]() ![]() |
出版日期 | 2016 |
会议日期 | 2016-12-11 |
会议地点 | Dublin, Ireland |
关键词 | Recommender Systems Data Sparsity Collaborative Filtering Hidden Markov Model |
英文摘要 |
Recommender systems have been widely used to provide personal and convenient services for users. As one of successful recommendation methods, collaborative filtering explores users’ interests from item consumptions. However, it suffers from the data sparsity problem that most users have interacted with a small number of items. Particularly, data sparsity causes the discontinuous user activities over time, which limits the time-dependent recommendation methods for tracking users’ changing interests. In this paper, we extend existing methods and propose an inhibited hidden Markov model to alleviate the sparsity problem. The model considers the statuses of users’ interests at each time unit and allows for capturing users’ dynamic interests under idle status. We derive an EM algorithm to estimate the model parameters and predict users’ actions. We perform a comprehensive experiment on the datasets of various sparsity levels. The results show our model has been consistently and significantly better than the state-of-the-art algorithms. |
会议录 | The 37th International Conference on Information Systems
![]() |
源URL | [http://ir.ia.ac.cn/handle/173211/13027] ![]() |
专题 | 自动化研究所_综合信息系统研究中心 |
通讯作者 | Zhang, Haidong |
作者单位 | 1.Institute of Automation, Chinese Academy of Sciences, Beijing, China 2.Institute of Automation, Chinese Academy of Sciences, Beijing, China 3.Department of Information Systems, City University of Hong Kong, Hong Kong 4.Institute of Automation, Chinese Academy of Sciences, Beijing, China |
推荐引用方式 GB/T 7714 | Zhang, Haidong,Ni, Wancheng,Li, Xin,et al. Modeling Idle Customers to Tackle the Sparsity Problem in Time-dependent Recommendation[C]. 见:. Dublin, Ireland. 2016-12-11. |
入库方式: OAI收割
来源:自动化研究所
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。