The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Personalized social recommendations: accurate or private
Abstract
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible -- recommendations that rely on one's social connections in order to make personalized recommendations of ads, content, products, and people. Since recommendations may use sensitive information, it is speculated that these recommendations are associated with privacy risks. The main contribution of this work is in formalizing trade-offs between accuracy and privacy of personalized social recommendations. We study whether "social recommendations", or recommendations that are solely based on a user's social network, can be made without disclosing sensitive links in the social graph. More precisely, we quantify the loss in utility when existing recommendation algorithms are modified to satisfy a strong notion of privacy, called differential privacy. We prove lower bounds on the minimum loss in utility for any recommendation algorithm that is differentially private. We then adapt two privacy preserving algorithms from the differential privacy literature to the problem of social recommendations, and analyze their performance in comparison to our lower bounds, both analytically and experimentally. We show that good private social recommendations are feasible only for a small subset of the users in the social network or for a lenient setting of privacy parameters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
"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 1×
“[5] demonstrate that algorithms that recommend products based on friends’ purchases have very practical privacy concerns.”
Background
Cited by
Bobadilla, J., Ortega, F., Hernando, A., & Gutiérrez, A. (2013) · Knowledge-Based Systems · doi:10.1016/j.knosys.2013.03.012 · Cited by 3,158
"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
Differential Privacy: An Economic Method for Choosing Epsilon
Hsu, J., Gaboardi, M., Haeberlen, A., Khanna, S., Narayan, A., Pierce, B. C., & Roth, A. (2014) · 2014 IEEE 27th Computer Security Foundations Symposium · doi:10.1109/csf.2014.35 · Cited by 272
Pufferfish: A framework for mathematical privacy definitions
Kifer, D., & Machanavajjhala, A. (2014) · ACM Transactions on Database Systems · doi:10.1145/2514689 · Cited by 267
Self-citationImproved collaborative filtering recommendation algorithm based on differential privacy protection
Yin, C., Shi, L., Sun, R., & Wang, J. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-019-02751-7 · Cited by 90
Metadata
- Authors
- Machanavajjhala, A., Korolova, A., & Sarma, A. D.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2011-04
- Volume
- 4
- Issue
- 7
- Pages
- 440-450
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2122997783
- Cited by
- 174
- References
- 2
- FWCI
- 20.40
- Type
- journal article
- 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: Personalized social recommendations: accurate or private. https://app.cochat.ai/papers/10.14778/1988776.1988780
- The paper
- Machanavajjhala, A., Korolova, A., & Sarma, A. D. (2011). Personalized social recommendations: accurate or private. Proceedings of the VLDB Endowment. https://doi.org/10.14778/1988776.1988780
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.