Matrix factorization meets cosine similarity: Addressing sparsity problem in collaborative filtering recommender system

16Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Wen, H., Ding, G., Liu, C., & Wang, J. (2014). Matrix factorization meets cosine similarity: Addressing sparsity problem in collaborative filtering recommender system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8709 LNCS, pp. 306–317). Springer Verlag. https://doi.org/10.1007/978-3-319-11116-2_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free