Sciweavers

148 search results - page 3 / 30
» Fast Data Anonymization with Low Information Loss
Sort
View
ICDE
2008
IEEE
178views Database» more  ICDE 2008»
14 years 7 months ago
On the Optimal Selection of k in the k-Anonymity Problem
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
IJSNET
2006
106views more  IJSNET 2006»
13 years 6 months ago
Efficient anonymity schemes for clustered wireless sensor networks
: In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS...
Satyajayant Misra, Guoliang Xue
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
13 years 3 months ago
A multi-objective approach to data sharing with privacy constraints and preference based objectives
Public data sharing is utilized in a number of businesses to facilitate the exchange of information. Privacy constraints are usually enforced to prevent unwanted inference of info...
Rinku Dewri, Darrell Whitley, Indrajit Ray, Indrak...
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 6 months ago
An efficient clustering method for k-anonymization
The k-anonymity model is a privacy-preserving approach that has been extensively studied for the past few years. To minimize the information loss due to anonymization, it is cruci...
Jun-Lin Lin, Meng-Cheng Wei
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 6 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor