Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

An Improved Profile-Based CF Scheme with Privacy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bilge, A. ; Dept. of Comput. Eng., Anadolu Univ., Eskisehir, Turkey ; Polat, H.

Traditional collaborative filtering (CF) systems widely employing k-nearest neighbor (kNN) algorithms mostly attempt to alleviate the contemporary problem of information overload by generating personalized predictions for items that users might like. Unlike their popularity and extensive usage, they suffer from several problems. First, with increasing number of users and/or items, scalability becomes a challenge. Second, as the number of ratable items increases and number of ratings provided by each individual remains as a tiny fraction, CF systems suffer from sparsity problem. Third, many schemes fail to protect private data referred to as privacy problem. Due to such problems, accuracy and online performance become worse. In this paper, we propose two preprocessing schemes to overcome scalability and sparsity problems. First, we suggest using a novel content-based profiling of users to estimate similarities on a reduced data for better performance. Second, we propose pseudo-prediction protocol to help CF systems surmount sparsity. We finally propose to use randomization methods to preserve individual users' confidential data, where we show that our proposed preprocessing schemes can be applied to perturbed data. We analyze our schemes in terms of privacy. To investigate their effects on accuracy and performance, we perform real databased experiments. Empirical results demonstrate that our preprocessing schemes improve both performance and accuracy.

Published in:

Semantic Computing (ICSC), 2011 Fifth IEEE International Conference on

Date of Conference:

18-21 Sept. 2011