Sciweavers

360 search results - page 24 / 72
» On Protection by Layout Randomization
Sort
View
ICDM
2003
IEEE
142views Data Mining» more  ICDM 2003»
15 years 2 months ago
Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques
Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers base...
Huseyin Polat, Wenliang Du
SIGGRAPH
2009
ACM
15 years 4 months ago
RACBVHs: random-accessible compressed bounding volume hierarchies
We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on ...
Tae-Joon Kim, Bochang Moon, Duksu Kim, Sung-Eui Yo...
ICDM
2006
IEEE
93views Data Mining» more  ICDM 2006»
15 years 3 months ago
Comparisons of K-Anonymization and Randomization Schemes under Linking Attacks
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attrib...
Zhouxuan Teng, Wenliang Du
PVLDB
2010
95views more  PVLDB 2010»
14 years 7 months ago
Small Domain Randomization: Same Privacy, More Utility
Random perturbation is a promising technique for privacy preserving data mining. It retains an original sensitive value with a certain probability and replaces it with a random va...
Rhonda Chaytor, Ke Wang
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
14 years 11 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu