TY - GEN
T1 - Collaborative filtering with user ratings and tags
AU - Bao, Tengfei
AU - Ge, Yong
AU - Chen, Enhong
AU - Xiong, Hui
AU - Tian, Jilei
PY - 2012
Y1 - 2012
N2 - User ratings and tags are becoming largely available on Internet. While people usually exploit user ratings for developing recommender systems, the use of tag information in recommender systems remains under-explored. In particular, it is not clear how to use both user ratings and user tags in a complementary way to maximize the performances of recommender systems. To this end, we propose a novel collaborative filtering model based on probabilistic matrix factorization to predict users' interests to items by simultaneously utilizing both tag and rating information. Specifically, we first perform low-rank approximation for three matrices at the same time to learn the low-dimensional latent features of users, items and tags. Then, we predict one user's preference to an item as the product of the user and item latent features. Finally, experimental results on real-world data show that the proposed model can significantly outperform benchmark methods.
AB - User ratings and tags are becoming largely available on Internet. While people usually exploit user ratings for developing recommender systems, the use of tag information in recommender systems remains under-explored. In particular, it is not clear how to use both user ratings and user tags in a complementary way to maximize the performances of recommender systems. To this end, we propose a novel collaborative filtering model based on probabilistic matrix factorization to predict users' interests to items by simultaneously utilizing both tag and rating information. Specifically, we first perform low-rank approximation for three matrices at the same time to learn the low-dimensional latent features of users, items and tags. Then, we predict one user's preference to an item as the product of the user and item latent features. Finally, experimental results on real-world data show that the proposed model can significantly outperform benchmark methods.
UR - http://www.scopus.com/inward/record.url?scp=84866052882&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84866052882&partnerID=8YFLogxK
U2 - 10.1145/2346604.2346606
DO - 10.1145/2346604.2346606
M3 - Conference contribution
AN - SCOPUS:84866052882
SN - 9781450315531
T3 - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
BT - Proceedings of the 1st International Workshop on Context Discovery and Data Mining, ContextDD'12
T2 - 1st International Workshop on Context Discovery and Data Mining, ContextDD'12 in Conjunction with the 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2012
Y2 - 12 August 2012 through 16 August 2012
ER -