Feng Yu
Shu Wu
ABSTRACT
Next basket recommendation becomes an increasing concern. Most conventional models explore either sequential transaction features or general interests of users. Further, some works treat users' general interests and sequential behaviors as two totally divided matters, and then combine them in some way for next basket recommendation. Moreover, the state-of-the-art models are based on the assumption of Markov Chains (MC), which only capture local sequential features between two adjacent baskets. In this work, we propose a novel model, Dynamic REcurrent bAsket Model (DREAM), based on Recurrent Neural Network (RNN). DREAM not only learns a dynamic representation of a user but also captures global sequential features among baskets. The dynamic representation of a specific user can reveal user's dynamic interests at different time, and the global sequential features reflect interactions of all baskets of the user over time. Experiment results on two public datasets indicate that DREAM is more effective than the state-of-the-art models for next basket recommendation.
- G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. TKDE, 17(6):734--749, 2005. Google Scholar
Digital Library
- S. Chen, J. L. Moore, D. Turnbull, and T. Joachims. Playlist prediction via metric embedding. In SIGKDD, pages 714--722, 2012. Google ScholarDigital Library
- A. Gatzioura and M. Sanchez-Marre. A case-based recommendation approach for market basket data. IEEE Intelligent Systems, 30(1):20--27, 2015.Google ScholarDigital Library
- Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, (8):30--37, 2009. Google ScholarDigital Library
- T. Mikolov, S. Kombrink, L. Burget, J. H. Černocky, and S. Khudanpur. Extensions of recurrent neural network language model. In ICASSP, pages 5528--5531, 2011.Google ScholarCross Ref
- S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. Bpr: Bayesian personalized ranking from implicit feedback. In UAI, pages 452--461, 2009. Google ScholarDigital Library
- S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme. Factorizing personalized markov chains for next-basket recommendation. In WWW, pages 811--820, 2010. Google ScholarDigital Library
- D. E. Rumelhart, G. E. Hinton, and R. J. Williams. Learning representations by back-propagating errors. Cognitive modeling, 5:3, 1988.Google Scholar
- P. Wang, J. Guo, Y. Lan, J. Xu, S. Wan, and X. Cheng. Learning hierarchical representation model for nextbasket recommendation. In SIGIR, pages 403--412, 2015. Google ScholarDigital Library
- Y. Zhang, H. Dai, C. Xu, J. Feng, T. Wang, J. Bian, B. Wang, and T.-Y. Liu. Sequential click prediction for sponsored search with recurrent neural networks. In AAAI, pages 1369--1376, 2014. Google ScholarDigital Library
Index Terms
- A Dynamic Recurrent Model for Next Basket Recommendation
Recommendations
The World is Binary: Contrastive Learning for Denoising Next Basket Recommendation
SIGIR '21: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information RetrievalNext basket recommendation aims to infer a set of items that a user will purchase at the next visit by considering a sequence of baskets he/she has purchased previously. This task has drawn increasing attention from both the academic and industrial ...
An Attribute-aware Neural Attentive Model for Next Basket Recommendation
SIGIR '18: The 41st International ACM SIGIR Conference on Research & Development in Information RetrievalNext basket recommendation is a new type of recommendation, which recommends a set of items, or a basket, to the user. Purchase in basket is a common behavior of consumers. Recently, deep neural networks have been applied to model sequential ...
Learning to Ride a Buy-Cycle: A Hyper-Convolutional Model for Next Basket Repurchase Recommendation
RecSys '22: Proceedings of the 16th ACM Conference on Recommender SystemsThe problem of Next Basket Recommendation (NBR) addresses the challenge of recommending items for the next basket of a user, based on her sequence of prior baskets. In this paper, we focus on a variation of this problem in which we aim to predict ...
Comments