A practical approximation algorithm for optimal k-anonymity.
Batya KenigTamir TassaPublished in: Data Min. Knowl. Discov. (2012)
Keyphrases
- optimal solution
- dynamic programming
- worst case
- computational complexity
- detection algorithm
- preprocessing
- error tolerance
- globally optimal
- theoretical analysis
- cost function
- objective function
- closed form
- learning algorithm
- segmentation algorithm
- optimization algorithm
- classification algorithm
- np hard
- k means
- evolutionary algorithm
- linear programming
- similarity measure
- exhaustive search
- data sets