We present a novel framework for set-valued data anonymization by partial suppression regardless of the amount of background knowledge the attacker possesses, and can be adapted to both space-time and quality-time trade-offs in a "pay-as-you-go" approach. While minimizing the number of item deletions, the framework attempts to either preserve the original data distribution or retain mineable useful association rules, which targets statistical analysis and association mining, two major data mining applications on set-valued data. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Jia, X., Pan, C., Xu, X., Zhu, K. Q., & Lo, E. (2014). Ρ-uncertainty anonymization by partial suppression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8422 LNCS, pp. 188–202). Springer Verlag. https://doi.org/10.1007/978-3-319-05813-9_13
Mendeley helps you to discover research relevant for your work.