Matrix Factorization Meets Cosine Similarity: Addressing Sparsity Problem in Collaborative Filtering Recommender System

Matrix factorization (MF) technique has been widely used in collaborative filtering recommendation systems. However, MF still suffers from data sparsity problem. Although previous studies bring in auxiliary data to solve this problem, auxiliary data is not always available. In this paper, we propose a novel method, Cosine Matrix Factorization (CosMF), to address the sparsity problem without auxiliary data. We observe that when data is sparse, the magnitude of user/item vector could not be properly learned due to lack of information. Based on that observation, we propose to use cosine to replace inner product for sparse users/items, thus eliminating the negative effects of poorly trained magnitudes. Experiments on various real life datasets demonstrate that CosMF yields significantly better results without help of auxiliary dataset.

[1]  Michael R. Lyu,et al.  SoRec: social recommendation using probabilistic matrix factorization , 2008, CIKM '08.

[2]  Ioannis Konstas,et al.  On social networks and collaborative recommendation , 2009, SIGIR.

[3]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[4]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[5]  Michael R. Lyu,et al.  Learning to recommend with social trust ensemble , 2009, SIGIR.

[6]  Quanquan Gu,et al.  Neighborhood Preserving Nonnegative Matrix Factorization , 2009, BMVC.

[7]  Min Zhao,et al.  Adapting neighborhood and matrix factorization models for context aware recommendation , 2010, RecSys 2010.

[8]  Qiang Yang,et al.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Transfer Learning to Predict Missing Ratings via Heterogeneous User Feedbacks , 2022 .

[9]  Chris H. Q. Ding,et al.  Collaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs , 2010, SDM.

[10]  Martin Ester,et al.  A Transitivity Aware Matrix Factorization Model for Recommendation in Social Networks , 2011, IJCAI.

[11]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[12]  Li Chen,et al.  Augmenting Chinese Online Video Recommendations by Using Virtual Ratings Predicted by Review Sentiment Classification , 2010, 2010 IEEE International Conference on Data Mining Workshops.

[13]  Yelong Shen,et al.  Learning personal + social latent factor model for social recommendation , 2012, KDD.

[14]  Qiang Yang,et al.  One-Class Collaborative Filtering , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[15]  Michael R. Lyu,et al.  Learning to recommend with explicit and implicit social relations , 2011, TIST.

[16]  Domonkos Tikk,et al.  Matrix factorization and neighbor based algorithms for the netflix prize problem , 2008, RecSys '08.

[17]  Chao Liu,et al.  Recommender systems with social regularization , 2011, WSDM '11.

[18]  Michael R. Lyu,et al.  Learning to recommend with trust and distrust relationships , 2009, RecSys '09.

[19]  Martin Ester,et al.  TrustWalker: a random walk model for combining trust-based and item-based recommendation , 2009, KDD.

[20]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[21]  Tommi S. Jaakkola,et al.  Weighted Low-Rank Approximations , 2003, ICML.

[22]  Domonkos Tikk,et al.  Investigation of Various Matrix Factorization Methods for Large Recommender Systems , 2008, 2008 IEEE International Conference on Data Mining Workshops.

[23]  Fillia Makedon,et al.  Learning from Incomplete Ratings Using Non-negative Matrix Factorization , 2006, SDM.

[24]  Jianmin Wang,et al.  Twin Bridge Transfer Learning for Sparse Collaborative Filtering , 2013, PAKDD.