TY - GEN
T1 - Distributed collaborative filtering over social networks
AU - Isaacman, Sibren
AU - Ioannidis, Stratis
AU - Chaintreau, Augustin
AU - Martonosi, Margaret
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. We also demonstrate how this technique can readily be used to offer optimal recommendation.
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. We also demonstrate how this technique can readily be used to offer optimal recommendation.
UR - http://www.scopus.com/inward/record.url?scp=84856080532&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84856080532&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2011.6120295
DO - 10.1109/Allerton.2011.6120295
M3 - Conference contribution
AN - SCOPUS:84856080532
SN - 9781457718168
T3 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
SP - 1136
EP - 1142
BT - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
T2 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Y2 - 28 September 2011 through 30 September 2011
ER -