Privacy-Preserving Social Media Data Publishing for Personalized Ranking-Based Recommendation
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Personalized recommendation is crucial to help users find pertinent information. It often relies on a large collection of user data, in particular users' online activity (e.g., tagging/rating/checking-in) on social media, to mine user preference. However, releasing such user activity data makes users vulnerable to inference attacks, as private data (e.g., gender) can often be inferred from the users' activity data. In this paper, we proposed PrivRank, a customizable and continuous privacy-preserving social media data publishing framework protecting users against inference attacks while enabling personalized ranking-based recommendations. Its key idea is to continuously obfuscate user activity data such that the privacy leakage of user-specified private data is minimized under a given data distortion budget, which bounds the ranking loss incurred from the data obfuscation process in order to preserve the utility of the data for enabling recommendations. An empirical evaluation on both synthetic and real-world datasets shows that our framework can efficiently provide effective and continuous protection of user-specified private data, while still preserving the utility of the obfuscated data for personalized ranking-based recommendation. Compared to state-of-the-art approaches, PrivRank achieves both a better privacy protection and a higher utility in all the ranking-based recommendation use cases we tested.
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
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“For example, to protect user privacy from identity disclosure, K-anonymity [9] obfuscates the released data so that each record cannot be distinguished from at least k-1 other records.”
BackgroundCalibrating 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
Cumulated gain-based evaluation of IR techniques
Järvelin, K., & Kekäläinen, J. (2002) · ACM Transactions on Information Systems · doi:10.1145/582415.582418 · Cited by 4,841 · cited 1×
“these three types of ranking loss functions [16] shows that pairwise and listwise losses are indeed upper bounds of two quantities 1-MAP and 1-NDCG, respectively, where Mean Average Precision (MAP) and Normalized Discounted Cumulative Gain (NDCG) are two popular metrics for evaluating ranking-based information retriev…”
BackgroundL -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617 · cited 1×
“The second category is theory-based and focuses on the uninformative principle [11], i.”
BackgroundDifferential 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×
“Here we adopt exponential mechanism [35], [38], [39] in our experiments as it fits our use case of categorical data.”
MethodPrivacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704 · cited 3×
“, on the use and storage of the published data [4].”
BackgroundMethodInfluentialManaging Your Private and Public Data: Bringing Down Inference Attacks Against Your Privacy
Salamatian, S., Zhang, A., du Pin Calmon, F., Bhamidipati, S., Fawaz, N., Kveton, B., Oliveira, P., & Taft, N. (2015) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2015.2442227 · Cited by 66 · cited 1×
“In the current literature, existing data obfuscation methods mainly ensure data utility by bounding the data distortion using metrics such as euclidean distance [14], Squared L(2) distance [15], Hamming distance [1] or Jensen-Shannon distance [2].”
Method
Cited by
Zhang, M., Chen, Y., & Lin, J. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3051060 · Cited by 120
Yoon, N., & Lee, H.-K. (2021) · Journal of Theoretical and Applied Electronic Commerce Research · doi:10.3390/jtaer16050107 · Cited by 104
SecRec: A Privacy-Preserving Method for the Context-Aware Recommendation System
Chen, J., Liu, L., Chen, R., Peng, W., & Huang, X. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3085562 · Cited by 32
“Methods from [8], [9], [10], [50], [51], [52] fall into this category.”
BackgroundSlokom, M., Hanjalic, A., & Larson, M. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102722 · Cited by 31
A systematic review of privacy techniques in recommendation systems
Ogunseyi, T. B., Avoussoukpo, C. B., & Jiang, Y. (2023) · International Journal of Information Security · doi:10.1007/s10207-023-00710-1 · Cited by 27
Efficient Federated Matrix Factorization Against Inference Attacks
Chai, D., Wang, L., Chen, K., & Yang, Q. (2022) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3501812 · Cited by 20
“The average information leakage of a set of input X regarding a private target Y is given by the I ( X ; Y ) , which is the mutual information between X and Y [11, 34].”
BackgroundInfluentialDecentralized Graph Neural Network for Privacy-Preserving Recommendation
Zheng, X., Wang, Z., Chen, C., Qian, J., & Yang, Y. (2023) · Proceedings of the 32nd ACM International Conference on Information and Knowledge Management · doi:10.1145/3583780.3614834 · Cited by 10
Metadata
- Authors
- Yang, D., Qu, B., & Cudre-Mauroux, P.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2019-03-01
- Volume
- 31
- Issue
- 3
- Pages
- 507-520
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2806031607
- Cited by
- 93
- References
- 7
- FWCI
- 5.80
- Type
- journal article
- Language
- en
- Open access
- green
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.