Sciweavers

256 search results - page 3 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
ICPR
2008
IEEE
14 years 7 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
JCSS
2002
199views more  JCSS 2002»
13 years 5 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...