Name
Abstract | ||
|---|---|---|
In modern recommender systems, matrix factorization has been widely used to decompose the user-item matrix into user and item latent factors. However, the inner product in matrix factorization does not satisfy the triangle inequality, and the problem of sparse data is also encountered. In this paper, we propose a novel recommendation model, namely, metric factorization with item cooccurrence for recommendation (MFIC), which uses the Euclidean distance to jointly decompose the user-item interaction matrix and the item-item cooccurrence with shared latent factors. The item cooccurrence matrix is obtained from the colike matrix through the calculation of pointwise mutual information. The main contributions of this paper are as follows: (1) The MFIC model is not only suitable for rating prediction and item ranking, but can also well overcome the problem of sparse data. (2) This model incorporates the item cooccurrence matrix into metric learning so it can better learn the spatial positions of users and items. (3) Extensive experiments on a number of real-world datasets show that the proposed method substantially outperforms the compared algorithm in both rating prediction and item ranking. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.3390/sym12040512 | SYMMETRY-BASEL |
Keywords | DocType | Volume |
metric factorization,matrix factorization,word embedding,item embedding | Journal | 12 |
Issue | Citations | PageRank |
4 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Honglin Dai | 1 | 0 | 0.34 |
| Liejun Wang | 2 | 9 | 5.54 |
| Jiwei Qin | 3 | 0 | 0.68 |