mlsanityData to 7 Oct 2026

End-to-end Learnable Clustering for Intent Learning in Recommendation

arXiv 2401.05975 ↗First posted 11 Jan 2024cs.IR cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

Intent learning, which aims to learn users' intents for user understanding and item recommendation, has become a hot research spot in recent years. However, existing methods suffer from complex and cumbersome alternating optimization, limiting performance and scalability. To this end, we propose a novel intent learning method termed underlineELCRec, by unifying behavior representation learning into an underlineEnd-to-end underlineLearnable underlineClustering framework, for effective and efficient underlineRecommendation. Concretely, we encode user behavior sequences and initialize the cluster centers (latent intents) as learnable neurons. Then, we design a novel learnable clustering module to separate different cluster centers, thus decoupling users' complex intents. Meanwhile, it guides the network to learn intents from behaviors by forcing behavior embeddings close to cluster centers. This allows simultaneous optimization of recommendation and clustering via mini-batch data. Moreover, we propose intent-assisted contrastive learning by using cluster centers as self-supervision signals, further enhancing mutual promotion. Both experimental results and theoretical analyses demonstrate the superiority of ELCRec from six perspectives. Compared to the runner-up, ELCRec improves NDCG@5 by 8.9% and reduces computational costs by 22.5% on the Beauty dataset. Furthermore, due to the scalability and universal applicability, we deploy this method on the industrial recommendation system with 130 million page views and achieve promising results. The codes are available on GitHub (https://github.com/yueliu1999/ELCRec). A collection (papers, codes, datasets) of deep group recommendation/intent learning methods is available on GitHub (https://github.com/yueliu1999/Awesome-Deep-Group-Recommendation).

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 75 of its 156 references that are in the map. First posted on arXiv 11 Jan 2024.

Builds on

75 of 156 references.

References · 75

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  3. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  4. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  5. 2018Self-Attentive Sequential Recommendationcited by 1,169
  6. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
  7. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  8. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  9. 2015Image-based Recommendations on Styles and Substitutescited by 702
  10. 2017Dynamic Routing Between Capsulescited by 689
  11. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  12. 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 636
38 more
  1. 2019Self-labelling via simultaneous clustering and representation learningcited by 525
  2. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  3. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  4. 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
  5. 2020Contrastive Clusteringcited by 264
  6. 2016Joint Unsupervised Learning of Deep Representations and Image Clusterscited by 205
  7. 2023Recommender Systems with Generative Retrievalcited by 191
  8. 2014Recurrent Neural Network Regularizationcited by 189
  9. 2016Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendationcited by 152
  10. 2019Attributed Graph Clustering: A Deep Attentional Embedding Approachcited by 149
  11. 2021Contrastive Learning for Representation Degeneration Problem in Sequential Recommendationcited by 121
  12. 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 113
  13. 2022Learning Vector-Quantized Item Representation for Transferable Sequential Recommenderscited by 112
  14. 2021Deep Graph Clustering via Dual Correlation Reductioncited by 97
  15. 2022Filter-enhanced MLP is All You Need for Sequential Recommendationcited by 96
  16. 2022Self-Supervised Learning for Recommender Systems: A Surveycited by 95
  17. 2020Controllable Multi-Interest Framework for Recommendationcited by 92
  18. 2022Intent Contrastive Learning for Sequential Recommendationcited by 90
  19. 2021Sequential Recommendation with Graph Neural Networkscited by 89
  20. 2021Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformercited by 69
  21. 2022Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminationcited by 67
  22. 2022Open-world Semantic Segmentation via Contrasting and Clustering Vision-Language Embeddingcited by 67
  23. 2022Hard Sample Aware Network for Contrastive Deep Graph Clusteringcited by 61
  24. 2023Cluster-guided Contrastive Graph Clustering Networkcited by 60
  25. 2021Contrastive Self-supervised Sequential Recommendation with Robust Augmentationcited by 56
  26. 2022Simple Contrastive Graph Clusteringcited by 56
  27. 2022DeepDPM: Deep Clustering With an Unknown Number of Clusterscited by 52
  28. 2021Augmenting Sequential Recommendation with Pseudo-Prior Items via Reversely Pre-training Transformercited by 45
  29. 2023Debiased Contrastive Learning for Sequential Recommendationcited by 38
  30. 2023Dink-Net: Neural Clustering on Large Graphscited by 38
  31. 2019CosRec: 2D Convolutional Neural Networks for Sequential Recommendationcited by 37
  32. 2022Sequential Recommendation via Stochastic Self-Attentioncited by 37
  33. 2024Plug-in Diffusion Model for Sequential Recommendationcited by 37
  34. 2022Self-supervised Heterogeneous Graph Pre-training Based on Structural Clusteringcited by 30
  35. 2023gSASRec: Reducing Overconfidence in Sequential Recommendation Trained with Negative Samplingcited by 29
  36. 2021Unsupervised Visual Representation Learning by Online Constrained K-Meanscited by 27
  37. 2022A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resourcecited by 26
  38. 2022DeepCut: Unsupervised Segmentation using Graph Neural Networks Clusteringcited by 25

50 most cited of 75 All 75 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 2; 2026: 4.

10 papers.