The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Dynamic Recurrent Model for Next Basket Recommendation
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
BPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
Factorizing personalized Markov chains for next-basket recommendation
Rendle, S., Freudenthaler, C., & Schmidt-Thieme, L. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772773 · Cited by 2,692
Extensions of recurrent neural network language model
Mikolov, T., Kombrink, S., Burget, L., Cernocky, J., & Khudanpur, S. (2011) · 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2011.5947611 · Cited by 1,568
Learning Representations by Back-Propagating Errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (2002) · Cognitive Modeling · doi:10.7551/mitpress/1888.003.0013 · Cited by 759
Learning Hierarchical Representation Model for NextBasket Recommendation
Wang, P., Guo, J., Lan, Y., Xu, J., Wan, S., & Cheng, X. (2015) · Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/2766462.2767694 · Cited by 411
Sequential Click Prediction for Sponsored Search with Recurrent Neural Networks
Zhang, Y., Dai, H., Xu, C., Feng, J., Wang, T., Bian, J., Wang, B., & Liu, T.-Y. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8917 · Cited by 337
Playlist prediction via metric embedding
Chen, S., Moore, J. L., Turnbull, D., & Joachims, T. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339643 · Cited by 282
Cited by
BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer
Sun, F., Liu, J., Wu, J., Pei, C., Lin, X., Ou, W., & Jiang, P. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3357895 · Cited by 2,558
Deep Interest Evolution Network for Click-Through Rate Prediction
Zhou, G., Mou, N., Fan, Y., Pi, Q., Bian, W., Zhou, C., Zhu, X., & Gai, K. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33015941 · Cited by 1,099
STAMP: Short-Term Attention/Memory Priority Model for Session-based Recommendation
Liu, Q., Zeng, Y., Mokhosi, R., & Zhang, H. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219950 · Cited by 960
Self-citationSequence-Aware Recommender Systems
Quadrana, M., Cremonesi, P., & Jannach, D. (2019) · ACM Computing Surveys · doi:10.1145/3190616 · Cited by 504
Sequential Recommendation with User Memory Networks
Chen, X., Xu, H., Zhang, Y., Tang, J., Cao, Y., Qin, Z., & Zha, H. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159668 · Cited by 498
Metadata
- Authors
- Yu, F., Liu, Q., Wu, S., Wang, L., & Tan, T.
- Venue
- Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2016-07-07
- Pages
- 729-732
- OpenAlex
- W2474909202
- Cited by
- 486
- References
- 11
- FWCI
- 34.47
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Dynamic Recurrent Model for Next Basket Recommendation. https://app.cochat.ai/papers/10.1145/2911451.2914683
- The paper
- Yu, F., Liu, Q., Wu, S., Wang, L., & Tan, T. (2016). A Dynamic Recurrent Model for Next Basket Recommendation. Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval. https://doi.org/10.1145/2911451.2914683
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.