Cited by 42Privacy-Preserving Technologies in DataRecommender Systems and TechniquesPrivacy, Security, and Data Protection

The DOI matches its Crossref record, with a small difference in title or year; 1 of the 1 references it cites were found in a registry or an index.

Private and Utility Enhanced Recommendations With Local Differential Privacy and Gaussian Mixture Model

Open access
Neera, Jeyamohan, Chen, Xiaomin, Aslam, Nauman, Wang, Kezhi, Shu, Zhan·2023·IEEE Transactions on Knowledge and Data Engineering

Abstract

Recommendation systems rely heavily on behavioural and preferential data (e.g., ratings and likes) of a user to produce accurate recommendations. However, such unethical data aggregation and analytical practices of Service Providers (SP) causes privacy concerns among users. Local differential privacy (LDP) based perturbation mechanisms address this concern by adding noise to users’ data at the user-side before sending it to the SP. The SP then uses the perturbed data to perform recommendations. Although LDP protects the privacy of users from SP, it causes a substantial decline in recommendation accuracy. We propose an LDP-based Matrix Factorization (MF) with a Gaussian Mixture Model (MoG) to address this problem. The LDP perturbation mechanism, i.e., Bounded Laplace (BLP), regulates the effect of noise by confining the perturbed ratings to a predetermined domain. We derive a sufficient condition of the scale parameter for BLP to satisfy$\varepsilon$-LDP. We use the MoG model at the SP to estimate the noise added locally to the ratings and the MF algorithm to predict missing ratings. Our LDP based recommendation system improves the predictive accuracy without violating LDP principles. We demonstrate that our method offers a substantial increase in recommendation accuracy under a strong privacy guarantee through empirical evaluations on three real-world datasets, i.e., Movielens, Libimseti and Jester.

Overview

Integrity signals

Registry

Crossref · 10.1109/tkde.2021.3126577

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 38

  1. 10.1109/SP.2008.33 · DOI · Paper page
  2. 10.1145/1557019.1557090 · DOI
  3. 10.1109/ASONAM.2013.6785787 · DOI
  4. 10.1109/TKDE.2018.2805356 · DOI
  5. Hua, Differentially private matrix factorization, 1763
  6. 10.1145/2792838.2800173 · DOI
  7. 10.1609/aaai.v32i1.11714 · DOI
  8. 10.1109/FOCS.2008.27 · DOI
  9. 10.1109/TKDE.2018.2845388 · DOI
  10. 10.1145/2020408.2020426 · DOI
  11. 10.1145/2365952.2365972 · DOI
  12. 10.1109/CVPR.1991.139758 · DOI
  13. 10.1109/ICCV.2013.169 · DOI
  14. 10.1007/s11263-007-0099-z · DOI
  15. 10.1111/j.2517–6161.1977.tb01600.x · DOI · Paper page
  16. de la Torre, 2003, A framework for robust subspace learning, Int. J. Comput. Vis., 54, 1
  17. 10.1109/CVPR.2005.118 · DOI
  18. Srebro, Weighted low-rank approximations, 720
  19. 10.1145/2827872 · DOI
  20. Goldberg, 2001, Eigentaste: A constant time collaborative filtering algorithm, ” Inf. Retrieval J., 4, 133, 10.1023/A:1011419012209 · DOI
  21. Brozovsky, Recommender system for online dating service, 1
  22. Goldberg, 2001, Eigentaste: A constant time collaborative filtering algorithm, Inf. Retrieval J., 4, 133, 10.1023/A:1011419012209 · DOI
  23. Wang, Using randomized response for differential privacy preserving data collection, 1
  24. 10.29012/jpc.715 · DOI
  25. Cadwalladr, 2018, Revealed: 50 million Facebook profiles harvested for Cambridge analytica in major data breach. The Guardian
  26. 10.1504/IJICS.2008.016819 · DOI
  27. 10.47893/ijcct.2013.1201 · DOI
  28. 10.1561/0400000042 · DOI · Paper page
  29. 10.1145/2792838.2800191 · DOI
  30. Kairouz, 2014, Extremal mechanisms for local differential privacy, CoRR, abs/1407.1338 · arXiv
  31. 10.1109/ICDM.2014.140 · DOI
  32. 10.1142/S0219622010003919 · DOI
  33. Bassily, Practical locally private heavy hitters, 2285
  34. 10.1145/2976749.2978409 · DOI
  35. Wang, Locally differentially private protocols for frequency estimation, 729
  36. 10.1145/3243734.3243742 · DOI
  37. 10.1109/MIS.2020.3017205 · DOI
  38. 10.1109/MIS.2020.3014880 · DOI

Cited by

Sorted by citations

Metadata

Authors
Neera, J., Chen, X., Aslam, N., Wang, K., & Shu, Z.
Affiliations
  • Northumbria University (GB)
  • University of Alberta (CA)
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2023-04-01
Volume
35
Issue
4
Pages
4151-4163
ISSN
  • 1041-4347 (ISSN-L)
  • 1558-2191
  • 2326-3865
OpenAlex
W3134271114
Cited by
42
References
1
Citations by year
2026: 11 · 2025: 15 · 2024: 10 · 2023: 5
FWCI
1.41
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Knowledge and Data Engineering (publishedVersion)
  • CentAUR (University of Reading) (acceptedVersion)
  • Northumbria Research Link (Northumbria University) (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Brunel University Research Archive (BURA) (Brunel University London) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
Keywords
local differential privacy, recommender systems, matrix factorization, Gaussian mixture model, privacy-preserving recommendation, missing rating prediction, noise estimation, privacy-utility trade-off

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