A novel local search method for microaggregation
(ندگان)پدیدآور
Mortazavi, R.Jalili, S.نوع مدرک
TextORIGINAL RESEARCH PAPER
زبان مدرک
Englishچکیده
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.
کلید واژگان
MicroaggregationPrivacy Preserving Data Publishing
k-anonymity
Clustering
شماره نشریه
1تاریخ نشر
2015-01-011393-10-11
ناشر
Iranian Society of Cryptologyشاپا
2008-20452008-3076