4.7 Article

Differentially private user-based collaborative filtering recommendation based on κ-means clustering

Journal

EXPERT SYSTEMS WITH APPLICATIONS
Volume 168, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2020.114366

Keywords

Differential privacy; k-means clustering; Recommendation system; Collaborative filtering

Funding

  1. Support Program for Outstanding Young Talents in Anhui Universities, China [gxyq2019001]
  2. Special Fund for Key Program of Science and Technology of Anhui Province, China [18030901027]
  3. National Natural Science Foundation of China [61572031, 11301002]
  4. Anhui Provincial Natural Science Foundation, China [2008085MF187]
  5. Natural Science Foundation for the Higher Education Institutions of Anhui Province of China [KJ2018A0017]

Ask authors/readers for more resources

The paper proposes a differentially private user-based CF recommendation system based on kappa-means clustering and exponential mechanism to improve recommendation performance while achieving differential privacy. Experimental results show significant performance improvement compared to existing systems.
Collaborative filtering (CF) recommendation is well-known for its outstanding recommendation performance, but previous researches showed that it could cause privacy leakage for users due to kappa-nearest neighboring (KNN) attacks. Recently, the notion of differential privacy (DP) has been applied to privacy preservation in recommendation systems. However, as far as we know, existing differentially private CF recommendation systems degrade the recommendation performance (such as recall and precision) to an unacceptable level. In this paper, to address the performance degradation problem, we propose a differentially private user-based CF recommendation system based on kappa-means clustering (KDPCF). Specifically, to improve the recommendation performance, KDPCF first clusters the dataset into categories by kappa-means clustering and appropriately adjusts the size of the target category to which the target user belongs, so that only users in the well-sized target category are used for recommendation. Then, it selects efficiently a set of neighbors from the target category at one time by employing only one instance of exponential mechanism instead of the composition of multiple ones, and then uses a CF algorithm to recommend based on this set of neighbors. We theoretically prove that our system achieves differential privacy. Empirically, we use two public datasets to evaluate our recommendation system. The experimental results demonstrate that our system has a significant performance improvement compared to existing ones.

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