Time-Sensitive Recommendation From Recurrent User Activities

By making personalized suggestions, a recommender system is playing a crucial role in improving the engagement of users in modern web-services. However, most recommendation algorithms do not explicitly take into account the temporal behavior and the recurrent activities of users. Two central but less explored questions are how to recommend the most desirable item at the right moment, and how to predict the next returning time of a user to a service. To address these questions, we propose a novel framework which connects self-exciting point processes and low-rank models to capture the recurrent temporal patterns in a large collection of user-item consumption pairs. We show that the parameters of the model can be estimated via a convex optimization, and furthermore, we develop an efficient algorithm that maintains O(1/∊) convergence rate, scales up to problems with millions of user-item pairs and hundreds of millions of temporal events. Compared to other state-of-the-arts in both synthetic and real datasets, our model achieves superb predictive performance in the two time-sensitive recommendation tasks. Finally, we point out that our formulation can incorporate other extra context information of users, such as profile, textual and spatial features.

[1]  Le Song,et al.  Uncover Topic-Sensitive Information Diffusion Networks , 2013, AISTATS.

[2]  Le Song,et al.  Learning Social Infectivity in Sparse Low-rank Networks Using Multi-dimensional Hawkes Processes , 2013, AISTATS.

[3]  P. Grambsch Survival and Event History Analysis: A Process Point of View by AALEN, O. O., BORGAN, O., and GJESSING, H. K. , 2009 .

[4]  J. Kingman On doubly stochastic Poisson processes , 1964, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  Yaoliang Yu,et al.  Efficient Structured Matrix Rank Minimization , 2014, NIPS.

[6]  Yosihiko Ogata,et al.  On Lewis' simulation method for point processes , 1981, IEEE Trans. Inf. Theory.

[7]  A. Hawkes Spectra of some self-exciting and mutually exciting point processes , 1971 .

[8]  Alexander G. Gray,et al.  Stochastic Alternating Direction Method of Multipliers , 2013, ICML.

[9]  Linas Baltrunas,et al.  Towards Time-Dependant Recommendation based on Implicit Feedback , 2009 .

[10]  Daryl J. Daley,et al.  Introduction to the General Theory of Point Processes , 1998 .

[11]  Le Song,et al.  Learning Triggering Kernels for Multi-dimensional Hawkes Processes , 2013, ICML.

[12]  Daryl J. Daley,et al.  An Introduction to the Theory of Point Processes , 2013 .

[13]  Zaïd Harchaoui,et al.  Conditional gradient algorithms for norm-regularized smooth convex optimization , 2013, Math. Program..

[14]  Santhosh R. Sastry Some NP-Complete Problems in Linear Algebra , 1990 .

[15]  Jiayu Zhou,et al.  Who, What, When, and Where: Multi-Dimensional Collaborative Recommendations Using Tensor Factorization on Sparse User-Generated Data , 2015, WWW.

[16]  Jaideep Srivastava,et al.  Just in Time Recommendations: Modeling the Dynamics of Boredom in Activity Streams , 2015, WSDM.

[17]  P. A. W. Lewis,et al.  Multivariate point processes , 2018, Point Processes.

[18]  Suju Rajan,et al.  Beyond clicks: dwell time for personalization , 2014, RecSys '14.

[19]  Jimeng Sun,et al.  Rubik: Knowledge Guided Tensor Factorization and Completion for Health Data Analytics , 2015, KDD.

[20]  Yehuda Koren,et al.  Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy , 2011, RecSys '11.

[21]  Le Song,et al.  Dirichlet-Hawkes Processes with Applications to Clustering Continuous-Time Document Streams , 2015, KDD.

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

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

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

[25]  Guanghui Lan The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle , 2013, 1309.5550.

[26]  Tamara G. Kolda,et al.  On Tensors, Sparsity, and Nonnegative Factorizations , 2011, SIAM J. Matrix Anal. Appl..

[27]  Guanghui Lan,et al.  An optimal method for stochastic composite optimization , 2011, Mathematical Programming.

[28]  Steffen Rendle,et al.  Context-Aware Ranking with Factorization Models , 2010, Studies in Computational Intelligence.

[29]  Le Song,et al.  Learning Networks of Heterogeneous Influence , 2012, NIPS.

[30]  Mingxuan Sun,et al.  A hazard based approach to user return time prediction , 2014, KDD.