4526 search results - page 80 / 906 » An overview of clustering methods |
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Query result clustering has recently attracted a lot of attention to provide users with a succinct overview of relevant results. However, little work has been done on organizing t...
IWCC
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper will discuss high performance clustering from a series of critical topics: architectural design, system software infrastructure, and programming environment. This will ...
GFKL
2004
Springer
14 years 2 months ago
2004
Springer
Cluster ensembles are collections of individual solutions to a given clustering problem which are useful or necessary to consider in a wide range of applications. The R package˜c...
ICCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper presents an innovative, adaptive variant of Kohonen’s selforganizing maps called ASOM, which is an unsupervised clustering method that adaptively decides on ...