Affiliation:
1. IIIT-Bangalore (This work was done when the author was intern at the Technical University of Darmstadt)
2. Technical University of Darmstadt
Abstract
Abstract
Clustering is a popular unsupervised machine learning technique that groups similar input elements into clusters. It is used in many areas ranging from business analysis to health care. In many of these applications, sensitive information is clustered that should not be leaked. Moreover, nowadays it is often required to combine data from multiple sources to increase the quality of the analysis as well as to outsource complex computation to powerful cloud servers. This calls for efficient privacy-preserving clustering. In this work, we systematically analyze the state-of-the-art in privacy-preserving clustering. We implement and benchmark today’s four most efficient fully private clustering protocols by Cheon et al. (SAC’19), Meng et al. (ArXiv’19), Mohassel et al. (PETS’20), and Bozdemir et al. (ASIACCS’21) with respect to communication, computation, and clustering quality. We compare them, assess their limitations for a practical use in real-world applications, and conclude with open challenges.
Reference146 articles.
1. [1] Z. Qian, Z. M. Mao, Y. Xie, and F. Yu, “On Network-level Clusters for Spam Detection.” in NDSS, 2010.
2. [2] K. Kourou, T. P. Exarchos, K. P. Exarchos, M. V. Karamouzis, and D. I. Fotiadis, “Machine learning applications in cancer prognosis and prediction,” Computational and Structural Biotechnology Journal, 2015.
3. [3] M. Ahmed, A. N. Mahmood, and M. R. Islam, “A Survey of Anomaly Detection Techniques in Financial Domain,” in Future Generation Computer Systems, 2016.
4. [4] F. Masulli and A. Schenone, “A fuzzy clustering based segmentation system as support to diagnosis in medical imaging,” Artificial Intelligence in Medicine, 1999.
5. [5] S. Gauch, M. Speretta, A. Chandramouli, and A. Micarelli, “User profiles for personalized information access,” in The adaptive web, 2007.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献