A Survey of Latent Factor Models in Recommender Systems
arXiv:2405.18068 · doi:10.1016/j.inffus.2024.102905
Abstract
Recommender systems are essential tools in the digital era, providing personalized content to users in areas like e-commerce, entertainment, and social media. Among the many approaches developed to create these systems, latent factor models have proven particularly effective. This survey systematically reviews latent factor models in recommender systems, focusing on their core principles, methodologies, and recent advancements. The literature is examined through a structured framework covering learning data, model architecture, learning strategies, and optimization techniques. The analysis includes a taxonomy of contributions and detailed discussions on the types of learning data used, such as implicit feedback, trust, and content data, various models such as probabilistic, nonlinear, and neural models, and an exploration of diverse learning strategies like online learning, transfer learning, and active learning. Furthermore, the survey addresses the optimization strategies used to train latent factor models, improving their performance and scalability. By identifying trends, gaps, and potential research directions, this survey aims to provide valuable insights for researchers and practitioners looking to advance the field of recommender systems.
References in corpus (23)
- Adam: A Method for Stochastic Optimization
- A Comprehensive Survey on Graph Neural Networks
- Representation Learning with Contrastive Predictive Coding
- An overview of gradient descent optimization algorithms
- Self-supervised Graph Learning for Recommendation
- Graph Convolutional Matrix Completion
- Explainable Recommendation: A Survey and New Perspectives
- Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
- A Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets
- LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
- Efficiently Summarising Event Sequences with Rich Interleaving Patterns
- Hard Negative Mixing for Contrastive Learning
- Algorithms for multi-armed bandit problems
- AutoSVD++: An Efficient Hybrid Collaborative Filtering Model via Contractive Auto-encoders
- SelfCF: A Simple Framework for Self-supervised Collaborative Filtering
- Graph Kernels: A Survey
- Contrastive Self-supervised Sequential Recommendation with Robust Augmentation
- Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendation
- Contrastive Learning for Recommender System
- Binarized Collaborative Filtering with Distilling Graph Convolutional Networks
- Weighted-SVD: Matrix Factorization with Weights on the Latent Factors
- Recent Developments in Recommender Systems: A Survey
- Deoscillated Graph Collaborative Filtering