Covering the Sensitive Subjects to Protect Personal Privacy in Personalized Recommendation

• Published in: IEEE transactions on services computing Vol. 11; no. 3; pp. 493 - 506
• Main Authors: Wu, Zongda, Li, Guiling, Liu, Qi, Xu, Guandong, Chen, Enhong
• Format: Journal Article
• Language: English
• Published: IEEE 01.05.2018
• Subjects: Algorithm design and analysis; Analytical models; Collaboration; Data privacy; feature distribution; Internet; personal privacy; Personalized recommendation; Privacy; Security; sensitive subject
• ISSN: 1939-1374; 2372-0204
• DOI: 10.1109/TSC.2016.2575825

Personalized recommendation has demonstrated its effectiveness in improving the problem of information overload on the Internet. However, evidences show that due to the concerns of personal privacy, users' reluctance to disclose their personal information has become a major barrier for the development of personalized recommendation. In this paper, we propose to generate a group of fake preference profiles, so as to cover up the user sensitive subjects, and thus protect user personal privacy in personalized recommendation. First, we present a client-based framework for user privacy protection, which requires not only no change to existing recommendation algorithms, but also no compromise to the recommendation accuracy. Second, based on the framework, we introduce a privacy protection model, which formulates the two requirements that ideal fake preference profiles should satisfy: (1) the similarity of feature distribution, which measures the effectiveness of fake preference profiles to hide a genuine user preference profile; and (2) the exposure degree of sensitive subjects, which measures the effectiveness of fake preference profiles to cover up the sensitive subjects. Finally, based on a subject repository of product classification, we present an implementation algorithm to well meet the privacy protection model. Both theoretical analysis and experimental evaluation demonstrate the effectiveness of our proposed approach.