2600 search results - page 19 / 520 » Clustering with or without the Approximation |
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
ECIR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
BIODATAMINING
2008
13 years 7 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...