Recommender Systems: Collaborative Filtering & Matrix Factorization

Added:

Deep Learning and Session-Based Models (Overcoming Linear and Static Limitations)

While Collaborative Filtering (CF) and Matrix Factorization (MF) are foundational, they possess critical limitations. MF relies on linear inner products of latent factors, which fails to capture the highly complex, non-linear relationships of user-item interactions. Furthermore, traditional CF assumes static user preferences and struggles severely with the 'cold-start' problem when new users or items have no historical data. In response, the field has shifted toward Deep Learning (such as Neural Collaborative Filtering and Graph Neural Networks) to model intricate, non-linear user-item dynamics. Additionally, Session-Based and Sequential Recommendation models (utilizing RNNs or Transformers) challenge the static matrix assumption entirely. Rather than relying on long-term historical profiles, these alternative approaches analyze immediate, real-time sequences of actions to predict the next interaction. This represents a paradigm shift from static, linear dimension-reduction to dynamic, context-aware, and non-linear predictive modeling.

Basic linear algebra, including matrix multiplication, transposes, and vector dot products.
Fundamentals of machine learning optimization, specifically cost functions and gradient descent.
Concepts of supervised learning, particularly linear regression and feature representation.
Deep learning-based recommendation architectures, such as Neural Collaborative Filtering (NCF).
Handling implicit feedback datasets (e.g., clicks, views) using ranking loss functions like Bayesian Personalized Ranking (BPR).
Advanced strategies for mitigating the 'cold start' problem for new users and items.
Large-scale industrial recommender system design, including two-stage retrieval (candidate generation) and ranking pipelines.
20.5K views329likes58:05@machinelearningandai3274Original Release: 2017-08-03

Collaborative filtering is a machine learning approach for recommender systems that learns both user preferences and item features simultaneously from rating data, enabling predictions for unrated items without requiring explicit feature definitions; the algorithm uses gradient descent to minimize a combined cost function that includes squared error terms for rating predictions and regularization terms, and can be implemented efficiently using vectorization (matrix multiplication) where the predicted ratings matrix equals the product of user parameter matrix and item feature matrix transposed.