Affiliations: [a] Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran | [b] School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
Correspondence:
[*]
Corresponding author: Mohammad Abdollahi Azgomi, School of Computer Engineering, Iran University of Science and Technology, Hengam St., Resalat Sq., Tehran 16846-13114, Iran. Fax: +98 21 7322 5322; E-mail: azgomi@iust.ac.ir.
Abstract: So far, several techniques have been proposed for privacy preserving clustering (PPC). Most of the existing techniques have been designed based on heuristic notions without provable privacy guarantees. ϵ-differential privacy is a strong notion of privacy, which guarantees provable privacy. However, low degree of utility is the key issue of ϵ-differential notion. In this paper, we have proposed an ϵ-differential based algorithm to generate a perturbed data for PPC purpose. Hence, we have used Haar wavelet transform (HWT) for two reasons: (1) for achieving the perturbed data with much lower dimension compared to the original data in order to increase the efficiency of clustering algorithms, and (2) for adding much lower noise in order to obtain the perturbed data with both appropriate level of utility and differential privacy guarantee. We have also compared the proposed algorithm with a recent algorithm based on the utility and privacy guarantees. In addition, we have presented the results of the experiments using several datasets, which show that the proposed algorithm has an appropriate level of utility.
Keywords: Data mining, clustering, differential privacy, discrete wavelet transforms, Haar wavelet transform
