Abstract

k-anonymous microaggregation of data in Rd with d≥2 is shown to be NP-hard for all k≥4, extending a previous result for the case k=3 only. The proof uses similarities between microaggregation and the k-means problem. A reduction of Planar 3-SAT to the k-means clustering problem is adapted to 4-anonymous clustering. Then this construction is extended to arbitrary k≥4.

Full Text
Published version (Free)

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