Hardness of k-anonymous microaggregation.
Florian ThaeterRüdiger ReischukPublished in: Discret. Appl. Math. (2021)
Keyphrases
- information loss
- np complete
- worst case
- phase transition
- np hard
- learning theory
- original data
- digital signature scheme
- payment scheme
- np hardness
- peer to peer
- clustering algorithm
- special case
- information theoretic
- computational complexity
- data quality
- search algorithm
- case study
- privacy protection
- machine learning
- agnostic learning
- databases
- data sets