ReuseKNN: Neighborhood Reuse for Differentially Private KNN-Based Recommendations

Author:

Müllner Peter1ORCID,Lex Elisabeth2ORCID,Schedl Markus3ORCID,Kowald Dominik1ORCID

Affiliation:

1. Know-Center GmbH and Graz University of Technology, Austria

2. Graz University of Technology, Austria

3. Johannes Kepler University Linz and Linz Institute of Technology, Austria

Abstract

User-based KNN recommender systems ( UserKNN ) utilize the rating data of a target user’s k nearest neighbors in the recommendation process. This, however, increases the privacy risk of the neighbors, since the recommendations could expose the neighbors’ rating data to other users or malicious parties. To reduce this risk, existing work applies differential privacy by adding randomness to the neighbors’ ratings, which unfortunately reduces the accuracy of UserKNN . In this work, we introduce ReuseKNN , a novel differentially private KNN-based recommender system. The main idea is to identify small but highly reusable neighborhoods so that (i) only a minimal set of users requires protection with differential privacy and (ii) most users do not need to be protected with differential privacy since they are only rarely exploited as neighbors. In our experiments on five diverse datasets, we make two key observations. Firstly, ReuseKNN requires significantly smaller neighborhoods and, thus, fewer neighbors need to be protected with differential privacy compared with traditional UserKNN . Secondly, despite the small neighborhoods, ReuseKNN outperforms UserKNN and a fully differentially private approach in terms of accuracy. Overall, ReuseKNN leads to significantly less privacy risk for users than in the case of UserKNN .

Funder

DDAI

COMET Module within the COMET — Competence Centers for Excellent Technologies Programme

Austrian Federal Ministry for Transport, Innovation and Technology

Austrian Federal Ministry for Digital and Economic Affairs

Austrian Research Promotion Agency

TU Graz Open Access Publishing Fund, the Austrian Science Fund

State of Upper Austria and the Federal Ministry of Education, Science, and Research

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Theoretical Computer Science

Reference65 articles.

1. Himan Abdollahpouri, Masoud Mansoury, Robin Burke, and Bamshad Mobasher. 2019. The unfairness of popularity bias in recommendation. In Proc. of the RMSE’19 Workshop, in Conjunction with ACM RecSys’19.

2. Gediminas Adomavicius and Jingjing Zhang. 2012. Impact of data characteristics on recommender systems performance. ACM Transactions on Management Information Systems 3 1 (2012) 1–17.

3. Sushant Agarwal. 2020. Trade-offs between fairness, interpretability, and privacy in machine learning. Master’s thesis. University of Waterloo.

4. Vito Walter Anelli, Yashar Deldjoo, Tommaso Di Noia, Antonio Ferrara, and Fedelucio Narducci. 2021. How to put users in control of their data in federated top-N recommendation with learning to rank. In Proc. of SAC’21.

5. Ghazaleh Beigi and Huan Liu. 2020. A survey on privacy in social media: identification mitigation and applications. ACM Transactions on Data Science 1 1 (2020) 1–38.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An in-depth analysis of robustness and accuracy of recommendation systems;2023 IEEE International Conference on Data Mining Workshops (ICDMW);2023-12-04

2. Differential privacy in collaborative filtering recommender systems: a review;Frontiers in Big Data;2023-10-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3