The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Intent Contrastive Learning for Sequential Recommendation
Open accessAbstract
Users’ interactions with items are driven by various intents (e.g., preparing for holiday gifts, shopping for fishing equipment, etc.). However, users’ underlying intents are often unobserved/latent, making it challenging to leverage such latent intents for Sequential recommendation (SR). To investigate the benefits of latent intents and leverage them effectively for recommendation, we propose Intent Contrastive Learning (ICL), a general learning paradigm that leverages a latent intent variable into SR. The core idea is to learn users’ intent distribution functions from unlabeled user behavior sequences and optimize SR models with contrastive self-supervised learning (SSL) by considering the learnt intents to improve recommendation. Specifically, we introduce a latent variable to represent users’ intents and learn the distribution function of the latent variable via clustering. We propose to leverage the learnt intents into SR models via contrastive SSL, which maximizes the agreement between a view of sequence and its corresponding intent. The training is alternated between intent representation learning and the SR model optimization steps within the generalized expectation-maximization (EM) framework. Fusing user intent information into SR also improves model robustness. Experiments conducted on four real-world datasets demonstrate the superiority of the proposed learning paradigm, which improves performance, and robustness against data sparsity and noisy interaction issues 1.
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
Momentum Contrast for Unsupervised Visual Representation Learning
He, K., Fan, H., Wu, Y., Xie, S., & Girshick, R. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00975 · Cited by 13,347
LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., & Wang, M. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401063 · Cited by 4,430
Neural Graph Collaborative Filtering
Wang, X., He, X., Wang, M., Feng, F., & Chua, T.-S. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331267 · Cited by 3,823
Supervised Contrastive Learning
Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., & Krishnan, D. (2020) · arXiv · doi:10.48550/arxiv.2004.11362 · Cited by 3,569 · cited 1×
“Contrastive Self-Supervised Learning (SSL) has brought much attentions by different research communities including CV [2, 4, 9, 14, 20] and NLP [7, 8, 29, 50], as well as recommendation [44, 45, 47, 51].”
BackgroundRendle, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.127 · Cited by 3,189
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-citationSimCSE: Simple Contrastive Learning of Sentence Embeddings
Gao, T., Yao, X., & Chen, D. (2021) · Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2021.emnlp-main.552 · Cited by 2,851
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
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
“Cloze Procedure”: A New Tool for Measuring Readability
Taylor, W. L. (1953) · Journalism Quarterly · doi:10.1177/107769905303000401 · Cited by 2,332
Image-Based Recommendations on Styles and Substitutes
McAuley, J., Targett, C., Shi, Q., & van den Hengel, A. (2015) · Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/2766462.2767755 · Cited by 2,280
Self-citationPersonalized 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
Self-supervised Graph Learning for Recommendation
Wu, J., Wang, X., Feng, F., He, X., Chen, L., Lian, J., & Xie, X. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3462862 · Cited by 1,488
S3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximization
Zhou, K., Wang, H., Zhao, W. X., Zhu, Y., Wang, S., Zhang, F., Wang, Z., & Wen, J.-R. (2020) · Proceedings of the 29th ACM International Conference on Information & Knowledge Management · doi:10.1145/3340531.3411954 · Cited by 789
Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation
He, R., & McAuley, J. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0030 · Cited by 769
Self-citationRecurrent Recommender Networks
Wu, C.-Y., Ahmed, A., Beutel, A., Smola, A. J., & Jing, H. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018689 · Cited by 713
On Sampled Metrics for Item Recommendation
Krichene, W., & Rendle, S. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403226 · Cited by 495
Multi-Interest Network with Dynamic Routing for Recommendation at Tmall
Li, C., Liu, Z., Wu, M., Xu, Y., Zhao, H., Huang, P., Kang, G., Chen, Q., Li, W., & Lee, D. L. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3357814 · Cited by 380
Self-citationControllable 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
An Unsupervised Sentence Embedding Method by Mutual Information Maximization
Zhang, Y., He, R., Liu, Z., Lim, K. H., & Bing, L. (2020) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.124 · Cited by 231
Self-citationDisentangled Self-Supervision in Sequential Recommenders
Ma, J., Zhou, C., Yang, H., Cui, P., Wang, X., & Zhu, W. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403091 · Cited by 225
Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformer
Fan, Z., Liu, Z., Zhang, J., Xiong, Y., Zheng, L., & Yu, P. S. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3482242 · Cited by 181
Self-citationWang, S., Hu, L., Wang, Y., Sheng, Q. Z., Orgun, M. A., & Cao, L. (2019) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/523 · Cited by 147
CosRec: 2D Convolutional Neural Networks for Sequential Recommendation
Yan, A., Cheng, S., Kang, W.-C., Wan, M., & McAuley, J. (2019) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3357384.3358113 · Cited by 146
Self-citationLightweight Self-Attentive Sequential Recommendation
Li, Y., Chen, T., Zhang, P.-F., & Yin, H. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482448 · Cited by 119
Attentive Sequential Models of Latent Intent for Next Item Recommendation
Tanjim, M. M., Su, C., Benjamin, E., et al. (2020) · doi:10.1145/3366423.3380002 · Cited by 103
Category-aware Collaborative Sequential Recommendation
Cai, R., Wu, J., San, A., Wang, C., & Wang, H. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3462832 · Cited by 97
Intention-Aware Sequential Recommendation With Structured Intent Transition
Li, H., Wang, X. Y., Zhang, Z., Ma, J., Cui, P., & Zhu, W. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3050571 · Cited by 78
Basket Recommendation with Multi-Intent Translation Graph Neural Network
Liu, Z., Li, X., Fan, Z., Guo, S. D., Achan, K., & Yu, P. S. (2020) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata50022.2020.9377917 · Cited by 67
Self-citationPURE: Positive-Unlabeled Recommendation with Generative Adversarial Network
Zhou, Y., Xu, J., Wu, J., Taghavi, Z., Körpeoğlu, E., Achan, K., & He, J. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467234 · Cited by 56
Learning Transferrable Parameters for Long-tailed Sequential User Behavior Modeling
Yin, J., Liu, C., Wang, W., Sun, J., & Hoi, S. C. H. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403078 · Cited by 25
Cited by
Self-supervised learning for recommender systems: A survey
Yu, J., Yin, H., Xia, X., Chen, T., Li, J., & Huang, Z. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3282907 · Cited by 413
“ICL [77] has a similar pipeline, but it is designed for sequential recommendation where the semantic prototypes are modeled as user intents and the belonged sequence is a local view of the prototype.”
BackgroundSelf-citationDisentangled Contrastive Collaborative Filtering
Ren, X., Xia, L., Zhao, J., Yin, D., & Huang, C. (2023) · Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3539618.3591665 · Cited by 171
“Recently, contrastive learning (CL) has gained considerable attention in various recommendation scenarios, such as sequential recommendation [9], knowledge graph-enhanced recommendation [51], multi-interest recommendation [47] and multi-behavior recommendation [38].”
Background
Metadata
- Authors
- Chen, Y., Liu, Z., Li, J., McAuley, J., & Xiong, C.
- Venue
- Proceedings of the ACM Web Conference 2022
- Publisher
- ACM
- Published
- 2022-04-25
- Pages
- 2172-2182
- OpenAlex
- W4224316819
- Cited by
- 410
- References
- 31
- FWCI
- 77.73
- 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.