ID-SR: Privacy-Preserving Social Recommendation Based on Infinite Divisibility for Trustworthy AI

Author:

Cui Jingyi1ORCID,Xu Guangquan2ORCID,Liu Jian2ORCID,Feng Shicheng2ORCID,Wang Jianli1ORCID,Peng Hao3ORCID,Fu Shihui4ORCID,Zheng Zhaohua5ORCID,Zheng Xi6ORCID,Liu Shaoying7ORCID

Affiliation:

1. School of New Media and Communication, Tianjin University, Tianjin, China

2. College of Intelligence and Computing, Tianjin University, Tianjin, China

3. Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province, Jinhua, China and School of Computer Science and Technology, Zhejiang Normal University, Jinhua, China

4. TU Delft, Delft, Netherlands

5. College of Intelligence and Computing, Tianjin University, Tianjin, China and School of CyberSpace Security, Hainan University, Haikou, China

6. School of Computing, Macquarie University, Sydney, Australia

7. School of Informatics and Data Science, Hiroshima University, Higashihiroshima, Japan

Abstract

Recommendation systems powered by artificial intelligence (AI) are widely used to improve user experience. However, AI inevitably raises privacy leakage and other security issues due to the utilization of extensive user data. Addressing these challenges can protect users’ personal information, benefit service providers, and foster service ecosystems. Presently, numerous techniques based on differential privacy have been proposed to solve this problem. However, existing solutions encounter issues such as inadequate data utilization and a tenuous trade-off between privacy protection and recommendation effectiveness. To enhance recommendation accuracy and protect users’ private data, we propose ID-SR, a novel privacy-preserving social recommendation scheme for trustworthy AI based on the infinite divisibility of Laplace distribution. We first introduce a novel recommendation method adopted in ID-SR, which is established based on matrix factorization with a newly designed social regularization term for improving recommendation effectiveness. We then propose a differential privacy-preserving scheme tailored to the above method that leverages the Laplace distribution’s characteristics to safeguard user data. Theoretical analysis and experimentation evaluation on two publicly available datasets demonstrate that our scheme achieves a superior balance between privacy protection and recommendation effectiveness, ultimately delivering an enhanced user experience.

Funder

National Science Foundation of China

Tianjin Intelligent Manufacturing Special Fund Project

China Guangxi Science and Technology Plan Project—Guangxi Science and Technology Base and Talent Special Project

Hainan Provincial Natural Science Foundation of China

CCF-Nsfocus Kunpeng Fund Project

Publisher

Association for Computing Machinery (ACM)

Reference38 articles.

1. Deep learning with Gaussian differential privacy;Bu Zhiqi;Harvard Data Science Review,2020

2. "You Might Also Like:" Privacy Risks of Collaborative Filtering

3. A k-anonymous approach to privacy preserving collaborative filtering

4. Differentially private empirical risk minimization.;Chaudhuri Kamalika;Journal of Machine Learning Research,2011

5. Training robust deep collaborative filtering models via adversarial noise propagation;Chen Hai;ACM Transactions on Information Systems,2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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