%0 Journal Article
%T A novel local search method for microaggregation
%J The ISC International Journal of Information Security
%I Iranian Society of Cryptology
%Z 2008-2045
%A Mortazavi, R.
%A Jalili, S.
%D 2015
%\ 01/01/2015
%V 7
%N 1
%P 15-26
%! A novel local search method for microaggregation
%K Microaggregation
%K Privacy Preserving Data Publishing
%K k-anonymity
%K Clustering
%R 10.22042/isecure.2015.7.1.3
%X In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squared error (SSE) is minimized. We propose a local search algorithm which iteratively satisfies the constraints of the optimal solution of the problem. The algorithm solves the problem in O (n2) time. Experimental results on real and synthetic data sets with different distributions demonstrate the effectiveness of the method in producing useful protected data sets.
%U http://www.isecure-journal.com/article_39202_a91dd3cdff3a2c497e64548b38984bef.pdf