256 search results - page 32 / 52 » Approximation Algorithms for Hamming Clustering Problems |
111
Voted
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
128
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
124
Voted
SMI
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...
130
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
163
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...