62 search results - page 1 / 13 » Achieving k-Anonymity by Clustering in Attribute Hierarchica... |
DAWAK
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
FSKD
2008
Springer
13 years 5 months ago
2008
Springer
Preservation of privacy in micro-data release is a challenging task in data mining. The k-anonymity method has attracted much attention of researchers. Quasiidentifier is a key co...
TKDE
2008
13 years 4 months ago
2008
Abstract--Individual privacy will be at risk if a published data set is not properly deidentified. k-Anonymity is a major technique to deidentify a data set. Among a number of k-an...
FGR
2011
IEEE
12 years 8 months ago
2011
IEEE
Abstract— We propose a novel hierarchical structured prediction approach for ranking images of faces based on attributes. We view ranking as a bipartite graph matching problem; l...
EDBT
2004
ACM
14 years 4 months ago
2004
ACM
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...