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...
Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng ...
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...
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...
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
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...