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

Privacy-Aware Recommendation with Private-Attribute Protection using Adversarial Learning

Open access
Beigi, Ghazaleh, Mosallanezhad, Ahmadreza, Guo, Ruocheng, Alvari, Hamidreza, Nou, Alexander, Liu, Huan·2020·Proceedings of the 13th International Conference on Web Search and Data Mining

Abstract

Recommendation is one of the critical applications that helps users find information relevant to their interests. However, a malicious attacker can infer users' private information via recommendations. Prior work obfuscates user-item data before sharing it with recommendation system. This approach does not explicitly address the quality of recommendation while performing data obfuscation. Moreover, it cannot protect users against private-attribute inference attacks based on recommendations. This work is the first attempt to build a Recommendation with Attribute Protection (RAP) model which simultaneously recommends relevant items and counters private-attribute inference attacks. The key idea of our approach is to formulate this problem as an adversarial learning problem with two main components: the private attribute inference attacker, and the Bayesian personalized recommender. The attacker seeks to infer users' private-attribute information according to their items list and recommendations. The recommender aims to extract users' interests while employing the attacker to regularize the recommendation process. Experiments show that the proposed model both preserves the quality of recommendation service and protects users against private-attribute inference attacks.

Integrity signals

Registry

Crossref · 10.1145/3336191.3371832

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

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

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?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Beigi, G., Mosallanezhad, A., Guo, R., Alvari, H., Nou, A., & Liu, H.
Affiliations
  • Arizona State University (US)
  • Arizona State University, Tempe, AZ, USA
Venue
Proceedings of the 13th International Conference on Web Search and Data Mining
Publisher
ACM
Published
2020-01-20
Pages
34-42
OpenAlex
W2989872778
Cited by
80
References
50
Citations by year
2026: 6 · 2025: 13 · 2024: 17 · 2023: 12 · 2022: 11 · 2021: 13 · 2020: 8
FWCI
4.20
Type
conference paper
Language
en
Open access
Locations
  • ACM International Conference on Web Search and Data Mining (WSDM) (publishedVersion)
  • arXiv (Cornell University) (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
adversarial learning, recommendation quality, user privacy protection

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