Applying Differential Privacy to Matrix Factorization
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Recommender systems are increasingly becoming an integral part of on-line services. As the recommendations rely on personal user information, there is an inherent loss of privacy resulting from the use of such systems. While several works studied privacy-enhanced neighborhood-based recommendations, little attention has been paid to privacy preserving latent factor models, like those represented by matrix factorization techniques. In this paper, we address the problem of privacy preserving matrix factorization by utilizing differential privacy, a rigorous and provable privacy preserving method. We propose and study several approaches for applying differential privacy to matrix factorization, and evaluate the privacy-accuracy trade-offs offered by each approach. We show that input perturbation yields the best recommendation accuracy, while guaranteeing a solid level of privacy protection.
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
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542 · cited 1×
“In the literature, privacy settings of = ln 2 or = ln 3 are considered as providing acceptable levels of privacy, although Dwork suggested that in some cases much higher values of could provide meaningful guarantees [6].”
Background"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 2×
“[2] studied the privacy risks imposed by recommenders, such as Hunch, Last.”
Background(2012) · doi:10.1145/2365952.2365989 · Cited by 170 · cited 1×
“The raw user ratings, even if anonymized, pose a privacy risk: the data can be de-anonymized using information obtained from other sources and then be used to infer sensitive information [18], e.”
Background
Cited by
Secure Federated Matrix Factorization
Chai, D., Wang, L., Chen, K., & Yang, Q. (2021) · IEEE Intelligent Systems · doi:10.1109/mis.2020.3014880 · Cited by 449
Himeur, Y., Sohail, S. S., Bensaali, F., Amira, A., & Alazab, M. (2022) · Computers & Security · doi:10.1016/j.cose.2022.102746 · Cited by 139
Comprehensive Privacy Analysis on Federated Recommender System Against Attribute Inference Attacks
Zhang, S., Yuan, W., & Yin, H. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3295601 · Cited by 97
FCMF: Federated collective matrix factorization for heterogeneous collaborative filtering
Yang, E., Huang, Y., Liang, F., Pan, W., & Ming, Z. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106946 · Cited by 58
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
Metadata
- Authors
- Berlioz, A., Friedman, A., Kaafar, M. A., Boreli, R., & Berkovsky, S.
- Venue
- Proceedings of the 9th ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2015-09-16
- Pages
- 107-114
- OpenAlex
- W2083287929
- Cited by
- 119
- References
- 4
- FWCI
- 5.30
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Applying Differential Privacy to Matrix Factorization. https://app.cochat.ai/papers/10.1145/2792838.2800173
- The paper
- Berlioz, A., Friedman, A., Kaafar, M. A., Boreli, R., & Berkovsky, S. (2015). Applying Differential Privacy to Matrix Factorization. Proceedings of the 9th ACM Conference on Recommender Systems. https://doi.org/10.1145/2792838.2800173
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.