Collaborative filtering (CF) is a highly applicable technology for predicting a user’s rating to a certain item. Recently, some works have gradually switched from modeling users’ rating behaviors alone to modeling both users’ behaviors and preference context beneath rating behaviors such as the set of other items rated by user u. In this paper, we go one step beyond and propose a novel perspective, i.e., k-granularity preference context, which is able to absorb existing preference context as special cases. Based on this new perspective, we further develop a novel and a generic recommendation method called k-CoFi that models k-granularity preference context in collaborative filtering in a principled way. Empirically, we study the effectiveness of factorization with coarse granularity, fine granularity and smooth granularity, and their complementarity, by applying k-CoFi to three real-world datasets. We also obtain some interesting and promising results and useful guidance for practitioners from the experiments.
[1]
Zhong Ming,et al.
Collaborative Recommendation with Multiclass Preference Context
,
2017,
IEEE Intelligent Systems.
[2]
Steffen Rendle,et al.
Factorization Machines with libFM
,
2012,
TIST.
[3]
John Riedl,et al.
GroupLens: an open architecture for collaborative filtering of netnews
,
1994,
CSCW '94.
[4]
Yehuda Koren,et al.
Factorization meets the neighborhood: a multifaceted collaborative filtering model
,
2008,
KDD.
[5]
Ruslan Salakhutdinov,et al.
Probabilistic Matrix Factorization
,
2007,
NIPS.
[6]
Tat-Seng Chua,et al.
Neural Collaborative Filtering
,
2017,
WWW.