Sciweavers

387 search results - page 65 / 78
» Data mining with differential privacy
Sort
View
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
15 years 4 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou
CCS
2007
ACM
15 years 4 months ago
Privacy-preserving remote diagnostics
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
Justin Brickell, Donald E. Porter, Vitaly Shmatiko...
WWW
2007
ACM
15 years 10 months ago
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...
Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg
DAWAK
2006
Springer
15 years 1 months ago
Two New Techniques for Hiding Sensitive Itemsets and Their Empirical Evaluation
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
Ahmed HajYasien, Vladimir Estivill-Castro
ICDE
2009
IEEE
392views Database» more  ICDE 2009»
16 years 9 months ago
FF-Anonymity: When Quasi-Identifiers Are Missing
Existing approaches on privacy-preserving data publishing rely on the assumption that data can be divided into quasi-identifier attributes (QI) and sensitive attribute (SA). This ...
Ada Wai-Chee Fu, Ke Wang, Raymond Chi-Wing Wong, Y...