Sciweavers

1013 search results - page 90 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ICDM
2007
IEEE
119views Data Mining» more  ICDM 2007»
14 years 3 months ago
Reducing UK-Means to K-Means
This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object...
Sau Dan Lee, Ben Kao, Reynold Cheng
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
14 years 1 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
ICDM
2006
IEEE
110views Data Mining» more  ICDM 2006»
14 years 3 months ago
Manifold Clustering of Shapes
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
Dragomir Yankov, Eamonn J. Keogh
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
14 years 2 months ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle