%0 Journal Article
%A RAN Xun
%A YIN En-min
%A WANG Yong
%T Differential Privacy-Preserving Recommendation Algorithm Based on Bhattacharyya Coefficient Clustering
%D 2021
%R 10.13190/j.jbupt.2020-174
%J Journal of Beijing University of Posts and Telecommunications
%P 81-88
%V 44
%N 2
%X To improve the accuracy of recommendation algorithm under differential privacy protection, a privacy preservation recommendation algorithm is proposed based on a clustering method with Bhattacharyya coefficient(BC). In the proposed algorithm, the Bhattacharyya coefficient is used as the standard of measuring item similarity. Based on the BC similarity, the items are clustered by <i>K</i>-medoids, and the private neighbors of the items are selected from the clusters. Finally, according to the selected nearest neighbor set, the user's rating is predicted and the Top-<i>n</i> recommendations are output. The proposed algorithm effectively overcomes the problem that the calculation of similarity must depend on the common rated ratings, improves the accuracy of the similarity measurement, and also avoid the problem of quality degradation of the nearest neighbor set due to privacy protection. It is shown that the proposed algorithm not only achieves privacy preservation but also guarantees the high quality of recommendation. Therefore, the proposed algorithm effectively balances the privacy preservation and the data utility, which has good application potential in the recommendation system.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2020-174