Probabilistic temporal bilinear model for temporal dynamic recommender systems

User preferences for products are constantly drifting over time as product perception and popularity are changing when new fashions or products emerge. Therefore, the ability to model the tendency of both user preferences and product attractiveness is vital to the design of recommender systems (RSs). However, conventional methods in RSs are incapable of modeling such a tendency accordingly, leading to unsatisfactory recommendation performance in many real-world deployments. In this paper, we develop a novel probabilistic temporal bilinear model for RSs, exploiting both temporal properties and dynamic information in user preferences and item attractiveness derived from the users' feedback over items, to simultaneously track latent factors that represent user preferences and item attractiveness. A learning and inference algorithm combining a sequential Monte Carlo method and the EM algorithm for this model is also developed to tackle the top-k recommendation problem over time. The proposed model is evaluated on three benchmark datasets. The experimental results demonstrate that our proposed model significantly outperforms a variety of existing methods for top-k recommendation.

[1]  Harald Steck,et al.  Training and testing of recommender systems on data missing not at random , 2010, KDD.

[2]  P. Bickel,et al.  Obstacles to High-Dimensional Particle Filtering , 2008 .

[3]  James Bennett,et al.  The Netflix Prize , 2007 .

[4]  Jeff A. Bilmes,et al.  A gentle tutorial of the em algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models , 1998 .

[5]  Deepak Agarwal,et al.  Fast online learning through offline initialization for time-sensitive recommendation , 2010, KDD.

[6]  Rajesh P. N. Rao,et al.  Probabilistic bilinear models for appearance-based vision , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[7]  Roberto Turrin,et al.  Performance of recommender algorithms on top-n recommendation tasks , 2010, RecSys '10.

[8]  Inderjit S. Dhillon,et al.  A spatio-temporal approach to collaborative filtering , 2009, RecSys '09.

[9]  Ee-Peng Lim,et al.  Modeling Temporal Adoptions Using Dynamic Matrix Factorization , 2013, 2013 IEEE 13th International Conference on Data Mining.

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

[11]  Neil J. Gordon,et al.  A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking , 2002, IEEE Trans. Signal Process..

[12]  Xi Chen,et al.  Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization , 2010, SDM.

[13]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[14]  Bracha Shapira,et al.  Recommender Systems Handbook , 2015, Springer US.

[15]  Andrew Gordon Wilson,et al.  Generalised Wishart Processes , 2010, UAI.

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

[17]  Wei Chu,et al.  Personalized recommendation on dynamic content using predictive bilinear models , 2009, WWW '09.

[18]  Ruslan Salakhutdinov,et al.  Bayesian probabilistic matrix factorization using Markov chain Monte Carlo , 2008, ICML '08.

[19]  Nipa Chowdhury,et al.  Self-training Temporal Dynamic Collaborative Filtering , 2014, PAKDD.

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

[21]  Mao Ye,et al.  Exploring social influence for recommendation: a generative model approach , 2012, SIGIR '12.