DP-UserPro: differentially private user profile construction and publication

Zheng HUO, Ping HE, Lisha HU, Huanyu ZHAO

PDF(507 KB)
PDF(507 KB)
Front. Comput. Sci. ›› 2021, Vol. 15 ›› Issue (5) : 155811. DOI: 10.1007/s11704-020-9462-9
RESEARCH ARTICLE

DP-UserPro: differentially private user profile construction and publication

Author information +
History +

Abstract

User profiles are widely used in the age of big data. However, generating and releasing user profiles may cause serious privacy leakage, since a large number of personal data are collected and analyzed. In this paper, we propose a differentially private user profile construction method DP-UserPro, which is composed of DP-CLIQUE and privately top-k tags selection. DP-CLIQUE is a differentially private high dimensional data cluster algorithm based on CLIQUE. The multidimensional tag space is divided into cells, Laplace noises are added into the count value of each cell. Based on the breadthfirst-search, the largest connected dense cells are clustered into a cluster. Then a privately top-k tags selection approach is proposed based on the score function of each tag, to select the most important k tags which can represent the characteristics of the cluster. Privacy and utility of DP-UserPro are theoretically analyzed and experimentally evaluated in the last. Comparison experiments are carried out with Tag Suppression algorithm on two real datasets, to measure the False Negative Rate (FNR) and precision. The results show that DP-UserPro outperforms Tag Suppression by 62.5% in the best case and 14.25% in the worst case on FNR, and DP-UserPro is about 21.1% better on precision than that of Tag Suppression, in average.

Keywords

user profile / DP-CLIQUE / clustering / differential privacy / recommender system

Cite this article

Download citation ▾
Zheng HUO, Ping HE, Lisha HU, Huanyu ZHAO. DP-UserPro: differentially private user profile construction and publication. Front. Comput. Sci., 2021, 15(5): 155811 https://doi.org/10.1007/s11704-020-9462-9

References

[1]
Pan Y, Wu D. Personalized Online-to-Offline (O2O) service recommendation based on a novel frequent service-set network. IEEE Systems Journal, 2019,13(2): 1599–1607
CrossRef Google scholar
[2]
Chae D, Kim S, Lee J. Autoencoder-based personalized ranking framework unifying explicit and implicit feedback for accurate top-N recommendation. Knowledge-Based Systems, 2019, 176: 110–121
CrossRef Google scholar
[3]
Wang X, Yang T L, Kuang L, Liu X, Zhang Q, Deen J M. A tensor-based big-data-driven routing recommendation approach for heterogeneous networks. IEEE Network, 2019, 33(1): 64–69
CrossRef Google scholar
[4]
Liu Y, Liu A, Liu X, Huang X. A statistical approach to participant selection in location-based social networks for offline event marketing. Information Sciences, 2019, 480: 90–108
CrossRef Google scholar
[5]
Li D, Lv Q, Shang L, Gu N. Efficient privacy-preserving content recommendation for online social communities. Neurocomputing, 2017, 219: 440–454
CrossRef Google scholar
[6]
Zhao Y, Li D, Lv Q, Shang L. A scalable algorithm for privacypreserving item-based top-N recommendation. 2018, arXiv Preprint arXiv:1811.02217
[7]
Canny F J. Collaborative filtering with privacy via factor analysis. In: Proceedings of International ACM SIGIR Conference on Research and Development in Information Retrieval. 2002, 238–245
CrossRef Google scholar
[8]
Zhan J, Hsieh L C, Wang C I, Hsu T S, Liau C J, Wang D W. Privacypreserving collaborative recommender systems. IEEE Transactions on Systems, Man, and Cybernetics, 2010, 40(4): 472–476
CrossRef Google scholar
[9]
Berkovsky S, Eytani Y, Kuflik T, Ricci F. Enhancing privacy and preserving accuracy of a distributed collaborative filtering. In: Proceedings of ACM Conference on Recommender Systems. 2007, 9–16
CrossRef Google scholar
[10]
Parameswaran R, Blough D. Privacy preserving collaborative filtering using data obfuscation. In: Proceedings of IEEE International Conference on Granular Computing. 2007, 380–386
CrossRef Google scholar
[11]
Polat H, Du W. Privacy-preserving collaborative filtering using randomized perturbation techniques. In: Proceedings of IEEE International Conference on Data Mining. 2003, 625–628
[12]
McSherry F, Mironov I. Differentially private recommender systems: building privacy into the net. In: Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2009, 627–636
CrossRef Google scholar
[13]
Machanavajjhala A, Korolova A, Sarma D A. Personalized social recommendations accurate or private? Proceedings of the VLDB Endowment, 2011, 4(7): 440–450
CrossRef Google scholar
[14]
Arnau P J, Perego A, Ferrari E, Forne J, Rebollo-Monedero D. Privacypreserving enhanced collaborative tagging. IEEE Transactions on Knowledge and Data Engineering, 2014, 26(1): 180–193
CrossRef Google scholar
[15]
Zhu T, Li G, Zhou W, Xiong P, Yuan C. Privacy-preserving topic model for tagging recommender systems. Knowledge and Information Systems, 2016, 46(1):33–58
CrossRef Google scholar
[16]
Cormode G, Procopiuc M, Shen E, Shen E, Yu T. Differentially private spatial decompositions. In: Proceedings of International Conference on Data Engineering. 2012, 20–31
CrossRef Google scholar
[17]
Wahbeh W, Yang W, Li N. Differentially private grids for geospatial data. In: Proceedings of International Conference on Data Engineering. 2012, 757–768
[18]
Dwork C, Mesherry F, Smith A. Calibrating noise to sensitivity in private data analysis. In: Proceedings of the 3rd Theory of Cryptography Conference. 2006, 265–284
CrossRef Google scholar

RIGHTS & PERMISSIONS

2021 Higher Education Press
AI Summary AI Mindmap
PDF(507 KB)

Accesses

Citations

Detail

Sections
Recommended

/