Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhenkai Shi

dblp:330/7767 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0001-6803-8513ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › trustworthy recommendation
privacy-preserving recommendation
0.612022
RAP: A Light-Weight Privacy-Preserving Framework for Recommender Systems · IEEE Trans. Serv. Comput. 2022
Privacy and data protection › statistical database privacy
data perturbation
0.612022
RAP: A Light-Weight Privacy-Preserving Framework for Recommender Systems · IEEE Trans. Serv. Comput. 2022

Methods — techniques the papers use, named apart from their topics

matrix factorization · 1.1local perturbation · 1.1
YearPublicationVenuePosition
2022 RAP: A Light-Weight Privacy-Preserving Framework for Recommender Systems
abstract
In today's Internet, recommender systems play an indispensable role in helping users discover items of interests, such as products, books, movies and so on. However, a higher recommendation accuracy is commonly at the cost of more disclosure of user privacy. Thus, a wider adoption of recommender systems poses significant security and privacy concerns to users. In this article, we propose a light-weight privacy-preserving framework calledRAPfor recommender systems, which can protect user privacy while still ensuring a high recommendation accuracy. Instead of directly sending users’ private ratings to the recommender, users first conduct a local perturbation operation on private ratings, and then send the perturbed ratings to the recommender. The recommender can run recommendation algorithms directly over the perturbed ratings and return the results to users. Different from crypto-based methods, our perturbation and de-perturbation methods are linear operations. Thus,RAPis light-weight and highly efficient in privacy protection. To be more rigorous, we formally prove that the order of recommendation accuracy will not decrease when ourRAPframework is applied to any MF (Matrix Factorization)-based recommender systems. We also derive the closed-form expression for the degree of privacy preservation of our framework. Finally, we conduct extensive evaluations using large-scale real-world datasets to verify the effectiveness of ourRAPframework and compare with other baseline algorithms. The results show that ourRAPframework can improve the degree of privacy preservation from zero to over 0.5 for theMovielensdataset and 4 for theJesterdataset, and still maintain the approaching level of recommendation accuracy.
Miao Hu 0001, Di Wu 0001, Run Wu, Zhenkai Shi, Min Chen 0003, Yipeng Zhou
IEEE Trans. Serv. Comput.4