TY - GEN
T1 - Privacy-preserving top-N recommendation on horizontally partitioned data
AU - Polat, Huseyin
AU - Du, Wenliang
PY - 2005
Y1 - 2005
N2 - Collaborative filtering techniques are widely used by many E-commerce sites for recommendation purposes. Such techniques help customers by suggesting products to purchase using other users' preferences. Today's top-N recommendation schemes are based on market basket data, which shows whether a customer bought an item or not. Data collected for recommendation purposes might be split between different parties. To provide better referrals and increase mutual advantages, such parties might want to share data. Due to privacy concerns, however, they do not want to disclose data. This paper presents a scheme for binary ratings-based top-N recommendation on horizontally partitioned data, in which two parties own disjoint sets of users' ratings for the same items while preserving data owners' privacy. If data owners want to produce referrals using the combined data while preserving their privacy, we propose a scheme to provide accurate top-N recommendations without exposing data owners' privacy. We conducted various experiments to evaluate our scheme and analyzed how different factors affect the performance using the experiment results.
AB - Collaborative filtering techniques are widely used by many E-commerce sites for recommendation purposes. Such techniques help customers by suggesting products to purchase using other users' preferences. Today's top-N recommendation schemes are based on market basket data, which shows whether a customer bought an item or not. Data collected for recommendation purposes might be split between different parties. To provide better referrals and increase mutual advantages, such parties might want to share data. Due to privacy concerns, however, they do not want to disclose data. This paper presents a scheme for binary ratings-based top-N recommendation on horizontally partitioned data, in which two parties own disjoint sets of users' ratings for the same items while preserving data owners' privacy. If data owners want to produce referrals using the combined data while preserving their privacy, we propose a scheme to provide accurate top-N recommendations without exposing data owners' privacy. We conducted various experiments to evaluate our scheme and analyzed how different factors affect the performance using the experiment results.
UR - http://www.scopus.com/inward/record.url?scp=33745784440&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745784440&partnerID=8YFLogxK
U2 - 10.1109/WI.2005.117
DO - 10.1109/WI.2005.117
M3 - Conference contribution
AN - SCOPUS:33745784440
SN - 076952415X
SN - 9780769524153
T3 - Proceedings - 2005 IEEE/WIC/ACM InternationalConference on Web Intelligence, WI 2005
SP - 725
EP - 731
BT - Proceedings - 2005 IEEE/WIC/ACM InternationalConference on Web Intelligence, WI 2005
T2 - 2005 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2005
Y2 - 19 September 2005 through 22 September 2005
ER -