Abstract

Microaggregation is a statistical disclosure control mechanism to realize k-anonymity as a basic privacy model. The method first partitions the dataset into groups of at least k records and then aggregates the group members. Generally, larger values of k provide lower Disclosure Risk (DR) at the expense of increasing Information Loss (IL). Therefore, the data publisher has to set appropriate microaggregation parameters to produce a protected and useful anonymized data. Unfortunately, in the most of the conventional microaggregation methods, the only available parameter of the algorithm, i.e., k does not enable the data publisher to effectively control the trade-off problem between DR and IL. This paper proposes a novel microaggregation method to optimize information loss and disclosure risk, simultaneously. The trade-off problem is expressed and solved within a multi-objective optimization framework. The data publisher can choose a more preferred protected dataset from a set of non-dominated candidate solutions, or even direct the method toward a desired point. Experimental results show that for a fixed value of k, the proposed method can usually produce more protected and useful datasets in comparison with the conventional methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.