Collaborative Filtering
Collaborative Filtering (Recommender Systems) · Also known as: user-based collaborative filtering, item-based collaborative filtering, matrix factorization recommender, işbirlikçi filtreleme
Collaborative filtering recommends items to a user by leveraging the preferences of many users — 'people who liked what you liked also liked this'. It learns from a sparse user-item interaction matrix, either by finding similar users or items (neighbourhood methods, formalized by Sarwar et al. in 2001) or by factorizing the matrix into latent user and item factors (matrix factorization, popularized by Koren et al. after the Netflix Prize).
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use collaborative filtering to build recommendations from interaction data alone — e-commerce, streaming, news, and content platforms — when you have enough users and interactions to reveal shared patterns and do not want to rely on item content. Neighbourhood methods are simple and interpretable ('because you liked X'); matrix factorization scales better, handles sparsity, and usually predicts more accurately. Key limitations: the cold-start problem (new users/items with no interactions can't be placed), sparsity and popularity bias, and the need for substantial interaction data. Pure collaborative filtering ignores item/user attributes, so it is often combined with content features into hybrid recommenders; implicit-feedback and deep-learning recommenders extend the same idea. It is closely related to matrix completion and NMF.
Strengths & limitations
- Needs only interaction data — no item content or feature engineering.
- Captures subtle, hard-to-articulate taste patterns from the crowd.
- Matrix factorization scales to large, sparse matrices and predicts accurately.
- Neighbourhood methods give interpretable 'because you liked …' explanations.
- Cold-start: cannot recommend for new users or items with no interactions.
- Sensitive to sparsity and biased toward popular items.
- Ignores item/user attributes (content), unlike hybrid approaches.
- Requires substantial interaction data to work well.
Frequently asked
What is the difference between user-based and item-based collaborative filtering?
User-based CF recommends items liked by users similar to you; item-based CF recommends items similar (in how users rated them) to ones you already liked. Item-based is usually preferred at scale because item-item similarities are more stable over time and can be precomputed offline.
How does matrix factorization improve on neighbourhood methods?
It represents users and items by short latent-factor vectors learned from the data, so each rating is their dot product. This captures hidden taste dimensions, handles sparsity better, generalizes beyond direct neighbours, and typically predicts more accurately — which is why it dominated the Netflix Prize solutions.
What is the cold-start problem?
Collaborative filtering relies on past interactions, so it cannot make good recommendations for brand-new users or items that have none. Remedies include asking for initial preferences, falling back to popularity, or hybridizing with content-based features that don't require interaction history.
Sources
- Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001). Item-based collaborative filtering recommendation algorithms. Proceedings of the 10th International Conference on World Wide Web, 285–295. DOI: 10.1145/371920.372071 ↗
- Koren, Y., Bell, R., & Volinsky, C. (2009). Matrix factorization techniques for recommender systems. Computer, 42(8), 30–37. DOI: 10.1109/MC.2009.263 ↗
How to cite this page
ScholarGate. (2026, June 2). Collaborative Filtering (Recommender Systems). ScholarGate. https://scholargate.app/en/machine-learning/collaborative-filtering
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Matrix CompletionMachine learning↔ compare
- Non-negative Matrix FactorizationMachine learning↔ compare