中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A HIDDEN SEMI-MARKOV APPROACH FOR TIME-DEPENDENT RECOMMENDATION

文献类型:会议论文

作者Zhang, Haidong; Ni, Wancheng; Li, Xin; Yang, Yiping
出版日期2016
会议日期2016-6-27
会议地点Taiwan, China
关键词Hidden Semi-markov Model Time Dependent Recommendation Collaborative Filtering Recommender System
英文摘要

Recommender systems are widely used for suggesting books, education materials, and products to users by exploring their behaviors. In reality, users’ preferences often change over time, which leads to the studies on time-dependent recommender systems. However, most existing approaches to deal with time information remain primitive. In this paper, we extend existing methods and propose a hidden semi-Markov model to track the change of users’ interests. Particularly, this model allows for users to stay in different (latent) interest states for different time periods, which is beneficial to model the heterogeneous length of users’ interest and focuses. We derive an EM algorithm to estimate the parameter of the framework, and predict users’ actions. Experiments on a real-world dataset show that our model significantly outperforms the state-of-the-art benchmark methods. Further analyses show that the performance depends on the allowed heterogeneity of latent states and the existence of user interest heterogeneity in the dataset.

会议录Pacific Asia Conference on Information Systems 2016 Proceedings
源URL[http://ir.ia.ac.cn/handle/173211/13026]  
专题自动化研究所_综合信息系统研究中心
通讯作者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, China
4.Institute of Automation, Chinese Academy of Sciences, Beijing, China
推荐引用方式
GB/T 7714
Zhang, Haidong,Ni, Wancheng,Li, Xin,et al. A HIDDEN SEMI-MARKOV APPROACH FOR TIME-DEPENDENT RECOMMENDATION[C]. 见:. Taiwan, China. 2016-6-27.

入库方式: OAI收割

来源:自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。