TY - JOUR
T1 - Addressing cold-start
T2 - Scalable recommendation with tags and keywords
AU - Ji, Ke
AU - Shen, Hong
N1 - Publisher Copyright:
© 2015 Elsevier B.V. All rights reserved.
PY - 2015
Y1 - 2015
N2 - Cold start problem for new users and new items is a major challenge facing most collaborative filtering systems. Existing methods to collaborative filtering (CF) emphasize to scale well up to large and sparse dataset, lacking of scalable approach to dealing with new data. In this paper, we consider a novel method for alleviating the problem by incorporating content-based information about users and items, i.e., tags and . The user-item ratings imply the relevance of users' tags to items' , so we convert the direct prediction on the user-item rating matrix into the indirect prediction on the tag-relation matrix that adopts to the emergence of new data. We first propose a novel neighborhood approach for building the tag-relation matrix based on the statistics of tag-pairs in the ratings. Then, with the relation matrix, we propose a 3-factor matrix factorization model over the rating matrix, for learning every user's interest vector for selected tags and every item's correlation vector for extracted . Finally, we integrate the relation matrix with the two kinds of vectors to make recommendations. Experiments on real dataset demonstrate that our method not only outperforms other state-of-the-art CF algorithms for historical data, but also has good scalability for new data.
AB - Cold start problem for new users and new items is a major challenge facing most collaborative filtering systems. Existing methods to collaborative filtering (CF) emphasize to scale well up to large and sparse dataset, lacking of scalable approach to dealing with new data. In this paper, we consider a novel method for alleviating the problem by incorporating content-based information about users and items, i.e., tags and . The user-item ratings imply the relevance of users' tags to items' , so we convert the direct prediction on the user-item rating matrix into the indirect prediction on the tag-relation matrix that adopts to the emergence of new data. We first propose a novel neighborhood approach for building the tag-relation matrix based on the statistics of tag-pairs in the ratings. Then, with the relation matrix, we propose a 3-factor matrix factorization model over the rating matrix, for learning every user's interest vector for selected tags and every item's correlation vector for extracted . Finally, we integrate the relation matrix with the two kinds of vectors to make recommendations. Experiments on real dataset demonstrate that our method not only outperforms other state-of-the-art CF algorithms for historical data, but also has good scalability for new data.
KW - Cold start
KW - Matrix factorization
KW - Recommender systems
KW - Scalability
KW - Tag-keyword
UR - http://www.scopus.com/inward/record.url?scp=84933179293&partnerID=8YFLogxK
U2 - 10.1016/j.knosys.2015.03.008
DO - 10.1016/j.knosys.2015.03.008
M3 - Article
AN - SCOPUS:84933179293
SN - 0950-7051
VL - 83
SP - 42
EP - 50
JO - Knowledge-Based Systems
JF - Knowledge-Based Systems
IS - 1
ER -