TY - GEN
T1 - Distributed rating prediction in user generated content streams
AU - Isaacman, Sibren
AU - Ioannidis, Stratis
AU - Chaintreau, Augustin
AU - Martonosi, Margaret Rose
PY - 2011
Y1 - 2011
N2 - Recommender systems predict user preferences based on a range of available information. For systems in which users generate streams of content (e.g., blogs, periodically-updated newsfeeds), users may rate the produced content that they read, and be given accurate predictions about future content they are most likely to prefer. We design a distributed mechanism for predicting user ratings that avoids the disclosure of information to a centralized authority or an untrusted third party: users disclose the rating they give to certain content only to the user that produced this content. We demonstrate how rating prediction in this context can be formulated as a matrix factorization problem. Using this intuition, we propose a distributed gradient descent algorithm for its solution that abides with the above restriction on how information is exchanged between users. We formally analyse the convergence properties of this algorithm, showing that it reduces a weighted root mean square error of the accuracy of predictions. Although our algorithm may be used many different ways, we evaluate it on the Neflix data set and prediction problem as a benchmark. In addition to the improved privacy properties that stem from its distributed nature, our algorithm is competitive with current centralized solutions. Finally, we demonstrate the algorithm's fast convergence in practice by conducting an online experiment with a prototype user-generated content exchange system implemented as a Facebook application.
AB - Recommender systems predict user preferences based on a range of available information. For systems in which users generate streams of content (e.g., blogs, periodically-updated newsfeeds), users may rate the produced content that they read, and be given accurate predictions about future content they are most likely to prefer. We design a distributed mechanism for predicting user ratings that avoids the disclosure of information to a centralized authority or an untrusted third party: users disclose the rating they give to certain content only to the user that produced this content. We demonstrate how rating prediction in this context can be formulated as a matrix factorization problem. Using this intuition, we propose a distributed gradient descent algorithm for its solution that abides with the above restriction on how information is exchanged between users. We formally analyse the convergence properties of this algorithm, showing that it reduces a weighted root mean square error of the accuracy of predictions. Although our algorithm may be used many different ways, we evaluate it on the Neflix data set and prediction problem as a benchmark. In addition to the improved privacy properties that stem from its distributed nature, our algorithm is competitive with current centralized solutions. Finally, we demonstrate the algorithm's fast convergence in practice by conducting an online experiment with a prototype user-generated content exchange system implemented as a Facebook application.
KW - distributed system
KW - recommendation system
UR - http://www.scopus.com/inward/record.url?scp=82555204536&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=82555204536&partnerID=8YFLogxK
U2 - 10.1145/2043932.2043948
DO - 10.1145/2043932.2043948
M3 - Conference contribution
AN - SCOPUS:82555204536
SN - 9781450306836
T3 - RecSys'11 - Proceedings of the 5th ACM Conference on Recommender Systems
SP - 69
EP - 76
BT - RecSys'11 - Proceedings of the 5th ACM Conference on Recommender Systems
T2 - 5th ACM Conference on Recommender Systems, RecSys 2011
Y2 - 23 October 2011 through 27 October 2011
ER -