Please use this identifier to cite or link to this item:
|Title:||Privacy risk diagnosis: Mining l-diversity|
Knowledge discovery problem
Monotonicity of l-diversity
|Citation:||Zare-Mirakabad, M.-R.,Jantan, A.,Bressan, S. (2009). Privacy risk diagnosis: Mining l-diversity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5667 LNCS : 216-230. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-04205-8_19|
|Abstract:||Most of the recent efforts addressing the issue of data privacy have focused on devising algorithms for anonymization and diversification. Our objective is upstream of these works: we are concerned with the diagnosis of privacy risk and more specifically in this paper with l-diversity. We show that diagnosing l-diversity for various definitions of the concept is a knowledge discovery problem that can be mapped to the framework proposed by Mannila and Toivonen. The problem can therefore be solved with level-wise algorithms such as the apriori algorithm. We introduce and prove the necessary monotonicity property with respect to subset operator on attributes set for several instantiations of the l-diversity principle. We present and evaluate an algorithm based on the apriori algorithm. This algorithm computes, for instance, "maximum sets of attributes that can safely be published without jeopardizing sensitive attributes", even if they were quasi-identifiers available from external sources, and "minimum subsets of attributes which jeopardize anonymity". © 2009 Springer Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.