Opening book details…
Can I read Hardness of K-anonymous Microaggregation on EtoBox?
Hardness of K-anonymous Microaggregation by Thaeter, Florian; Reischuk, RÃ1⁄4diger is a Computer Science article available to read on EtoBox.
What is Hardness of K-anonymous Microaggregation about?
a b s t r a c t k-anonymous microaggregation of data in R d 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.
Who reads Hardness of K-anonymous Microaggregation?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Thaeter, Florian; Reischuk, RÃ1⁄4diger
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2020
- Language
- EN
- Field
- Computer Science (Physical Sciences)