By Topic

An Efficient Microaggregation Algorithm for Mixed Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Cen Ting-ting ; Math, Phys. & Inf. Eng. Coll. of Zhejiang, Normal Univ., Jinhua ; Han Jian-min ; Yu Hui-qun ; Yu Juan

Microaggregation is an important technique to the k-anonymized datasets. However, most existing microaggregation algorithms to achieving k-anonymity have some defects on distance measurement for categorical and mixed data. In this paper, we introduce a categorical data semantic hierarchy to their distance measurement to improve clustering quality. The paper also investigates mixed distance for mixed data and designs an efficient microaggregation algorithm for them. Experiments show that the distance measurement for categorical data cause less distortion, and the improved microaggregation algorithm based on the mixed distance enjoys better clustering quality than the traditional MDAV algorithm.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:3 )

Date of Conference:

12-14 Dec. 2008