A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6149248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A practical approximation algorithm for optimal \(k\)-anonymity |
scientific article; zbMATH DE number 6149248 |
Statements
A practical approximation algorithm for optimal \(k\)-anonymity (English)
0 references
28 March 2013
0 references
privacy-preserving data mining
0 references
\(k\)-anonymity
0 references
\(l\)-diversity
0 references
approximation algorithms for NP-hard problems
0 references
frequent generalized itemsets
0 references
0.9015007019042968
0 references
0.8649122714996338
0 references
0.8398178815841675
0 references
0.8309184908866882
0 references
0.8257998824119568
0 references
