Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/2969442.2969629guideproceedingsArticle/Chapter ViewAbstractPublication PagesnipsConference Proceedingsconference-collections
Article

Time-sensitive recommendation from recurrent user activities

Published: 07 December 2015 Publication History

Abstract

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.

References

[1]
O. Aalen, O. Borgan, and H. Gjessing. Survival and event history analysis: a process point of view. Springer, 2008.
[2]
L. Baltrunas and X. Amatriain. Towards time-dependant recommendation based on implicit feedback, 2009.
[3]
E. C. Chi and T. G. Kolda. On tensors, sparsity, and nonnegative factorizations, 2012.
[4]
D. Cox and V. Isham. Point processes, volume 12. Chapman & Hall/CRC, 1980.
[5]
D. Cox and P. Lewis. Multivariate point processes. Selected Statistical Papers of Sir David Cox: Volume 1, Design of Investigations, Statistical Methods and Applications, 1:159, 2006.
[6]
D. Daley and D. Vere-Jones. An introduction to the theory of point processes: volume II: general theory and structure, volume 2. Springer, 2007.
[7]
N. Du, M. Farajtabar, A. Ahmed, A. J. Smola, and L. Song. Dirichlet-hawkes processes with applications to clustering continuous-time document streams. In KDD'15, 2015.
[8]
N. Du, L. Song, A. Smola, and M. Yuan. Learning networks of heterogeneous influence. In Advances in Neural Information Processing Systems 25, pages 2789-2797, 2012.
[9]
N. Du, L. Song, H. Woo, and H. Zha. Uncover topic-sensitive information diffusion networks. In Artificial Intelligence and Statistics (AISTATS), 2013.
[10]
A. G. Hawkes. Spectra of some self-exciting and mutually exciting point processes. Biometrika, 58(1):83-90, 1971.
[11]
K. Kapoor, K. Subbian, J. Srivastava, and P. Schrater. Just in time recommendations: Modeling the dynamics of boredom in activity streams. WSDM, pages 233-242, 2015.
[12]
K. Kapoor, M. Sun, J. Srivastava, and T. Ye. A hazard based approach to user return time prediction. In KDD'14, pages 1719-1728, 2014.
[13]
A. Karatzoglou, X. Amatriain, L. Baltrunas, and N. Oliver. Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering. In Proceeedings of the 4th ACM Conference on Recommender Systems (RecSys), 2010.
[14]
J. Kingman. On doubly stochastic poisson processes. Mathematical Proceedings of the Cambridge Philosophical Society, pages 923-930, 1964.
[15]
N. Koenigstein, G. Dror, and Y. Koren. Yahoo! music recommendations: Modeling music ratings with temporal dynamics and item taxonomy. In Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys '11, pages 165-172, 2011.
[16]
Y. Koren. Collaborative filtering with temporal dynamics. In Knowledge discovery and data mining KDD, pages 447-456, 2009.
[17]
G. Lan. An optimal method for stochastic composite optimization. Mathematical Programming, 2012.
[18]
G. Lan. The complexity of large-scale convex programming under a linear optimization oracle. arXiv preprint arxiv:1309.5550v2, 2014.
[19]
Y. Ogata. On lewis' simulation method for point processes. Information Theory, IEEE Transactions on, 27(1):23-31, 1981.
[20]
H. Ouyang, N. He, L. Q. Tran, and A. Gray. Stochastic alternating direction method of multipliers. In ICML, 2013.
[21]
J. Z. J. L. Preeti Bhargava, Thomas Phan. Who, what, when, and where: Multi-dimensional collaborative recommendations using tensor factorization on sparse user-generated data. In WWW, 2015.
[22]
Y. Wang, R. Chen, J. Ghosh, J. Denny, A. Kho, Y. Chen, B. Malin, and J. Sun. Rubik: Knowledge guided tensor factorization and completion for health data analytics. In KDD, 2015.
[23]
S. Rendle. Time-Variant Factorization Models Context-Aware Ranking with Factorization Models. volume 330 of Studies in Computational Intelligence, chapter 9, pages 137-153. 2011.
[24]
S. Sastry. Some np-complete problems in linear algebra. Honors Projects, 1990.
[25]
L. Xiong, X. Chen, T.-K. Huang, J. G. Schneider, and J. G. Carbonell. Temporal collaborative filtering with bayesian probabilistic tensor factorization. In SDM, pages 211-222. SIAM, 2010.
[26]
X. Yi, L. Hong, E. Zhong, N. N. Liu, and S. Rajan. Beyond clicks: Dwell time for personalization. In Proceedings of the 8th ACM Conference on Recommender Systems, RecSys '14, pages 113-120, 2014.
[27]
A. W. Yu, W. Ma, Y. Yu, J. G. Carbonell, and S. Sra. Efficient structured matrix rank minimization. In NIPS, 2014.
[28]
A. N. Zaid Harchaoui, Anatoli Juditsky. Conditional gradient algorithms for norm-regularized smooth convex optimization. Mathematical Programming, 2013.
[29]
K. Zhou, H. Zha, and L. Song. Learning social infectivity in sparse low-rank networks using multidimensional hawkes processes. In Artificial Intelligence and Statistics (AISTATS), 2013.
[30]
K. Zhou, H. Zha, and L. Song. Learning triggering kernels for multi-dimensional hawkes processes. In International Conference on Machine Learning (ICML), 2013.

Cited By

View all
  • (2021)Time-Aware Recommender System via Continuous-Time ModelingProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482202(2872-2876)Online publication date: 26-Oct-2021
  • (2019)Modeling Item-Specific Temporal Dynamics of Repeat Consumption for Recommender SystemsThe World Wide Web Conference10.1145/3308558.3313594(1977-1987)Online publication date: 13-May-2019
  • (2019)Coupled Variational Recurrent Collaborative FilteringProceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3292500.3330940(335-343)Online publication date: 25-Jul-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
NIPS'15: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 2
December 2015
3626 pages

Publisher

MIT Press

Cambridge, MA, United States

Publication History

Published: 07 December 2015

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 04 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Time-Aware Recommender System via Continuous-Time ModelingProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482202(2872-2876)Online publication date: 26-Oct-2021
  • (2019)Modeling Item-Specific Temporal Dynamics of Repeat Consumption for Recommender SystemsThe World Wide Web Conference10.1145/3308558.3313594(1977-1987)Online publication date: 13-May-2019
  • (2019)Coupled Variational Recurrent Collaborative FilteringProceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3292500.3330940(335-343)Online publication date: 25-Jul-2019
  • (2019)Adversarial Substructured Representation Learning for Mobile User ProfilingProceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3292500.3330869(130-138)Online publication date: 25-Jul-2019
  • (2019)Recurrent Recommendation with Local CoherenceProceedings of the Twelfth ACM International Conference on Web Search and Data Mining10.1145/3289600.3291024(564-572)Online publication date: 30-Jan-2019
  • (2019)Predicting Consumption Patterns with Repeated and Novel EventsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2018.283213231:2(371-384)Online publication date: 1-Feb-2019
  • (2018)Online continuous-time tensor factorization based on pairwise interactive point processesProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3305064(2905-2911)Online publication date: 13-Jul-2018
  • (2018)Z-transforms and its inference on partially observable point processesProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3304989(2369-2375)Online publication date: 13-Jul-2018
  • (2018)Dynamic Bayesian logistic matrix factorization for recommendation with implicit feedbackProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304222.3304249(3463-3469)Online publication date: 13-Jul-2018
  • (2018)Recurrent Spatio-Temporal Point Process for Check-in Time PredictionProceedings of the 27th ACM International Conference on Information and Knowledge Management10.1145/3269206.3272003(2203-2211)Online publication date: 17-Oct-2018
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media