Sciweavers

19 search results - page 1 / 4
» Coresets for Discrete Integration and Clustering
Sort
View
FSTTCS
2006
Springer
13 years 8 months ago
Coresets for Discrete Integration and Clustering
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...
Sariel Har-Peled
COMPGEOM
2005
ACM
13 years 6 months ago
Smaller coresets for k-median and k-means clustering
In this paper, we show that there exists a (k, ε)-coreset for k-median and k-means clustering of n points in IRd , which is of size independent of n. In particular, we construct ...
Sariel Har-Peled, Akash Kushal
COMPGEOM
2007
ACM
13 years 9 months ago
A PTAS for k-means clustering based on weak coresets
Dan Feldman, Morteza Monemizadeh, Christian Sohler
COMPGEOM
2006
ACM
13 years 11 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
PRL
2010
188views more  PRL 2010»
12 years 11 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...