Sciweavers

91 search results - page 13 / 19
» Privacy Preserving Clustering on Horizontally Partitioned Da...
Sort
View
VLDB
2006
ACM
122views Database» more  VLDB 2006»
15 years 10 months ago
A secure distributed framework for achieving k-anonymity
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
Wei Jiang, Chris Clifton
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 1 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
15 years 11 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
ICDE
2012
IEEE
221views Database» more  ICDE 2012»
13 years 4 days ago
DPCube: Releasing Differentially Private Data Cubes for Health Information
—We demonstrate DPCube, a component in our Health Information DE-identification (HIDE) framework, for releasing differentially private data cubes (or multi-dimensional histogram...
Yonghui Xiao, James J. Gardner, Li Xiong
DBSEC
2008
365views Database» more  DBSEC 2008»
14 years 11 months ago
Secure Construction of Contingency Tables from Distributed Data
Abstract. Contingency tables are widely used in many fields to analyze the relationship or infer the association between two or more variables. Indeed, due to their simplicity and ...
Haibing Lu, Xiaoyun He, Jaideep Vaidya, Nabil R. A...