The DOI matches its Crossref record; 92 of the 92 references it cites were found in a registry or an index.
Sequence-Aware Recommender Systems
Open accessAbstract
Recommender systems are one of the most successful applications of data mining and machine-learning technology in practice. Academic research in the field is historically often based on the matrix completion problem formulation, where for each user-item-pair only one interaction (e.g., a rating) is considered. In many application domains, however, multiple user-item interactions of different types can be recorded over time. And, a number of recent works have shown that this information can be used to build richer individual user models and to discover additional behavioral patterns that can be leveraged in the recommendation process. In this work, we review existing works that consider information from such sequentially ordered user-item interaction logs in the recommendation process. Based on this review, we propose a categorization of the corresponding recommendation tasks and goals, summarize existing algorithmic solutions, discuss methodological approaches when benchmarking what we call sequence-aware recommender systems, and outline open challenges in the area.
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
Glove: Global Vectors for Word Representation
Pennington, J., Socher, R., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1162 · Cited by 34,071
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
Chung, J., Gulcehre, C., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.3555 · Cited by 11,008
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Evaluating collaborative filtering recommender systems
Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963772 · Cited by 5,798 · cited 1×
“Typically, most of the ranking metric are highly correlated when evaluated with a fixed-size split and their choice does not largely affect the outcomes [24, 44].”
BackgroundAgrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
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
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
Cited by
Deep Learning Based Recommender System: A Survey and New Perspectives
Zhang, S., Yao, L., Sun, A., & Tay, Y. (2020) · ACM Computing Surveys · doi:10.1145/3285029 · Cited by 3,485
Graph Neural Networks in Recommender Systems: A Survey
Wu, S., Sun, F., Zhang, W., Xie, X., & Cui, B. (2023) · ACM Computing Surveys · doi:10.1145/3535101 · Cited by 1,326
A Survey on Session-based Recommender Systems
Wang, S., Cao, L., Wang, Y., Sheng, Q. Z., Orgun, M. A., & Lian, D. (2022) · ACM Computing Surveys · doi:10.1145/3465401 · Cited by 570
Reinforcement Learning based Recommender Systems: A Survey
Afsar, M. M., Crump, T., & Far, B. (2023) · ACM Computing Surveys · doi:10.1145/3543846 · Cited by 502
Are we really making much progress? A worrying analysis of recent neural recommendation approaches
Ferrari Dacrema, M., Cremonesi, P., & Jannach, D. (2019) · Proceedings of the 13th ACM Conference on Recommender Systems · doi:10.1145/3298689.3347058 · Cited by 431
Self-citationWu, L., He, X., Wang, X., Zhang, K., & Wang, M. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3145690 · Cited by 413
Evaluation of session-based recommendation algorithms
Ludewig, M., & Jannach, D. (2018) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-018-9209-6 · Cited by 336
Self-citationDeep Learning for Sequential Recommendation: Algorithms, Influential Factors, and Evaluations
Fang, H., Zhang, D., Shu, Y., & Guo, G. (2021) · ACM Transactions on Information Systems · doi:10.1145/3426723 · Cited by 287
Evaluating Recommender Systems: Survey and Framework
Zangerle, E., & Bauer, C. (2023) · ACM Computing Surveys · doi:10.1145/3556536 · Cited by 283
Recommender Systems Leveraging Multimedia Content
Deldjoo, Y., Schedl, M., Cremonesi, P., & Pasi, G. (2021) · ACM Computing Surveys · doi:10.1145/3407190 · Cited by 258
Self-citationGeography-Aware Sequential Location Recommendation
Lian, D., Wu, Y., Ge, Y., Xie, X., & Chen, E. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403252 · Cited by 253
Mekruksavanich, S., & Jitpattanakul, A. (2021) · Electronics · doi:10.3390/electronics10141685 · Cited by 138
Palomares, I., Porcel, C., Pizzato, L., Guy, I., & Herrera-Viedma, E. (2021) · Information Fusion · doi:10.1016/j.inffus.2020.12.001 · Cited by 109
Rahmani, H. A., Deldjoo, Y., & di Noia, T. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.117700 · Cited by 48
Optical Flow Estimation with Deep Learning, a Survey on Recent Advances
Savian, S., Elahi, M., & Tillo, T. (2020) · Unsupervised and Semi-Supervised Learning · doi:10.1007/978-3-030-32583-1_12 · Cited by 29
Towards Automatic Discovering of Deep Hybrid Network Architecture for Sequential Recommendation
Cheng, M., Liu, Z., Liu, Q., Ge, S., & Chen, E. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512066 · Cited by 26
The Influence of Media Bias on News Recommender Systems
Ruan, Q., Mac Namee, B., & Dong, R. (2023) · Proceedings of the 31st ACM Conference on User Modeling, Adaptation and Personalization · doi:10.1145/3565472.3595619 · Cited by 4
Metadata
- Authors
- Quadrana, M., Cremonesi, P., & Jannach, D.
- Venue
- ACM Computing Surveys
- Published
- 2018-07-06
- Volume
- 51
- Issue
- 4
- Pages
- 1-36
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2886209086
- Cited by
- 504
- References
- 92
- FWCI
- 93.60
- Type
- journal article
- Language
- en
- Open access
- green
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.