A Dynamic Recurrent Model for Next Basket Recommendation
Lists
Only you see this
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.
BibTeX
@inproceedings{yu2016dynamic,
author = {Feng Yu and Qiang Liu and Shu Wu and Liang Wang and Tieniu Tan},
title = {{A Dynamic Recurrent Model for Next Basket Recommendation}},
booktitle = {International ACM SIGIR Conference on Research and Development in Information Retrieval},
year = {2016},
doi = {10.1145/2911451.2914683},
}Loading related content...