Minimum spanning tree partitioning algorithm for microaggregation
Published in IEEE Transactions on Knowledge and Data Engineering • May 24, 2005
NobleIDNI2P44W73R15S63
Authors:,
Michael Laszlo
Sumitra Mukherjee
Abstract
This paper presents a clustering algorithm for partitioning a minimum spanning tree with a constraint on minimum group size. The problem is motivated by microaggregation, a disclosure limitation technique in which similar records are aggregated into groups containing a minimum of k records. Heuristi...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!