The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Learning Hierarchical Representation Model for NextBasket Recommendation
Abstract
Next basket recommendation is a crucial task in market basket analysis. Given a user's purchase history, usually a sequence of transaction data, one attempts to build a recommender that can predict the next few items that the user most probably would like. Ideally, a good recommender should be able to explore the sequential behavior (i.e., buying one item leads to buying another next), as well as account for users' general taste (i.e., what items a user is typically interested in) for recommendation. Moreover, these two factors may interact with each other to influence users' next purchase. To tackle the above problems, in this paper, we introduce a novel recommendation approach, namely hierarchical representation model (HRM). HRM can well capture both sequential behavior and users' general taste by involving transaction and user representations in prediction. Meanwhile, the flexibility of applying different aggregation operations, especially nonlinear operations, on representations allows us to model complicated interactions among different factors. Theoretically, we show that our model subsumes several existing methods when choosing proper aggregation operations. Empirically, we demonstrate that our model can consistently outperform the state-of-the-art baselines under different evaluation metrics on real-world transaction data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,877
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Amazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
Distributed Representations of Sentences and Documents
Le, Q. V., & Mikolov, T. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.4053 · Cited by 4,934
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
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
A Survey of Collaborative Filtering Techniques
Su, X., & Khoshgoftaar, T. M. (2009) · Advances in Artificial Intelligence · doi:10.1155/2009/421425 · Cited by 3,602
Collaborative Filtering for Implicit Feedback Datasets
Hu, Y., Koren, Y., & Volinsky, C. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.22 · Cited by 3,170
Mining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
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
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130374 · Cited by 1,444
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345545 · Cited by 967
Evaluation of Item-Based Top- N Recommendation Algorithms
Karypis, G. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502627 · Cited by 576
Efficient Adaptive-Support Association Rule Mining for Recommender Systems
Lin, W., Álvarez, S. A., & Ruiz, C. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1013284820704 · Cited by 406
Temporal recommendation on graphs via long- and short-term preference fusion
Xiang, L., Yuan, Q., Zhao, S., Chen, L., Zhang, X., Yang, Q., & Sun, J. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835896 · Cited by 374
International Journal of Soft Computing and Engineering
(2019) · International Journal of Soft Computing and Engineering · doi:10.35940/ijsce · Cited by 315
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
Deep Neural Network Language Models
Arısoy, E., Sainath, T. N., Kingsbury, B. E. D., & Ramabhadran, B. (2012) · Cited by 174
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
Pan, R., & Scholz, M. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557094 · Cited by 162
Mild, A., & Reutterer, T. (2003) · Journal of Retailing and Consumer Services · doi:10.1016/s0969-6989(03)00003-1 · Cited by 159
An MDP-based Recommender SystemPreprint
Shani, G., Brafman, R. I., & Heckerman, D. E. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.0600 · Cited by 155
User profiling in personal information agents: a survey
Godoy, D. L., & Amandi, A. (2005) · The Knowledge Engineering Review · doi:10.1017/s0269888906000397 · Cited by 126
Using Temporal Data for Making RecommendationsPreprint
Zimdars, A. L., Chickering, D. M., & Meek, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2320 · Cited by 116
Vanschoren, J., & Duivesteijn, W. (2012) · Cited by 73
Classification-based collaborative filtering using market basket data
LEE, J., JUN, C., LEE, J., & Kim, S. (2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2005.04.037 · Cited by 71
A Case-Based Recommendation Approach for Market Basket Data
Gatzioura, A., & Sànchez–Marrè, M. (2014) · IEEE Intelligent Systems · doi:10.1109/mis.2014.57 · Cited by 45
Modeling Retail Transaction Data for Personalized Shopping Recommendation
Wang, P., Guo, J., & Lan, Y. (2014) · doi:10.1145/2661829.2662020 · Cited by 32
Self-citation
Cited by
Self-Attentive Sequential Recommendation
Kang, W.-C., & McAuley, J. (2018) · 2018 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2018.00035 · Cited by 3,011
Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding
Tang, J., & Wang, K. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159656 · Cited by 1,975
Neural Attentive Session-based Recommendation
Li, J., Ren, P., Chen, Z., Ren, Z., Lian, T., & Ma, J. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132926 · Cited by 1,501
Neural Factorization Machines for Sparse Predictive Analytics
He, X., & Chua, T.-S. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080777 · Cited by 1,340
Predicting the Next Location: A Recurrent Model with Spatial and Temporal Contexts
Liu, Q., Wu, S., Wang, L., & Tan, T. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.9971 · Cited by 975
Metadata
- Authors
- Wang, P., Guo, J., Lan, Y., Xu, J., Wan, S., & Cheng, X.
- Venue
- Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2015-08-09
- Pages
- 403-412
- OpenAlex
- W1985854669
- Cited by
- 411
- References
- 30
- FWCI
- 22.80
- 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
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.