1005 search results - page 140 / 201 » Privacy Preserving Clustering |
169
click to vote
BMCBI
2005
15 years 5 months ago
2005
Background: The availability of interaction databases provides an opportunity for researchers to utilize immense amounts of data exclusively in silico. Recently there has been an ...
204
click to vote
KAIS
2000
15 years 5 months ago
2000
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
272
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
176
click to vote
STACS
2007
Springer
15 years 12 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...
189
click to vote
NIPS
2001
15 years 7 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...