4.7 Article

An algorithm for efficient privacy-preserving item-based collaborative filtering

Publisher

ELSEVIER
DOI: 10.1016/j.future.2014.11.003

Keywords

Item-based; Collaborative filtering; Privacy; Efficiency

Funding

  1. National Natural Science Foundation of China [61233016, 61332008, 61272533]
  2. National Science Foundation [CNS-0910995, CNS-1162614]
  3. Shanghai Science & Technology Committee Project [11JC1400800, 13ZR1401900]

Ask authors/readers for more resources

Collaborative filtering (CF) methods are widely adopted by existing recommender systems, which can analyze and predict user ratings or preferences of newly generated items based on user historical behaviors. However, privacy issue arises in this process as sensitive user private data are collected by the recommender server. Recently proposed privacy-preserving collaborative filtering (PPCF) methods, using computation-intensive cryptography techniques or data perturbation techniques are not appropriate in real online services. In this paper, an efficient privacy-preserving item-based collaborative filtering algorithm is proposed, which can protect user privacy during online recommendation process without compromising recommendation accuracy and efficiency. The proposed method is evaluated using the Netflix Prize dataset. Experimental results demonstrate that the proposed method outperforms a randomized perturbation based PPCF solution and a homomorphic encryption based PPCF solution by over 14X and 386X, respectively, in recommendation efficiency while achieving similar or even better recommendation accuracy. (C) 2014 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available