.png){kind=icon}
.png){kind=icon}
Return
Practical differentially private online advertising
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cose.2021.102504.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A B S T R A C T Powered by machine learning technology, online advertising achieves accurate advertise-ment delivery to potential customers according to online user profiles. However, it raises serious privacy concerns since the learning process may reveal sensitive information in the profiles. It is highly desirable to provide high-quality advertisement recommendations while respecting an individual's privacy. To address the privacy issues, we propose a practical privacy-preserving system that pre-dicts advertisement Click Through Rate (CTR) accurately without revealing any sensitive in-formation of individuals. Our system combines both offline and online training to achieve the goal. In the offline training phase, we develop two differentially private algorithms built upon Gradient Boosting Decision Tree (GBDT) and Field-aware Factorization Machine (FFM) algorithms, respectively, to transform features and train a privacy-preserving offline model. In the online training phase, we propose a privacy-preserving online learning algorithm to compensate for the decline of offline performance when online feature changes occur. We perform extensive experiments to evaluate the performance of our system based on three real-world datasets. The results demonstrate that our system can protect user pri-vacy without compromising the accuracy of CTR prediction, with reasonable computation overhead. (c) 2021 Published by Elsevier Ltd.
Keywords:
Differential privacy
Online advertising
Data perturbation
Learning and optimization
Recommendation system
Journal
C
IF:
5.4
Papers:
4.6K
Citations:
1.4W