569 search results - page 4 / 114 » An efficient clustering method for k-anonymization |
ICCD
2007
IEEE
14 years 5 months ago
2007
IEEE
Microarchitectural simulation is orders of magnitude slower than native execution. As more elements are accurately modeled, problems associated with slow simulation are further ex...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
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...
PRL
2008
13 years 8 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
AI
2006
Springer
14 years 9 days ago
2006
Springer
We focus on clustering gene expression temporal profiles, and propose a novel, simple algorithm that is powerful enough to find an efficient distribution of genes over clusters. We...
PAISI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...