This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 1 Motivations of using domain generalization hierarchy: o Can we represent relations between these generation solutions? o The definition of k-minimal generalization depends on k value. Can we find an approach that is independent of k value? o How can we show generalization strategies or different ways of generalizing a DB? Note: some generalizations are minimal some are not wrt quasi-identifier. Walk through this example: low usability, high privacy high usability, low privacy The number of different possible strategies for a domain hierarchy DT = (D1, , Dn) e.g., DT = (E0, Z0, E1, Z1, . .) 2...
View Full Document
This note was uploaded on 12/07/2011 for the course COMP 7370 taught by Professor Qin,x during the Summer '08 term at Auburn University.
- Summer '08