The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation
Open accessAbstract
Predicting personalized sequential behavior is a key task for recommender systems. In order to predict user actions such as the next product to purchase, movie to watch, or place to visit, it is essential to take into account both long-term user preferences and sequential patterns (i.e., short-term dynamics). Matrix Factorization and Markov Chain methods have emerged as two separate but powerful paradigms for modeling the two respectively. Combining these ideas has led to unified methods that accommodate long-and short-term dynamics simultaneously by modeling pairwise user-item and item-item interactions. In spite of the success of such methods for tackling dense data, they are challenged by sparsity issues, which are prevalent in real-world datasets. In recent years, similarity-based methods have been proposed for (sequentially-unaware) item recommendation with promising results on sparse datasets. In this paper, we propose to fuse such methods with Markov Chains to make personalized sequential recommendations. We evaluate our method, Fossil, on a variety of large, real-world datasets. We show quantitatively that Fossil outperforms alternative algorithms, especially on sparse datasets, and qualitatively that it captures personalized dynamics and is able to make meaningful recommendations.
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
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
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
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772
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
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852
(2011) · Springer eBooks · doi:10.1007/978-0-387-85820-3 · Cited by 3,761
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
Social information filtering: algorithms for automating “word of mouth”
Shardanand, U., & Maes, P. (1995) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '95 · doi:10.1145/223904.223931 · Cited by 2,823
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
GroupLens: applying collaborative filtering to Usenet news
Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., Gordon, L. R., & Riedl, J. (1997) · Communications of the ACM · doi:10.1145/245108.245126 · Cited by 2,367
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
Self-citationBERT4Rec: 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
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
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
Contrastive Learning for Sequential Recommendation
Xie, X., Sun, F., Liu, Z., Wu, S., Gao, J., Zhang, J., Ding, B., & Cui, B. (2022) · 2022 IEEE 38th International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00099 · Cited by 663
Time Interval Aware Self-Attention for Sequential Recommendation
Li, J., Wang, Y., & McAuley, J. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371786 · Cited by 649
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
Bao, K., Zhang, J., Zhang, Y., Wang, W., Feng, F., & He, X. (2023) · Proceedings of the 17th ACM Conference on Recommender Systems · doi:10.1145/3604915.3608857 · Cited by 469
Intent Contrastive Learning for Sequential Recommendation
Chen, Y., Liu, Z., Li, J., McAuley, J., & Xiong, C. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512090 · Cited by 410
Self-citationSTAN: Spatio-Temporal Attention Network for Next Location Recommendation
Luo, Y., Liu, Q., & Liu, Z. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3449998 · Cited by 383
Sequential Recommender System based on Hierarchical Attention Networks
Ying, H., Zhuang, F., Zhang, F., Liu, Y., Xu, G., Xie, X., Xiong, H., & Wu, J. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/546 · Cited by 367
Controllable Multi-Interest Framework for Recommendation
Cen, Y., Zhang, J., Zou, X., Zhou, C., Yang, H., & Tang, J. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403344 · Cited by 338
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
Hierarchical Gating Networks for Sequential Recommendation
Ma, C., Kang, P., & Liu, X. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330984 · Cited by 322
Deep 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
Adapting Large Language Models by Integrating Collaborative Semantics for Recommendation
Zheng, B., Hou, Y., Lu, H., Chen, Y., Zhao, W. X., Chen, M., & Wen, J.-R. (2024) · 2024 IEEE 40th International Conference on Data Engineering (ICDE) · doi:10.1109/icde60146.2024.00118 · Cited by 143
A Generic Federated Recommendation Framework via Fake Marks and Secret Sharing
Lin, Z., Pan, W., Yang, Q., & Ming, Z. (2023) · ACM Transactions on Information Systems · doi:10.1145/3548456 · Cited by 44
Metadata
- Authors
- He, R., & McAuley, J.
- Venue
- 2016 IEEE 16th International Conference on Data Mining (ICDM)
- Publisher
- IEEE
- Published
- 2016-12
- Pages
- 191-200
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2964296635
- Cited by
- 769
- References
- 26
- FWCI
- 25.36
- Type
- conference paper
- 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.