TY - GEN
T1 - Budget-Constrained item cold-start handling in collaborative filtering recommenders via optimal design
AU - Anava, Oren
AU - Golan, Shahar
AU - Golbandi, Nadav
AU - Karnin, Zohar
AU - Lempel, Ronny
AU - Rokhlenko, Oleg
AU - Somekh, Oren
PY - 2015/5/18
Y1 - 2015/5/18
N2 - It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item coldstart problems. The latter is the main focus of this work. Most of the current literature addresses this problem by integrating content-based recommendation techniques to model the new item. However, in many cases such content is not available, and the question arises is whether this problem can be mitigated using CF techniques only. We formalize this problem as an optimization problem: given a new item, a pool of available users, and a budget constraint, select which users to assign with the task of rating the new item in order to minimize the prediction error of our model. We show that the objective function is monotone-supermodular, and propose effcient optimal design based algorithms that attain an approximation to its optimum. Our findings are veri-fied by an empirical study using the Netix dataset, where the proposed algorithms outperform several baselines for the problem at hand.
AB - It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item coldstart problems. The latter is the main focus of this work. Most of the current literature addresses this problem by integrating content-based recommendation techniques to model the new item. However, in many cases such content is not available, and the question arises is whether this problem can be mitigated using CF techniques only. We formalize this problem as an optimization problem: given a new item, a pool of available users, and a budget constraint, select which users to assign with the task of rating the new item in order to minimize the prediction error of our model. We show that the objective function is monotone-supermodular, and propose effcient optimal design based algorithms that attain an approximation to its optimum. Our findings are veri-fied by an empirical study using the Netix dataset, where the proposed algorithms outperform several baselines for the problem at hand.
KW - Collaborative filtering
KW - Item cold-start
KW - Optimal design
UR - https://www.scopus.com/pages/publications/84968830567
U2 - 10.1145/2736277.2741109
DO - 10.1145/2736277.2741109
M3 - Conference contribution
AN - SCOPUS:84968830567
T3 - WWW 2015 - Proceedings of the 24th International Conference on World Wide Web
SP - 45
EP - 54
BT - WWW 2015 - Proceedings of the 24th International Conference on World Wide Web
PB - Association for Computing Machinery, Inc
T2 - 24th International Conference on World Wide Web, WWW 2015
Y2 - 18 May 2015 through 22 May 2015
ER -