6 search results - page 1 / 2 » Mondrian Multidimensional K-Anonymity |
ICDE
2007
IEEE
14 years 5 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
NIPS
2008
13 years 6 months ago
2008
We describe a novel class of distributions, called Mondrian processes, which can be interpreted as probability distributions over kd-tree data structures. Mondrian processes are m...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
ICDE
2006
IEEE
14 years 5 months ago
2006
IEEE
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
DAWAK
2009
Springer
14 years 1 months ago
2009
Springer
Interactive analysis of datacube, in which a user navigates a cube by launching a sequence of queries is often tedious since the user may have no idea of what the forthcoming query...