91 search results - page 16 / 19 » Privacy Preserving Clustering on Horizontally Partitioned Da... |
101
Voted
CCS
2009
ACM
15 years 4 months ago
2009
ACM
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
91
Voted
STACS
2007
Springer
15 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
CVPR
2007
IEEE
15 years 4 months ago
2007
IEEE
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
80
Voted
SAC
2010
ACM
15 years 3 months ago
2010
ACM
Numerous privacy models based on the k-anonymity property have been introduced in the last few years. While differing in their methods and quality of their results, they all focus...
SIGKDD
2010
14 years 8 months ago
2010
The offering of anonymity in relational databases has attracted a great deal of attention in the database community during the last decade [4]. Among the different solution appr...