Sciweavers

148 search results - page 5 / 30
» Fast Data Anonymization with Low Information Loss
Sort
View
DKE
2008
106views more  DKE 2008»
13 years 7 months ago
Towards optimal k-anonymization
When releasing microdata for research purposes, one needs to preserve the privacy of respondents while maximizing data utility. An approach that has been studied extensively in re...
Tiancheng Li, Ninghui Li
ICDM
2006
IEEE
127views Data Mining» more  ICDM 2006»
14 years 1 months ago
Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
Tiancheng Li, Ninghui Li
VLDB
2007
ACM
138views Database» more  VLDB 2007»
14 years 1 months ago
Minimality Attack in Privacy Preserving Data Publishing
Data publishing generates much concern over the protection of individual privacy. In the well-known kanonymity model and the related models such as l-diversity and (α, k)-anonymi...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, J...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
PE
2006
Springer
193views Optimization» more  PE 2006»
13 years 7 months ago
Performance evaluation of an anonymity providing protocol for wireless ad hoc networks
Malicious nodes in a mobile and wireless ad hoc network can be a threat to the security and/or anonymity of the exchanged data. While data encryption can protect the content excha...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...