Clustering-Based Matrix Factorization
Nima Mirbakhsh, Charles X. Ling

TL;DR
This paper introduces an extension to matrix factorization in recommender systems that incorporates category-based neighborhood information, improving accuracy with fewer neighbors compared to existing models.
Contribution
It proposes a novel clustering-based matrix factorization method that integrates shared category interests into the recommendation process.
Findings
Improves recommendation accuracy on Movielens100k and Netflix datasets.
Achieves comparable or better results than neighborhood-aware models with fewer neighbors.
Enhances matrix factorization by incorporating category clustering information.
Abstract
Recommender systems are emerging technologies that nowadays can be found in many applications such as Amazon, Netflix, and so on. These systems help users to find relevant information, recommendations, and their preferred items. Slightly improvement of the accuracy of these recommenders can highly affect the quality of recommendations. Matrix Factorization is a popular method in Recommendation Systems showing promising results in accuracy and complexity. In this paper we propose an extension of matrix factorization which adds general neighborhood information on the recommendation model. Users and items are clustered into different categories to see how these categories share preferences. We then employ these shared interests of categories in a fusion by Biased Matrix Factorization to achieve more accurate recommendations. This is a complement for the current neighborhood aware matrix…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Image Retrieval and Classification Techniques · Advanced Data Compression Techniques
