Differential privacy for neighborhood-based collaborative filtering
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
As a popular technique in recommender systems, Collaborative Filtering (CF) has received extensive attention in recent years. However, its privacy-related issues, especially for neighborhood-based CF methods, can not be overlooked. The aim of this study is to address the privacy issues in the context of neighborhood-based CF methods by proposing a Private Neighbor Collaborative Filtering (PNCF) algorithm. The algorithm includes two privacy-preserving operations: Private Neighbor Selection and Recommendation-Aware Sensitivity. Private Neighbor Selection is constructed on the basis of the notion of differential privacy to privately choose neighbors. Recommendation-Aware Sensitivity is introduced to enhance the performance of recommendations. Theoretical and experimental analysis are provided to show the proposed algorithm can preserve differential privacy while retaining the accuracy of recommendations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · cited 1×
“[11], who re-identified part of the users in the Netfiix Prize dataset by associating it with the International Movie DataBase (IMDB) dataset.”
Method"You Might Also Like:" Privacy Risks of Collaborative Filtering
Calandrino, J. A., Kilzer, A., Narayanan, A., Felten, E. W., & Shmatikov, V. (2011) · 2011 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2011.40 · Cited by 311 · cited 3×
“A function B is then defined to bound Local Sensitivity at all points.”
BackgroundInfluential
Cited by
A survey of local differential privacy for securing internet of vehicles
Zhao, P., Zhang, G., Wan, S., Liu, G., & Umer, T. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-019-03104-0 · Cited by 66
Improving k-anonymity based privacy preservation for collaborative filtering
Wei, R., Tian, H., & Shen, H. (2018) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2018.02.017 · Cited by 44
Differentially private user-based collaborative filtering recommendation based on k-means clustering
Chen, Z., Wang, Y., Zhang, S., Zhong, H., & Chen, L. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114366 · Cited by 42
Neera, J., Chen, X., Aslam, N., Wang, K., & Shu, Z. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3126577 · Cited by 42
New SVD-based collaborative filtering algorithms with differential privacy
Xian, Z., Li, Q., Huang, X., & Li, L. (2017) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-162053 · Cited by 35
Metadata
- Authors
- Zhu, T., Li, G., Ren, Y., Zhou, W., & Xiong, P.
- Venue
- Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
- Publisher
- ACM
- Published
- 2013-08-25
- Pages
- 752-759
- OpenAlex
- W1969007391
- Cited by
- 61
- References
- 3
- FWCI
- 3.04
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.