Recommendation System Based on Prediction of User Preference Changes

Time always exists in our lives and time data can easily be collected in a variety of applications. For example, when you purchase items online or click on an ad, the time at which you chose the item or clicked the ad is recorded. The analysis of time information can therefore be applied in various areas. It is important to note that user preferences change over time. For example, a person who watched animated TV shows in childhood will most likely switch to watching the news in adulthood. It is effective to incorporate such changes into recommender systems. In this paper, we propose an approach that predicts user preferences with consideration of preference changes by learning the order of purchase history in a recommender system. Our approach is composed of three steps. First, we obtain user features based on matrix factorization and purchasing time. Next, we use a Kalman filter to predict user preference vectors from user features. Finally, we generate a recommendation list, at which time we propose two types of recommendation methods using the predicted vectors. We then show through experiments using a real-world dataset that our approach outperforms competitive methods such as the first order Markov model.

[1]  Taghi M. Khoshgoftaar,et al.  A Survey of Collaborative Filtering Techniques , 2009, Adv. Artif. Intell..

[2]  Gediminas Adomavicius,et al.  Context-aware recommender systems , 2008, RecSys '08.

[3]  Guokun Lai,et al.  Daily-Aware Personalized Recommendation based on Feature-Level Time Series Analysis , 2015, WWW.

[4]  Alexandros Nanopoulos,et al.  Modeling the dynamics of user preferences in coupled tensor factorization , 2014, RecSys '14.

[5]  Iván Cantador,et al.  Time-aware recommender systems: a comprehensive survey and analysis of existing evaluation protocols , 2013, User Modeling and User-Adapted Interaction.

[6]  Bamshad Mobasher,et al.  Context adaptation in interactive recommender systems , 2014, RecSys '14.

[7]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[8]  G. James Blaine,et al.  Continuous Monitoring of Physiologic Variables with a Dedicated Minicomputer , 1975, Computer.

[9]  Param Vir Singh,et al.  A Hidden Markov Model for Collaborative Filtering , 2010, MIS Q..

[10]  Andrew McCallum,et al.  Topics over time: a non-Markov continuous-time model of topical trends , 2006, KDD '06.

[11]  Nuria Oliver,et al.  Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering , 2010, RecSys '10.

[12]  John D. Lafferty,et al.  Dynamic topic models , 2006, ICML.

[13]  Yehuda Koren,et al.  Collaborative filtering with temporal dynamics , 2009, KDD.

[14]  Bernd Ludwig,et al.  Matrix factorization techniques for context aware recommendation , 2011, RecSys '11.

[15]  Yifan Hu,et al.  Collaborative Filtering for Implicit Feedback Datasets , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[16]  Seong-Bae Park,et al.  A combination of temporal and general preferences for app recommendation , 2015, 2015 International Conference on Big Data and Smart Computing (BIGCOMP).

[17]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[18]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[19]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[20]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[21]  Jürgen Schmidhuber,et al.  Long Short-Term Memory , 1997, Neural Computation.