Sciweavers

Share
6 search results - page 1 / 2
» Mondrian Multidimensional K-Anonymity
Sort
View
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
12 years 6 months ago
On Multidimensional k-Anonymity with Local Recoding Generalization
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 ...
NIPS
2008
11 years 6 months ago
The Mondrian Process
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...
Daniel M. Roy, Yee Whye Teh
VLDB
2005
ACM
136views Database» more  VLDB 2005»
11 years 11 months ago
On k-Anonymity and the Curse of Dimensionality
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...
Charu C. Aggarwal
ICDE
2006
IEEE
176views Database» more  ICDE 2006»
12 years 6 months ago
Mondrian Multidimensional K-Anonymity
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...
DAWAK
2009
Springer
12 years 2 months ago
Recommending Multidimensional Queries.
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...
Arnaud Giacometti, Elsa Negre, Patrick Marcel
books